Real-time task scheduling anomaly

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Real-time task scheduling anomaly: observations and prevention

Full text

Pdf (145 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2005 ACM symposium on Applied computing table of contents

Santa Fe, New Mexico

SESSION: Embedded systems: applications, solutions and techniques (EMBS): poster papers table of contents

Pages: 897 - 898

Year of Publication: 2005

ISBN:1-58113-964-0

Authors

Ya-Shu Chen	National Taiwan University, Taipei, Taiwan
Li-Pin Chang	National Taiwan University, Taipei, Taiwan
Tei-Wei Kuo	National Taiwan University, Taipei, Taiwan
Aloysius K. Mok	The University of Texas at Austin, Austin Texas

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 31, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/1066677.1066881 What is a DOI?

ABSTRACT

This research is motivated by the practical needs in the porting of embedded software over platforms and the well-known multiprocessor anomaly [2, 3]. In particular, we consider the task scheduling problem when the system configuration changes. We show that new violations of the timing constraints of tasks might occur even when a more powerful processor or device is adopted. The concept of scheduler stability and rules are then proposed to prevent scheduling anomaly from happening for task executions that might be involved with task synchronization or I/O access. Finally, we explore policies in bounding the the duration time of scheduling anomaly.

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	Giorgio C. Buttazzo, Scalable Applications for Energy-Aware Processors, Proceedings of the Second International Conference on Embedded Software, p.153-165, October 07-09, 2002
	2	A. K. Mok. Tracking real-time systems requirements. Workshop on Modelling Software System Structures in a fastly moving scenario, June 2000.
	3	R.Graham. Bounds on the performance of scheduling algorithm. Computer and Job Shop Scheduling Theory, E. G. Coffman, pages 165--227, 1976.
	4	L. Sha , R. Rajkumar , J. P. Lehoczky, Priority Inheritance Protocols: An Approach to Real-Time Synchronization, IEEE Transactions on Computers, v.39 n.9, p.1175-1185, September 1990 [doi>10.1109/12.57058]
	5	C. Shen , K. Ramamritham , J. A. Stankovic, Resource Reclaiming in Multiprocessor Real-Time Systems, IEEE Transactions on Parallel and Distributed Systems, v.4 n.4, p.382-397, April 1993 [doi>10.1109/71.219754]

CITED BY 2

	Madhukar Anand , Insup Lee, Robust and sustainable schedulability analysis of embedded software, ACM SIGPLAN Notices, v.43 n.7, July 2008
	Ya-Shu Chen , Li-Pin Chang , Tei-Wei Kuo , Aloysius K. Mok, An anomaly prevention approach for real-time task scheduling, Journal of Systems and Software, v.82 n.1, p.144-154, January, 2009