|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| K. Ramamritham, J.A. Stankovic, P.F. Shiah, "Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 2, pp. 184-194, April, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/71.80146, author = {K. Ramamritham and J.A. Stankovic and P.F. Shiah}, title = {Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {1}, number = {2}, issn = {1045-9219}, year = {1990}, pages = {184-194}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.80146}, 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 - Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems IS - 2 SN - 1045-9219 SP184 EP194 EPD - 184-194 A1 - K. Ramamritham, A1 - J.A. Stankovic, A1 - P.F. Shiah, PY - 1990 KW - Index Termsdeadlines; scheduling algorithms; real-time multiprocessor systems; heuristic functions; worst-case computation times; deadlines; resources requirements; partial schedule; feasible schedule; dynamic scheduling; multiprocessing systems; real-time systems; scheduling VL - 1 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an empty partial schedule, each step of the search extends the current partial schedule by including one of the tasks yet to be scheduled. The heuristic functions used in the algorithm actively direct the search for a feasible schedule, i.e. they help choose the task that extends the current partial schedule. Two scheduling algorithms are evaluated by simulation. To extend the current partial schedule, one of the algorithms considers, at each step of the search, all the tasks that are yet to be scheduled as candidates. The second focuses its attention on a small subset of tasks with the shortest deadlines. The second algorithm is shown to be very effective when the maximum allowable scheduling overhead is fixed. This algorithm is hence appropriate for dynamic scheduling in real-time systems.
[1] J. Blazewicz, "Deadline scheduling of tasks with ready times and resource constraints,"Inform. Process. Lett., vol. 8, no. 2, Feb. 1979.
[2] J. Blazewicz, M. Drabowski, and J. Weglarz, "Scheduling multiprocessor tasks to minimize schedule length,"IEEE Trans. Comput., vol. C-35, pp. 389-393, May 1986.
[3] H. Chetto and M. Chetto, "Some results of the earliest deadline scheduling algorithm,"IEEE Trans. Software Eng., pp. 1161-1169, Oct. 1989.
[4] M. Dertouzos, "Control robotics: The procedural control of physical process," inProc. IFIP Congress, 1974.
[5] W. A. Horn, "Some simple scheduling algorithms,"Naval Res. Log. Quart., vol. 21, 1974.
[6] C. Martel, "Preemptive scheduling with release times, deadlines, and due times,"J. ACM, vol. 29, no. 3, pp. 812-829, July 1982.
[7] A. K. Mok and M. L. Dertouzos, "Multiprocessor scheduling in a hard real-time environment," inProc. Seventh Texas Conf. Comput. Syst., Nov. 1978.
[8] A. K. Mok, "The design of real-time programming systems based on process models," inProc. IEEE Real-Time Syst. Symp., Dec. 1984.
[9] A. K. Mok, "Fundamental design problems of distributed systems for the hard real-time environment," Ph.D. dissertation, Dep. Elec. Eng. Comput. Sci., Mass. Inst. Technol., Cambridge, MA, May 1983.
[10] K. Ramamritham, J. A. Stankovic, and W. Zhao, "Distributed scheduling of tasks with deadlines and resource requirements,"IEEE Trans. Comput., pp. 1110-1123, Aug. 1989.
[11] S. Sahni and Y. Cho, "Nearly on line scheduling of a uniform processor system with release times,"Soc. Industrial Appl. Math. J. Comput., vol. 8, no. 2, pp. 275-285, May 1979.
[12] P. F. Shiah, "A heuristic approach on real-time scheduling for multiprocessors," M.S. thesis, Dep. Elec. Comput. Eng., Univ. Massachusetts, Amherst, MA, Jan. 1989.
[13] J. A. Stankovic and K. Ramamritham, "The design of the spring kernel," inProc. Real-Time Syst. Symp., San Jose, CA, Dec. 1987.
[14] J. A. Stankovic and K. Ramamritham, P. F. Shiah, and W. Zhao, "Real-time scheduling algorithms for multiprocessors," Tech. Rep. Univ. Massachusetts, Nov. 1988.
[15] J. D. Ullman, "Polynomial complete scheduling problems," inProc. 4th Symp. OS Principles, 1973, pp. 96-101.
[16] J. D. Ullman, "NP-complete scheduling problems,"J. Comput. Syst. Sci., Oct. 1975.
[17] W. Zhao, K. Ramamritham, and J. Stankovic, "Scheduling tasks with resource requirements in hard real-time systems,"IEEE Trans. Software Eng., vol. SE-13, pp. 564-577, May 1987.
[18] W. Zhao and K. Ramamritham, "Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints,"J. Systems and Software, Vol. 7, 1987, pp. 195-205.