Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs

@article{Andronikos1999OptimalSF,
  title={Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs},
  author={Theodore Andronikos and Nectarios Koziris and George K. Papakonstantinou and Panayiotis Tsanakas},
  journal={J. Parallel Distrib. Comput.},
  year={1999},
  volume={57},
  pages={140-165}
}
Then-dimensional grid is one of the most representative patterns of data flow in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. The two most frequently used scheduling models for grids are the unit execution time-zero communication delay (UET) and the unit execution time?unit communication time (UET-UCT). In this paper we introduce an enhanced model… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Minimizing completion time for loop tiling with computation and communication overlapping

  • Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001
  • 2001
VIEW 4 EXCERPTS
CITES BACKGROUND

Optimal scheduling for UET-UCT grids into fixed number of processors

  • Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing
  • 2000
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS

Scheduling of tiled nested loops onto a cluster with a fixed number of SMP nodes

  • 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.
  • 2004
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Etude de Problems d

C. Picouleau
  • Optimization dans les Systemes Distribues. These, Universite Pierre et Marie Curie,
  • 1992
VIEW 1 EXCERPT