Sciweavers

229 search results - page 20 / 46
» A Case for Priority
Sort
View
RTCSA
2008
IEEE
15 years 11 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
INFOCOM
2006
IEEE
15 years 10 months ago
TCP as an Implementation of Age-Based Scheduling: Fairness and Performance
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
Arzad Alam Kherani, Rudesindo Núñez-...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 10 months ago
FP/FIFO Scheduling: Deterministic Versus Probabilistic QoS Guarantees and P-Schedulability
Abstract—In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-toend response time. Two types of quantitative QoS garantees...
Leïla Azouz Saïdane, Skander Azzaz, Stev...
SAC
2005
ACM
15 years 10 months ago
The container loading problem
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
Andrew Lim, Xingwen Zhang
ICPP
2003
IEEE
15 years 9 months ago
A Priority-based Balanced Routing Scheme for Random Broadcasting and Routing in Tori
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Abdelhami...