Sciweavers

206 search results - page 32 / 42
» Better Bounds for Online Scheduling
Sort
View
TPDS
2008
92views more  TPDS 2008»
13 years 7 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 7 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
ECRTS
1998
IEEE
13 years 11 months ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...
CC
2006
Springer
182views System Software» more  CC 2006»
13 years 11 months ago
Selective Runtime Memory Disambiguation in a Dynamic Binary Translator
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
Bolei Guo, Youfeng Wu, Cheng Wang, Matthew J. Brid...
IADIS
2004
13 years 9 months ago
The Intercollege Student Intranet
In this paper we present the Intercollege Intranet, which has been developed within the strategic aims of the College to offer better services to students and faculty and to enhan...
Philippos Pouyioutas, Maria Poveda, George Soleas,...