ABSTRACT
The problem of sharing logical resources in multiprocessor systems cannot be satisfactorily solved using solutions intended for single processor systems. Sharing logical resources on multiprocessors is intrinsically exposed to parallel contention, which gives rise to high time penalty owing to the necessary serialization of access. Partitioned scheduling approaches help reduce contention, but at the cost of collocating every shared resource together with all of its users, which makes the partitioning problem harder. The concept of logical server used in hybrid (semi-partitioned) multiprocessor scheduling, a self-sufficient entity that can schedule a set of tasks and become a schedulable entity itself, may come handy instead. Logical servers can be used to isolate and reduce the parallelism of collaborative tasks without suffering from the limitations of partitioned approaches. In this work, we provide a generalization of RUN, an optimal multiprocessor scheduling algorithm based on logical servers, for handling shared resources. We implement and evaluate a simple spin-based locking protocol that leverages servers to group collaborative tasks and reduces parallel contention.
- T. Baker. A stack-based resource allocation policy for realtime processes. In Real-Time Systems Symposium. Proceedings., 11th, 1990.Google Scholar
- S. K. Baruah. Resource sharing in EDF-scheduled systems: A closer look. 2013 IEEE 34th Real-Time Systems Symposium, 0, 2006. Google ScholarDigital Library
- B. Brandenburg. A fully preemptive multiprocessor semaphore protocol for latency-sensitive real-time applications. In 25th Euromicro Conference on Real-Time Systems (ECRTS), 2013. Google ScholarDigital Library
- B. Brandenburg and H. Anderson. The OMLP family of optimal multiprocessor real-time locking protocols. Design Automation for Embedded Systems, 2012. Google ScholarDigital Library
- A. Burns and A. Wellings. Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX. Addison-Wesley Educational Publishers Inc, USA, 4th edition, 2009. Google ScholarDigital Library
- A. Burns and A. Wellings. A schedulability compatible multiprocessor resource sharing protocol -- MrsP. In 25th Euromicro Conference on Real-Time Systems (ECRTS), 2013. Google ScholarDigital Library
- J. Calandrino, H. Leontyev, A. Block, U. Devi, and J. Anderson. LITMUSRT: A testbed for empirically comparing real-time multiprocessor schedulers. In Real-Time Systems Symposium (RTSS'06). 27th IEEE International, Dec 2006. Google ScholarDigital Library
- D. Compagnin, E. Mezzetti, and T. Vardanega. Putting RUN into practice: implementation and evaluation. Euromicro Conference on Real-Time Systems. (ECRTS-2014), 2014.Google ScholarDigital Library
- P. Gai, G. Lipari, and M. Di Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In Real-Time Systems Symposium. (RTSS 2001). Proceedings. 22nd IEEE, 2001. Google ScholarDigital Library
- LITMUSRT. The Linux testbed for multiprocessor scheduling in real-time systems, 2014. http://www.litmus-rt.org/.Google Scholar
- R. Rajkumar. Real-time synchronization protocols for shared memory multiprocessors. In Distributed Computing Systems. Proceedings, 10th International Conference on, 1990.Google Scholar
- R. Rajkumar, L. Sha, and J. Lehoczky. Real-time synchronization protocols for multiprocessors. In Real-Time Systems Symposium, Proceedings., 1988.Google ScholarCross Ref
- P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt. RUN: Optimal multiprocessor real-time scheduling via reduction to uniprocessor. In IEEE 32nd Real-Time Systems Symposium (RTSS), 2011. Google ScholarDigital Library
- B. Ward and J. Anderson. Supporting nested locking in multiprocessor real-time systems. In Real-Time Systems (ECRTS), 24th Euromicro Conference on, July 2012. Google ScholarDigital Library
Index Terms
- Supporting Global Resource Sharing in RUN-scheduled Multiprocessor Systems
Recommendations
Limited Blocking Resource Sharing for Global Multiprocessor Scheduling
ECRTS '11: Proceedings of the 2011 23rd Euromicro Conference on Real-Time SystemsIn this paper we focus on resource sharing in global fixed-priority preemptive multiprocessor scheduling. We consider the scheduling of a set of sporadic constrained-deadline tasks sharing a set of resources in a non-nested way. We propose the Limited ...
Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing
Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In the existing literature, however, there is no complete exact analysis for EDF scheduling when both resource sharing and ...
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
RTSS '09: Proceedings of the 2009 30th IEEE Real-Time Systems SymposiumIn this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test ...
Comments