Home Articles List Article Information
JES. Journal of Engineering Sciences
Journal Archive
Volume Volume 52 (2024)
Volume Volume 51 (2023)
Volume Volume 50 (2022)
Volume Volume 49 (2021)
Volume Volume 48 (2020)
Volume Volume 47 (2019)
Volume Volume 46 (2018)
Volume Volume 45 (2017)
Volume Volume 44 (2016)
Volume Volume 43 (2015)
Volume Volume 42 (2014)
Volume Volume 41 (2013)
Volume Volume 40 (2012)
Volume Volume 39 (2011)
Volume Volume 38 (2010)
Volume Volume 37 (2009)
Volume Volume 36 (2008)
Volume Volume 35 (2007)
Volume Volume 34 (2006)
Saad, E., Keshk, H., Saleh, M., 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
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
Saad, E., Keshk, H., Saleh, M., 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
Saad, E., Keshk, H., Saleh, M., 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

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

Article 6, Volume 35, No 6, November and December 2007, Page 1443-1453  XML PDF (463.34 K)
Document Type: Research Paper
DOI: 10.21608/jesaun.2007.114578
View on SCiNiTO View on SCiNiTO
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
Main Subjects
Electrical Engineering, Computer Engineering and Electrical power and machines engineering.
Statistics
Article View: 88
PDF Download: 287