Scheduling algorithms for parallel real-time systems

Author

Zhang, Lichen ; Jiwu Huang ; Zheng, Yi

Author_Institution

Sci. Center, Shantou Univ., Guangdong, China

Volume

2

fYear

1997

fDate

20-22 Aug 1997

Firstpage

968

Abstract

The potential speedup of applications has motivated the widespread use of multiprocessors in recent years. Future real-time systems are likely to be built on multiprocessor architectures. Efficient scheduling algorithms for multiprocessors are needed so that tasks will have predictable behaviors. In this paper, recent results on multiprocessor real-time scheduling algorithms are reviewed. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. A scheduling algorithm for real-time systems to be implemented on multiprocessors is proposed. This algorithm is appropriate for real-time tasks with precedence constraints

Keywords

parallel algorithms; processor scheduling; real-time systems; application requirements; applications speedup; multiprocessor architectures; multiprocessor real-time scheduling algorithms; parallel real-time systems; precedence constraints; predictable behavior; Artificial intelligence; Control systems; Costs; Information processing; Multiprocessing systems; Optimal scheduling; Processor scheduling; Real time systems; Scheduling algorithm; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Computers and Signal Processing, 1997. 10 Years PACRIM 1987-1997 - Networking the Pacific Rim. 1997 IEEE Pacific Rim Conference on

Conference_Location

Victoria, BC

Print_ISBN

0-7803-3905-3

Type

conf

DOI

10.1109/PACRIM.1997.620421

Filename

620421