Scheduling Parallel Program Tasks with Non-negligible Intertask Communications on to Numa Multiprocessor Systems

The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature.

[1]  Tao Yang,et al.  On the Granularity and Clustering of Directed Acyclic Task Graphs , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[3]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[4]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[5]  V. Rajaraman,et al.  Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Mayez A. Al-Mouhamed,et al.  Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs , 1990, IEEE Trans. Software Eng..

[8]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

[9]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[10]  Boontee Kruatrachue,et al.  Grain size determination for parallel processing , 1988, IEEE Software.

[11]  C. Siva Ram Murthy,et al.  Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors , 1994, IEEE Trans. Parallel Distributed Syst..

[12]  Mayez A. Al-Mouhamed,et al.  Performance Evaluation of Scheduling Precedence-Constained Computations on Message-Passing Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[13]  Tao Yang,et al.  A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors , 1992, J. Parallel Distributed Comput..

[14]  Cheng Chen,et al.  A new scheduling strategy for NUMA multiprocessor systems , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[15]  Mayez A. Al-Mouhamed,et al.  Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[16]  Richard Wolski,et al.  Program Partitioning for NUMA Multiprocessor Computer Systems , 1993, J. Parallel Distributed Comput..

[17]  Eduardo B. Fernández,et al.  Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules , 1973, IEEE Transactions on Computers.

[18]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[19]  Edward A. Lee,et al.  Scheduling to Account for Interprocessor Communication within Interconnection-Constrained Processor Networks , 1990, International Conference on Parallel Processing.