The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks. (eBook, 2002) [WorldCat.org]
skip to content
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks. Preview this item
ClosePreview this item
Checking...

The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks.

Author: Tarek AbdelzaherBjorn AndersonJan JonssonVivek SharmaMinh NguyenAll authors
Publisher: Ft. Belvoir Defense Technical Information Center JAN 2002.
Edition/Format:   eBook : EnglishView all editions and formats
Summary:
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough has been Liu and Layland's utilization bound for schedulability of periodic tasks. In 2001 this bound was generalized by Abdelzaher and Lu to the aperiodic task case. In this paper, we further generalize the aperiodic bound to the case of  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Internet Resource
All Authors / Contributors: Tarek Abdelzaher; Bjorn Anderson; Jan Jonsson; Vivek Sharma; Minh Nguyen; VIRGINIA UNIV CHARLOTTESVILLE Dept. of COMPUTER SCIENCE.
OCLC Number: 227902747
Notes: Sponsored in part by National Science Foundation grant NSF-ANI-0105873. Prepared in cooperation with Chalmers Univ. of Technology, Gothenburg, Sweden. Presented at the IEEE Real-Time and Embedded Technology and Applications Symposium (8th) (RTAS '02) held in San Jose, CA on 24-27 Sep 2002. Published in the Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (8th), 2002. The original document contains color images.
Description: 13 pages

Abstract:

Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough has been Liu and Layland's utilization bound for schedulability of periodic tasks. In 2001 this bound was generalized by Abdelzaher and Lu to the aperiodic task case. In this paper, we further generalize the aperiodic bound to the case of multiprocessors, and present key new insights into schedulability analysis of aperiodic tasks. We consider a special task model, called the liquid task model, representative of high-performance servers with aperiodic workloads, such as network routers, web servers, proxies, and real-time databases. For this model, we derive the optimal multiprocessor utilization bound, defined on a utilization-like metric we call "synthetic utilization." This bound allows developing constant-time admission control tests that provide utilization-based absolute delay guarantees. We show that the real utilization of admitted tasks can be close to unity even when synthetic utilization is kept below the bound. Thus, our results lead to multiprocessor systems which combine constant-time admission control with high utilization while making no periodicity assumptions regarding the task arrival pattern.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.