Dynamic Real-Time Task Scheduling on Hypercubes

Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention. However, until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. Meshes and hypercubes belong to this class of multiprocessors. In this paper, we propose a new on-line scheduling algorithm for hypercube systems called Deferred Earliest Deadline First (DEDF). The main idea of the DEDF algorithm is to defer the scheduling as long as possible, so that a set of jobs is scheduled at once instead of one at a time. For processor allocation using DEDF, we have introduced a new concept?available time window (ATW). By using ATW, the system utilization can be improved and thereby the deadlines of more of tasks can be met. Simulation results indicate that the DEDF algorithm performs significantly better than the earlier proposed Buddy/RT and Stacking algorithms for a wide range of workloads.

[1]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[2]  Qing Yang,et al.  Prime Cube Graph Approach for Processor Allocation in Hypercube Multiprocessors , 1991, ICPP.

[3]  James L. Peterson,et al.  Buddy systems , 1977, CACM.

[4]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[5]  Krithi Ramamritham,et al.  Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems , 1989, IEEE Trans. Parallel Distributed Syst..

[6]  Mukesh Singhal,et al.  A transfer policy for global scheduling algorithms to schedule tasks with deadlines , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[7]  Phillip Krueger,et al.  ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..

[8]  Prasant Mohapatra.  Processor Allocation Using Partitioning in Mesh Connected Parallel Computers , 1996, J. Parallel Distributed Comput..

[9]  J. Kim,et al.  A Top-Down Processor Allocation Scheme for Hypercube Computers , 1991, IEEE Trans. Parallel Distributed Syst..

[10]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

[11]  Phillip Krueger,et al.  On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

[12]  Mukesh Singhal,et al.  A load index and a transfer policy for global scheduling tasks with deadlines , 1995, Concurr. Pract. Exp..

[13]  Chita R. Das,et al.  A Lazy Scheduling Scheme for Hypercube Computers , 1995, J. Parallel Distributed Comput..

[14]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[15]  John P. Hayes,et al.  Subcube Allocation in Hypercube Computers , 1991, IEEE Trans. Computers.

[16]  Bhagirath Narahari,et al.  Preemptive Scheduling of Independent Jobs on Partitionable Parallel Architectures , 1992, ICPP.

[17]  Nian-Feng Tzeng,et al.  Dynamic processor allocation in hypercube computers , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.