Saad, E., Keshk, H., Saleh, M., Hamam, A. (2007). SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS. test, 35(No 6), 1443-1453. doi: 10.21608/jesaun.2007.114578
E. M. Saad; H. A. Keshk; M. A. Saleh; A.A. Hamam. "SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS". test, 35, No 6, 2007, 1443-1453. doi: 10.21608/jesaun.2007.114578
Saad, E., Keshk, H., Saleh, M., Hamam, A. (2007). 'SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS', test, 35(No 6), pp. 1443-1453. doi: 10.21608/jesaun.2007.114578
Saad, E., Keshk, H., Saleh, M., Hamam, A. SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS. test, 2007; 35(No 6): 1443-1453. doi: 10.21608/jesaun.2007.114578

SCHEDULING HARD REAL-TIME TASKS WITH PRECEDENCE CONSTRAINTS ON MULTIPROCESSOR SYSTEMS

JES. Journal of Engineering Sciences
Article 6, Volume 35, No 6, November and December 2007, Pages 1443-1453    PDF (463.34 K)
Document Type: Research Paper
DOI: 10.21608/jesaun.2007.114578
Authors
E. M. Saad* 1; H. A. Keshk1; M. A. Saleh1; A.A. Hamam2
1Faculty of Engineering Helwan University, Cairo
2Thebes Academy
Abstract
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.
Keywords
Task Graph; Optimization; Real-time system; Parallel processing; multiprocessor scheduling
Statistics
Article View: 109
PDF Download: 324