Design and Performance of Configurable Endsystem Scheduling Mechanisms

Authors:
Tejasvi Aswathanarayana;Douglas Niehaus;Venkita Subramonian;Christopher Gill
Affiliations:
University of Kansas, Lawrence;University of Kansas, Lawrence;Washington University, St. Louis, MO;Washington University, St. Louis, MO
Venue:
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Year:
2005

Citing 0
Cited 8

Towards verifiable deeply embedded systems

ACM SIGBED Review - Special issue on the RTSS forum on deeply embedded real-time computing
Towards Integrated Model-Driven Verification and Empirical Validation of Reusable Software Frameworks for Automotive Systems

Model-Driven Development of Reliable Automotive Services
Scheduling for Reliable Execution in Autonomic Systems

ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Scheduling policy design for autonomic systems

International Journal of Autonomous and Adaptive Communications Systems
A framework for flexible scheduling in the RTSJ

ACM Transactions on Embedded Computing Systems (TECS)
RT-Xen: towards real-time hypervisor scheduling in xen

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Thread allocation protocols for distributed real-time and embedded systems

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Predictable and configurable component-based scheduling in the Composite OS

ACM Transactions on Embedded Computing Systems (TECS) - Special Section on ESTIMedia'10

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a scheduling abstraction, called group scheduling, that emphasizes fine grain configurability of system scheduling semantics. The group scheduling approach described and evaluated in this paper provides an extremely flexible framework within which a wide range of scheduling semantics can be expressed, including familiar priority and deadline based algorithms. The paper describes both OS and middleware based implementations of the framework, and shows through evaluation that they can produce the same behavior for a non-trivial set of application computations. We also show that the framework can support application-specific scheduling constraints such as progress, to improve performance of applications whose scheduling semantics do not match those of traditional scheduling algorithms.