Locking under Pfair scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Locking under Pfair scheduling

Full text

Pdf (539 KB)

Source

ACM Transactions on Computer Systems (TOCS) archive
Volume 24 , Issue 2 (May 2006) table of contents

Pages: 140 - 174

Year of Publication: 2006

ISSN:0734-2071

Authors

Philip Holman	University of North Carolina at Chapel Hill, Chapel Hill, NC
James H. Anderson	University of North Carolina at Chapel Hill, Chapel Hill, NC

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 72, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132026.1132028 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Anderson, J., Block, A., and Srinivasan, A. 2003. Quick-release fair scheduling. In Proceedings of the 24th IEEE Real-time Systems Symposium. 130--141.
	2	Anderson, J., Ramamurthy, S., and Jeffay, K. 1997. Real-time computing with lock-free objects. ACM Trans. Comput. Syst. 15, 6 (May), 388--395.
	3	Anderson, J. and Srinivasan, A. 2000a. Early-release fair scheduling. In Proceedings of the 12th Euromicro Conference on Real-time Systems. 35--43.
	4	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.
	5	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.
	6	Baker, T. 1991. Stack-based scheduling of real-time processes. Real-time Syst. 3, 1 (Mar.), 67--99.
	7	Baruah, S., Cohen, N., Plaxton, C., and Varvel, D. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 600--625.
	8	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.
	9	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.
	10	Caccamo, M. and Sha, L. 2001. Aperiodic servers with resource constraints. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 161--170.
	11	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.
	12	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.
	13	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.
	14	Holman, P. 2004. On the implementation of Pfair -scheduled multiprocessor systems. Ph.D. thesis, University of North Carolina at Chapel Hill.
	15	Holman, P. and Anderson, J. 2002a. Locking in Pfair -scheduled multiprocessor systems. In Proceedings of the 23rd IEEE Real-time Systems Symposium. 149--158.
	16	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.
	17	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.
	18	Holman, P. and Anderson, J. 2005. Supporting lock-free synchronization in Pfair-scheduled systems. J. Parallel Distrib. Comput. 66, 1 (January), 47--67.
	19	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.
	20	Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 30, 46--61.
	21	Lynx Real-time Systems. 1993. LynxOS application writer's guide. Lynx Real-time Systems, Inc.
	22	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.
	23	Mok, A. 1983. Fundamental design problems for the hard real-time environment. Ph.D. thesis, Massachussetts Institute of Technology.
	24	Rajkumar, R. 1990. Real-time synchronization protocols for shared memory multiprocessors. In Proceedings of the International Conference on Distributed Computing Systems. 116--123.
	25	Rajkumar, R. 1991. Synchronization in real-time systems---A priority inheritance approach. Kluwer Academic Publishers, Boston, Mass.
	26	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.
	27	Ramamurthy, S. 1997. A lock-free approach to object sharing in real-time systems. Ph.D. thesis, University of North Carolina at Chapel Hill.
	28	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.
	29	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.
	30	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.
	31	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).