Provable algorithms for parallel generalized sweep scheduling

Authors:
V. S. Anil Kumar;Madhav V. Marathe;Srinivasan Parthasarathy;Aravind Srinivasan;Sibylle Zust
Affiliations:
Virginia Bioinformatics Institute and Department of Computer Science, Virginia Tech, Blacksburg, VA, USA;Virginia Bioinformatics Institute and Department of Computer Science, Virginia Tech, Blacksburg, VA, USA;Department of Computer Science, University of Maryland, College Park, MD 20742, USA;Department of Computer Science and UMIACS, University of Maryland, College Park, MD 20742, USA;-
Venue:
Journal of Parallel and Distributed Computing
Year:
2006

Citing 6
Cited 2

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
A general performance model for parallel sweeps on orthogonal grids for particle transport calculations

Proceedings of the 14th international conference on Supercomputing
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Parallel algorithms for radiation transport on unstructured grids

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Three, four, five, six, or the complexity of scheduling with communication delays

Operations Research Letters

Parallel algorithms for Sn transport sweeps on unstructured meshes

Journal of Computational Physics
Nonlinear Krylov acceleration applied to a discrete ordinates formulation of the k-eigenvalue problem

Journal of Computational Physics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we introduce abstract algebraic analysis of the topological structure of a banyan network, which has become the baseline for most switching networks. The analysis provides the following key results: (1) The switching elements of a switching ...