Sciweavers

Share
JPDC
2006

Provable algorithms for parallel generalized sweep scheduling

8 years 3 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by iteratively sweeping across a mesh from multiple directions. Each sweep involves solving the operator locally at each cell. However, each direction induces a partial order in which this computation can proceed. On a distributed computing system, the goal is to schedule the computation, so that the length of the schedule is minimized. Due to efficiency and coupling considerations, we have an additional constraint, namely, a mesh cell must be processed on the same processor along each direction. Problems similar in nature to sweep scheduling arise in several other applications, and here we formulate a combinatorial generalization of this problem that captures the sweep scheduling constraints, and call it the generalized sweep scheduling problem. Several heuristics have been proposed for this problem; see (22; 23...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JPDC
Authors V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan, Sibylle Zust
Comments (0)
books