Experimental Evaluation of Task Scheduling Accuracy: Implications for the Scheduling Model

IEICE Transactions on Information and Systems

Volumn E86-D, Issue 9, 2003, Pages 1620-1627

  Sinnen, Oliver ^a   Sousa, Leonel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

DAG; Enhanced scheduling model; Scheduling accuracy; Task scheduling

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; GRAPH THEORY; PROGRAM PROCESSORS; SCHEDULING;

DIRECTED ACYCLIC GRAPH (DAG); ENHANCED SCHEDULING MODELS; SCHEDULING ACCURACY; TASK SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 1642360785     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. V. Sarkar, Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors, MIT Press, 1989.
2. A. Darte, Y. Robert, and F. Vivien, Scheduling and Automatic Parallelization, Brinkhäuser, Boston, USA, 2000.
3. I. Ahmad and Y.-K. Kwok, "On exploiting task duplication in parallel program scheduling," IEEE Trans. Parallel Distrib. Syst., vol.9, no.8, pp.872-892, Sept. 1998.
4. B. Kruatrachue and T. Lewis, "Grain size determination for parallel processing," IEEE Software, pp.23-32, Jan. 1988.
5. M.Y. Wu and D.D. Gajski, "Hypertool: A programming aid for message-passing systems," IEEE Trans. Parallel Distrib. Syst., vol.1, no.3, pp.330-343, July 1990.
6. Y.-K. Kwok and I. Ahmad, "Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors," Cluster Computing: The Journal of Networks, Software Tools, and Applications, vol.3, no.2, pp.113-124, 2000.
7. G.C. Sih and E.A. Lee, "A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures," IEEE Trans. Parallel Distrib. Syst., vol.4, no.2, pp.175-186, Feb. 1993.
8. O. Sinnen and L. Sousa, "Exploiting unused time slots in list-scheduling considering communication contention," Euro-Par 2001 Parallel Processing, Lecture Notes in Computer Science, vol.2150, pp.166-170, Springer-Verlag, 2001.
9. O. Sinnen and L. Sousa, "Scheduling task graphs on arbitrary processor architectures considering contention," High Performance Computing and Networking, Lecture Notes in Computer Science, vol.2110, pp.373-382, Springer-Verlag, 2001.
10. A. Gerasoulis and T. Yang, "A comparison of clustering heuristics for scheduling DAGs on multiprocessors," J. Parallel Distrib. Comput., vol.16, no.4, pp.276-291, Dec. 1992.
11. C.L. McCreary, A.A. Khan, J.J. Thompson, and M.E. McArdle, "A comparison of heuristics for scheduling DAGs on multiprocessors," Eighth International Parallel Processing Symposium 1994, pp.446-451, April 1994.
12. O. Sinnen and L. Sousa, "Comparison of contention aware list scheduling heuristics for cluster computing," Workshop on Scheduling and Resource Management for Cluster Computing (ICPP 2001), pp.382-387, IEEE Computer Society Press, Valencia, Spain, Sept. 2001.
13. T. Yang and A. Gerasoulis, "PYRROS: Static scheduling and code generation for message passing multiprocessors," Proc. 6th ACM International Conference on Supercomputing, pp.428-437, Washington D.C., July 1992.
14. O. Sinnen, Experimental evaluation of task scheduling accuracy, Tese de Mestrado (Master's thesis), Instituto Superior Técnico, Technical University Lisbon, Portugal, Dec. 2001.
15. C. Berge, Graphs and Hypergraphs, second ed., North-Holland, 1976.
16. D.E. Culler and J.P. Singh, Parallel Computer Architecture, Morgan Kaufmann Publishers, 1999.
17. S. Telford, BOBCAT User Guide, Edinburgh Parallel Computing Centre, Scotland, UK, May 2000. http://www.epcc.ed.ac.uk/sun/documents/introdoc.html
18. J. White III and S. Bova, "Where's the overlap? An analysis of popular MPI implementations," Proc. MPIDC 1999, 1999.
19. O. Beaumont, V. Boudet, and Y. Robert, "A realistic model and an efficient heuristic for scheduling with heterogeneous processors," Technical Report LIP RR-2001-37, LIP, École Normale Supérieure de Lyon, Sept. 2001.
20. D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, E.E. Santos, K.E. Schauser, R. Subramonian, and T. von Eicken, "LogP: A practical model of parallel computation," Commun. ACM, vol.39, no.11, pp.78-85, Nov. 1996.