Paper Info
Title
Experimental Evaluation of Global and Partitioned Semi-Fixed-Priority Scheduling Algorithms on Multicore Systems
Abstract
Nowadays multicore systems have been used in real-time applications such as robots. In robots, imprecise tasks such as image processing tasks are required to detect and avoid objects. However, existing real-time operating systems have evaluated multiprocessor real-time scheduling algorithms in Liu and Lay land's model and have not evaluated those in the imprecise computation model. This paper performs experimental evaluations of global and partitioned semi-fixed-priority scheduling algorithms in the extended imprecise computation model on multicore systems. Experimental results show that semi-fixed-priority scheduling has comparable overhead to fixed-priority scheduling. In addition, global semi-fixed-priority scheduling has lower overhead than partitioned semi-fixed-priority scheduling.
Year
DOI
Venue
2012
10.1109/ISORC.2012.25
Object/Component/Service-Oriented Real-Time Distributed Computing
Keywords
Field
DocType
multiprocessing programs,real-time systems,scheduling,experimental evaluation,multicore systems,real-time applications,semifixed-priority scheduling algorithms,Experimental Evaluation,Global Scheduling,Multicore Systems,Partitioned Scheduling,Semi-Fixed-Priority Scheduling
Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Flow shop scheduling,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISSN
ISBN
Citations 
1555-0885
978-1-4673-0499-3
2
PageRank 
References 
Authors
0.38
9
2
Name
Order
Citations
PageRank
Hiroyuki Chishiro1548.96
Nobuyuki Yamasaki233830.45