This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
March 1998 (vol. 9 no. 3)
pp. 312-319
ASCII Text
x 
 
G. Manimaran, C. Siva Ram Murthy, "An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 3, pp. 312-319, March, 1998.
 
 
BibTex
x
 
@article{ 10.1109/71.674322,
author = {G. Manimaran and C. Siva Ram Murthy},
title = {An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {9},
number = {3},
issn = {1045-9219},
year = {1998},
pages = {312-319},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.674322},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
IS - 3
SN - 1045-9219
SP312
EP319
EPD - 312-319
A1 - G. Manimaran,
A1 - C. Siva Ram Murthy,
PY - 1998
KW - Multiprocessor
KW - real-time systems
KW - dynamic scheduling
KW - parallelizable tasks
KW - resource constraints.
VL - 9
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic tasks) in multiprocessor systems. A real-time task is characterized by its deadline, resource requirements, and worst case computation time on p processors, where p is the degree of parallelization of the task. We use this parallelism in tasks to meet their deadlines and, thus, obtain better schedulability compared to nonparallelizable task scheduling algorithms. To study the effectiveness of the proposed scheduling algorithm, we have conducted extensive simulation studies and compared its performance with the myopic [8] scheduling algorithm. The simulation studies show that the schedulability of the proposed algorithm is always higher than that of the myopic algorithm for a wide variety of task parameters.

[1] D. Babbar and P. Krueger, "On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors," Proc. Int'l. Conf. Parallel Processing, vol. 2, pp. 29-38, 1994.
[2] K.P. Belkhale and P. Banerjee, "Approximate Algorithms for the Partitionable Independent Task Scheduling Problem," Proc. Int'l. Conf. Parallel Processing, vol. 1, pp. 72-75, 1990.
[3] M.L. Dertouzos and A.K. Mok, Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks IEEE Trans. Software Eng., vol. 15, no. 12, pp. 1497-1505, 1989.
[4] R. Krishnamoorthy and E. Ma, "An Approximate Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems," IEEE Trans. Computers, vol. 41, no. 12, pp. 1,572-1,579, Dec. 1992.
[5] J.W.S. Liu,K.J. Lin,W.K. Shih,J.Y. Chung,A. Yu,, and W. Zhao,“Algorithms for Scheduling Imprecise Computations,” IEEE Computer, pp. 58-68, May 1991.
[6] G. Manimaran, C.S.R. Murthy, M. Vijay, and K. Ramamritham, "New Algorithms for Resource Reclaiming from Precedence Constrained Tasks in Multiprocessor Real-Time Systems," to appear J. Parallel and Distributed Computing, vol. 44, no. 2, pp. 123-132, Aug. 1997.
[7] G. Manimaran, C.S.R. Murthy, and K. Ramamritham, "A New Approach for Scheduling of Parallelizable Tasks in Real-Time Multiprocessor Systems," to appear in Real Time Systems.
[8] K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, Apr. 1990.
[9] K. Ramamritham, “Allocation and Scheduling of Precedence-Related Periodic Tasks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 412-420, Apr. 1995.
[10] C. Shen, K. Ramamritham, and J.A. Stankovic, "Resource Reclaiming in Multiprocessor Real-Time Systems," IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 4, Apr. 1993, pp. 382-397.
[11] Q. Wang and H. Cheng,“A heuristic of scheduling parallel tasks and its analysis,”SIAM J. Comput., vol. 21, no. 2, pp. 281–294, Apr. 1992.
[12] J. Xu and D.L. Parnas, “Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations,” IEEE Trans. Software Eng., vol. 16, no. 3, pp. 360-369, Mar. 1990.
[13] W. Zhao, K. Ramamritham, and J.A. Stankovic, “Scheduling Tasks with Resource Requirements in Hard Real Time Systems,” IEEE Trans. Software Eng., vol. 13, no. 5, pp. 564-577, May 1987.
[14] A.Y. Zomaya, "Parallel Processing For Real-Time Simulation: A Case Study," IEEE Parallel and Distributed Technology, pp. 49-56, June 1996.

Index Terms:
Multiprocessor, real-time systems, dynamic scheduling, parallelizable tasks, resource constraints.
Citation:
G. Manimaran, C. Siva Ram Murthy, "An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 3, pp. 312-319, March 1998, doi:10.1109/71.674322
Usage of this product signifies your acceptance of the Terms of Use.