Cart (Loading....) | Create Account
Close category search window

Non-preemptive real-time scheduling of multimedia tasks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dolev, S. ; Dept. of Math. & Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel ; Keizelman, A.

Motivated by the special characteristics of multimedia tasks, we consider non-preemptive scheduling of tasks where there exists no (or very limited) information concerning the tasks before they are released. We present impossibility results and analyze algorithms for non-preemptive scheduling in single processor and multiprocessor systems. In particular, one set of our results considers the competitive ratio of the scheduling algorithm when the length of the tasks is not greater than Cmax (and not smaller than Cmin). We show that the performance of a scheduling algorithm is improved dramatically when the release time of the tasks is O(Cmax) prior to their deadline; achieving a competitive ratio that is close to one

Published in:

Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on

Date of Conference:

30 Jun-2 Jul 1998

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.