### Skapa referens, olika format (klipp och klistra)

**Harvard**

Abdelzaher, T., Andersson, B., Jonsson, J., Sharma, V. och Nguyen, M. (2002) *The aperiodic multiprocessor utilization bound for liquid tasks*.

** BibTeX **

@conference{

Abdelzaher2002,

author={Abdelzaher, T. and Andersson, Björn and Jonsson, Jan and Sharma, V. and Nguyen, M.},

title={The aperiodic multiprocessor utilization bound for liquid tasks},

booktitle={8th IEEE Real-Time and Embedded Technology and Applications Symposium, 2002. Proceedings},

isbn={0-7695-1739-0},

pages={173-184},

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, tees. 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.},

year={2002},

keywords={aggregate system utilization, aperiodic multiprocessor utilization bound, constant-time admission control, high-performance servers, liquid tasks, multiprocessors, network routers, per-task schedulability, proxies, real-time databases, real-time scheduling theory, task model, web servers},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 170419

A1 Abdelzaher, T.

A1 Andersson, Björn

A1 Jonsson, Jan

A1 Sharma, V.

A1 Nguyen, M.

T1 The aperiodic multiprocessor utilization bound for liquid tasks

YR 2002

T2 8th IEEE Real-Time and Embedded Technology and Applications Symposium, 2002. Proceedings

SN 0-7695-1739-0

SP 173

OP 184

AB 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, tees. 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.

LA eng

DO 10.1109/RTTAS.2002.1137392

LK http://dx.doi.org/10.1109/RTTAS.2002.1137392

OL 30