In this paper, a scheduling algorithm based on deadline time and precedence constraints was developed to schedule hard real-time tasks on multiprocessor systems. The real-time tasks are characterized by their arrival time, deadline time, computation time and precedence constraints. Scheduling problem for these tasks has been solved to determine the order of scheduling tasks on the processors to minimize the overall computation time, and obtain speeding up. The effectiveness of the developed algorithm is shown through a simulation study.
Saad, E. M., Keshk, H. A., Saleh, M. A., & Hamam, A. (2007). SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS. JES. Journal of Engineering Sciences, 35(No 6), 1443-1453. doi: 10.21608/jesaun.2007.114578
MLA
E. M. Saad; H. A. Keshk; M. A. Saleh; A.A. Hamam. "SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS", JES. Journal of Engineering Sciences, 35, No 6, 2007, 1443-1453. doi: 10.21608/jesaun.2007.114578
HARVARD
Saad, E. M., Keshk, H. A., Saleh, M. A., Hamam, A. (2007). 'SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS', JES. Journal of Engineering Sciences, 35(No 6), pp. 1443-1453. doi: 10.21608/jesaun.2007.114578
VANCOUVER
Saad, E. M., Keshk, H. A., Saleh, M. A., Hamam, A. SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS. JES. Journal of Engineering Sciences, 2007; 35(No 6): 1443-1453. doi: 10.21608/jesaun.2007.114578
)
View on SCiNiTO