Sciweavers

457 search results - page 42 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
130
Voted
ECRTS
2007
IEEE
15 years 6 months ago
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors
We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures...
Björn B. Brandenburg, James H. Anderson
RTAS
2002
IEEE
15 years 5 months ago
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
Tarek F. Abdelzaher, Björn Andersson, Jan Jon...
RTSS
1999
IEEE
15 years 4 months ago
Parallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
JVM
2004
127views Education» more  JVM 2004»
15 years 1 months ago
Towards Scalable Multiprocessor Virtual Machines
A multiprocessor virtual machine benefits its guest operating system in supporting scalable job throughput and request latency--useful properties in server consolidation where ser...
Volkmar Uhlig, Joshua LeVasseur, Espen Skoglund, U...
134
Voted
RTSS
1999
IEEE
15 years 4 months ago
Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...
José C. Palencia Gutiérrez, Michael ...