DocumentCode
1823253
Title
Scheduling tasks in real-time systems using evolutionary strategies
Author
Greenwood, Garrison W. ; Lang, Christian ; Hurley, Steve
Author_Institution
Dept. of Electr. & Comput. Eng., Western Michigan Univ., Kalamazoo, MI, USA
fYear
1995
fDate
34814
Firstpage
195
Lastpage
196
Abstract
Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate that the evolutionary strategies can find feasible schedules (assuming they exist) in very short periods of time
Keywords
computational complexity; distributed processing; real-time systems; scheduling; NP-hard; distributed computing systems; evolutionary strategies; heuristic algorithm; real-time systems; scheduling tasks; Delay; Distributed computing; Genetic mutations; Heuristic algorithms; Message passing; Multiprocessor interconnection networks; Processor scheduling; Real time systems; Scheduling algorithm; Telecommunication network reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Real-Time Systems, 1995. Proceedings of the Third Workshop on
Conference_Location
Santa Barbara, CA
Print_ISBN
0-8186-7099-1
Type
conf
DOI
10.1109/WPDRTS.1995.470487
Filename
470487
Link To Document