loading...
A Heuristic Scheduling Algorithmof Imprecise Multiprocessor System with O/l Constraint
Seoul, Korea October 30-November 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554991Third International Workshop on Real- ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The scheduling problem to satisfy both O/l constraint and timing constraints with minimizing the total error is NP-complete when the optional parts have arbitrary processing times. In this paper, we present a heuristic scheduling algorithm of imprecise systems with O/l constraint which consist of the communicating tasks running on several processors. The algorithm is based on the program graph which is similar to the one presented in [4]. To check the schedulability, we apply the Lawler and Moore's theorem. An intensive simulation is done to analyze the performance of suggested algorithm. The results of simulation show that the longest processing first selection strategy outperforms the random or minimal laxity policies.
Index Terms:
real-time systems; hardware-software codesign; resource-constrained real-time systems; hardware-software partitioning algorithm; embedded real-time system; period calibration method; period assignment; heuristics; random transformation rule; simulated annealing
Citation:
Kyongok Yun, Kihyun Song, Kyunghee Choi, Gihyun Jung, Seungkyu Park, Manpyo Hong, Dugkyoo Choi, "A Heuristic Scheduling Algorithmof Imprecise Multiprocessor System with O/l Constraint," rtcsa, pp.307, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.