A comparison of scheduling approaches for mixed-parallel applications on heterogeneous platforms

Sixth International Symposium on Parallel and Distributed Computing, ISPDC 2007

Volumn , Issue , 2007, Pages

  N'Takpé, Tchimou ^a   Suter, Frédéric ^a   Casanova, Henri ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b University of Hawai'i at Manoa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HOMOGENEOUS CLUSTERS; MIXED-PARALLEL APPLICATIONS;

PROBLEM SOLVING; SCHEDULING ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 35348867977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2007.1     Document Type: Conference Paper

References (14)

1. V. Boudet, F. Desprez, and F. Suter. One-Step Algorithm for Mixed Data and Task Parallel Scheduling Without Data Replication. In 17th Int. Parallel and Distributed Processing Symposium (IPDPS), Apr. 2003.
2. H. Casanova, F. Desprez, and F. Suter. From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling. In 10th Int. Euro-Par Conference, volume 3149 of LNCS, pages 230-237, Aug. 2004.
3. S. Chakrabarti, J. Demmel, and K. Yelick. Modeling the Benefits of Mixed Data and Task Parallelism. In Symp. on Parallel Algorithms and Architectures, pages 74-83, 1995.
4. DAG Generation Program, http://www.loria.fr/~suter/dags.html.
5. Y.-K. Kwok and I. Ahmad. Benchmarking and Comparison of the Task Graph Scheduling Algorithms. JPDC, 59(3):381-422, 1999.
6. A. Legrand, L. Marchai, and H. Casanova. Scheduling Distributed Applications: The SimGrid Simulation Framework. In 3rd IEEE Symp. on Cluster Computing and the Grid (CC-Grid), pages 138-145, May 2003.
7. R. Lepère, D. Trystram, and G. Woeginger. Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. Int. Journal on Foundations of Computer Science, 13(4):613-627, 2002.
8. W. Ludwig and P. Tiwari. Scheduling Malleable and Nonmalleable Tasks. In Symp. on Discrete Algorithms (SODA), pages 167-176, 1994.
9. T. N'Takpé and F. Suter. Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms. In 12th Int. Conf. on Parallel and Distributed Systems (ICPADS), pages 3-10, July 2006.
10. A. Radulescu and A. van Gemund. A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling. In 15th Int. Conf. on Parallel Processing (ICPP), Valencia, Spain, Sept. 2001.
11. S. Ramaswany. Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications. PhD thesis, Univ. of Illinois, Urbana-Champaign, 1996.
12. T. Rauber and G. Rünger. Compiler Support for Task Scheduling in Hierarchical Execution Models. Journal of Systems Architecture, 45:483-503, 1998.
13. H. Topcuoglu, S. Hariri, and M.-Y Wu. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE TPDS, 13(3):260-274, 2002.
14. J. Turek, J. Wolf, and P. Yu. Approximate Algorithms for Scheduling Parallelizable Tasks. In Symp. on Parallel Algorithms and Architectures, pages 323-332, 1992.