Paper Info
Title
Resource-Oriented Partitioned Scheduling in Multiprocessor Systems: How to Partition and How to Share?
Abstract
When concurrent real-time tasks have to access shared resources, to prevent race conditions, the synchronization and resource access must ensure mutual exclusion, e.g., by using semaphores. That is, no two concurrent accesses to one shared resource are in their critical sections at the same time. For uniprocessor systems, the priority ceiling protocol (PCP) has been widely accepted and supported in real-time operating systems. However, it is still arguable whether there exists a preferable approach for resource sharing in multiprocessor systems. In this paper, we show that the proposed resource-oriented partitioned scheduling using PCP combined with a reasonable allocation algorithm can achieve a non-trivial speedup factor guarantee. Specifically, we prove that our task mapping and resource allocation algorithm has a speedup factor 11-6/(m+1) on a platform comprising m processors, where a task may request at most one shared resource and the number of requests on any resource by any single job is at most one. Our empirical investigations show that the proposed algorithm is highly effective in terms of task sets deemed schedulable.
Year
DOI
Venue
2016
10.1109/RTSS.2016.020
2016 IEEE Real-Time Systems Symposium (RTSS)
Keywords
Field
DocType
resource sharing,real-time,multiprocessors
Priority ceiling protocol,Uniprocessor system,Semaphore,Scheduling (computing),Computer science,Multiprocessing,Real-time computing,Shared resource,Mutual exclusion,Speedup,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-5090-5304-9
4
0.38
References 
Authors
26
3
Name
Order
Citations
PageRank
wenhung huang1625.29
Maolin Yang2357.23
Jian-Jia Chen32007129.20