A New Approach for Scheduling of Parallelizable Tasks in Real-Time Multiprocessor Systems

Real-Time Systems

Volumn 15, Issue 1, 1998, Pages 39-60

  Manimaran, G ^a   Siva Ram Murthy, C ^a   Ramamritham, Krithi ^a,b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b University of Massachusetts Amherst   (United States)

Author keywords

Dynamic scheduling; Multiprocessor; Parallelizable tasks; Real time; Run time anomaly; Schedulability

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

PARALLELIZABLE TASKS; RUN TIME ANOMALY; SCHEDULABILITY;

REAL TIME SYSTEMS;

EID: 0032122085     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008022923184     Document Type: Article

References (19)

1. Belkhale, K. P., and Banerjee, P. 1990. Approximate algorithms for the partitionable independent task scheduling problem. Intl. Conf. on Parallel Processing 1: 72-75.
2. Blazewicz, J., Drabowski, M., and Weglarz, J. 1986. Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. on Computers 35(5): 389-393.
3. Ekmecic, I., Tartalja, I., and Milutinovic, V. 1996. A survey of heterogeneous computing: concepts and systems. Proc. IEEE 84(8): 1127-1146.
4. Graham, R. L. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2).
5. Han, C. C., and Lin, K. J. 1989. Scheduling parallelizable jobs on multiprocessors. Real-Time Systems Symposium: 59-67.
6. Krishnamoorthy, R., and Ma, E. 1992. An approximate algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems. IEEE Trans. on Computers 41(12): 1572-1579.
7. Liu, C., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20.
8. Liu, J. W. S., Lin, K. J., Shih, W. K., Yu, A. C., Chung, J. Y., and Zhao, W. 1991. Algorithms for scheduling imprecise computations. IEEE Computer: 58-68.
9. Manimaran, G., Siva Ram Murthy, C., and Ramamritham, K. 1995. A new algorithm for dynamic scheduling of parallelizable tasks in real-time multiprocessor systems. Intl. Conf. on High Performance Computing: 267-272 (shorter version of this paper).
10. Peng, D. T., and Shin, K. G. 1989. Static allocation of periodic tasks with precedence constraints in distributed real-time systems. Intl. Conf. on Distributed Computing Systems: 190-198.
11. Ramamritham, K., Stankovic, J. A., and Shiah, P.-F. 1990. Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Trans. on Parallel and Distributed Systems 1(2): 184-194.
12. Ramamritham, K., Fohler, G., and Adan, J. M. 1993. Issues in the static allocation and scheduling of complex periodic tasks. 10th IEEE Workshop on Real-time Operating Systems and Software.
13. Ramamritham, K., and Stankovic, J. A. 1994. Scheduling algorithms and operating systems support for real-time systems. Proc. IEEE 82(1): 55-67.
14. Ramamritham, K. 1995. Allocation and scheduling of precedence-related periodic tasks. IEEE Trans. on Parallel and Distributed Systems 6(4): 412-420.
15. Shen, C., Ramamritham, K., and Stankovic, J. A. 1993. Resource reclaiming in multiprocessor real-time systems. IEEE Trans. on Parallel and Distributed Systems 4(4): 382-397.
16. Shin, K. G., and Ramanathan, P. 1994. Real-time computing: A new discipline of computer science and engineering. Proc. IEEE 82(1): 6-24.
17. Wang, Q., and Cheng, K. H. 1992. A heuristic of scheduling parallel tasks and its analysis. SIAM J. Computing 21(2): 281-294.
18. Xu, J., and Parnas, L. 1990. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. on Software Engg. 16(3): 360-369.
19. Zomaya, A. Y. 1996. Parallel processing for real-time simulation: a case study. IEEE Parallel & Distributed Technology: 49-56.