Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

15th Euromicro Conference on Real-Time Systems (ECRTS'03)   p. 51
Efficient Scheduling of Soft Real-Time Applications on Multiprocessors

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMRTS.2003.1212727
Send link to a friend

Abstract
Int his paper, we consider fair scheduling of soft real-time applications on multiprocessors using the earliest-pseudo-deadline-first (EPDF) Pfair algorithm. Our main contributions are twofold. First, we establish a condition for ensuring a tardiness of at most one quantum under EPDF. This condition is very liberal and should often hold in practice. Second, we present simulation results involving randomly-generated task sets, including those that do not satisfy our condition. In these experiments, deadline misses were rare, and no misses by more than one quantum ever occured.
Additional Information

Citation:  Anand Srinivasan, James H. Anderson, "Efficient Scheduling of Soft Real-Time Applications on Multiprocessors," ecrts, p. 51,  15th Euromicro Conference on Real-Time Systems (ECRTS'03),  2003

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback