Abstract
We present several locking synchronization protocols for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The first class is only applicable in systems in which all critical sections are short relative to the length of the scheduling quantum. In this case, efficient synchronization can be achieved by ensuring that all locks have been released before tasks are preempted. This is accomplished by exploiting the quantum-based nature of Pfair scheduling, which provides a priori knowledge of all possible preemption points. The second and more general protocol class is applicable to any system. For this class, we consider the use of a client-server model. We also discuss the viability of inheritance-based protocols in Pfair-scheduled systems.
- Anderson, J., Block, A., and Srinivasan, A. 2003. Quick-release fair scheduling. In Proceedings of the 24th IEEE Real-time Systems Symposium. 130--141. Google Scholar
- Anderson, J., Ramamurthy, S., and Jeffay, K. 1997. Real-time computing with lock-free objects. ACM Trans. Comput. Syst. 15, 6 (May), 388--395. Google Scholar
- Anderson, J. and Srinivasan, A. 2000a. Early-release fair scheduling. In Proceedings of the 12th Euromicro Conference on Real-time Systems. 35--43. Google Scholar
- Anderson, J. and Srinivasan, A. 2000b. Pfair scheduling: Beyond periodic task systems. In Proceedings of the Seventh International Conference on Real-time Computing Systems and Applications. 297--306. Google Scholar
- Anderson, J. and Srinivasan, A. 2001. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In Proceedings of the 13th Euromicro Conference on Real-time Systems. 76--85. Google Scholar
- Baker, T. 1991. Stack-based scheduling of real-time processes. Real-time Syst. 3, 1 (Mar.), 67--99. Google Scholar
- Baruah, S., Cohen, N., Plaxton, C., and Varvel, D. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 600--625.Google Scholar
- Baruah, S., Gehrke, J., and Plaxton, C. G. 1995. Fast scheduling of periodic tasks on multiple resources. In Proceedings of the 9th International Parallel Processing Symposium. 280--288. Google Scholar
- Block, A., Anderson, J., and Bishop, G. 2005. Fine-grained task reweighting on multiprocessors. In Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, August, 429--435. Google Scholar
- Caccamo, M. and Sha, L. 2001. Aperiodic servers with resource constraints. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 161--170. Google Scholar
- Chandra, A., Adler, M., Goyal, P., and Shenoy, P. 2000. Surplus fair scheduling: A proportional-share cpu scheduling algorithm for symmetric multiprocessors. In Proceedings of the Fourth Symposium on Operating System Design and Implementation. Google Scholar
- de Niz, D., Abeni, L., Saewong, S., and Rajkumar, R. 2001. Resource sharing in reservation-based systems. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 171--180. Google Scholar
- Gai, P., Lipari, G., and di Natale, M. 2001. Minimizing memory utilization of real-time task sets in single and multi-process or systems-on-a-chip. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 73--83. Google Scholar
- Holman, P. 2004. On the implementation of Pfair -scheduled multiprocessor systems. Ph.D. thesis, University of North Carolina at Chapel Hill. Google Scholar
- Holman, P. and Anderson, J. 2002a. Locking in Pfair -scheduled multiprocessor systems. In Proceedings of the 23rd IEEE Real-time Systems Symposium. 149--158. Google Scholar
- Holman, P. and Anderson, J. 2002b. Object sharing in Pfair -scheduled multiprocessor systems. In Proceedings of the 14th Euromicro Conference on Real-time Systems. 111--120. Google Scholar
- Holman, P. and Anderson, J. 2003. Using hierarchal scheduling to improve resource utilization in multiprocessor real-time systems. In Proceedings of the 15th Euromicro Conference on Real-time Systems. 41--50.Google Scholar
- Holman, P. and Anderson, J. 2005. Supporting lock-free synchronization in Pfair-scheduled systems. J. Parallel Distrib. Comput. 66, 1 (January), 47--67. Google Scholar
- Lamastra, G., Lipari, G., and Abeni, L. 2001. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 151--160. Google Scholar
- Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 30, 46--61. Google Scholar
- Lynx Real-time Systems. 1993. LynxOS application writer's guide. Lynx Real-time Systems, Inc.Google Scholar
- Moir, M. and Ramamurthy, S. 1999. Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In Proceedings of the Twentieth IEEE Real-time Systems Symposium. 294--303. Google Scholar
- Mok, A. 1983. Fundamental design problems for the hard real-time environment. Ph.D. thesis, Massachussetts Institute of Technology.Google Scholar
- Rajkumar, R. 1990. Real-time synchronization protocols for shared memory multiprocessors. In Proceedings of the International Conference on Distributed Computing Systems. 116--123.Google Scholar
- Rajkumar, R. 1991. Synchronization in real-time systems---A priority inheritance approach. Kluwer Academic Publishers, Boston, Mass. Google Scholar
- Rajkumar, R., Sha, L., and Lehoczky, J. 1988. Real-time synchronization protocols for multiprocessors. In Proceedings of the Ninth IEEE Real-time Systems Symposium. 259--269.Google Scholar
- Ramamurthy, S. 1997. A lock-free approach to object sharing in real-time systems. Ph.D. thesis, University of North Carolina at Chapel Hill. Google Scholar
- Sha, L., Rajkumar, R., and Lehoczky, J. 1990. Priority inheritance protocols: An approach to real-time system synchronization. IEEE Trans. Comput. 39, 9, 1175--1185. Google Scholar
- Srinivasan, A. and Anderson, J. 2002. Optimal rate-based scheduling on multiprocessors. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 189--198. Google Scholar
- Srinivasan, A. and Anderson, J. 2003a. Efficient scheduling of soft real-time applications on multiprocessors. In Proceedings of the 15th Euromicro Conference on Real-time Systems. 51--59.Google Scholar
- Srinivasan, A. and Anderson, J. 2003b. Fair scheduling of dynamic task systems on multiprocessors. In 11th International Workshop on Parallel and Distributed Real-time Systems (on CD-ROM).Google Scholar
Index Terms
Locking under Pfair scheduling
Recommendations
Group-Based Pfair Scheduling
We consider the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks , is assigned to a server task, called a supertask , which is then scheduled as an ordinary Pfair task. ...
Adapting Pfair scheduling for symmetric multiprocessors
Cache exploitation in embedded systemsWe consider the implementation of a Pfair real-time scheduler on a symmetric multiprocessor (SMP). Although SMPs are in many ways well-suited for Pfair scheduling, experimental results presented herein suggest that bus contention resulting from the ...
Supporting lock-free synchronization in Pfair-scheduled real-time systems
We consider the use of lock-free techniques for implementing shared objects in real-time Pfair-scheduled multiprocessor systems. Lock-free objects are more economical than locking techniques when implementing relatively simple objects such as buffers, ...






Comments