Sciweavers

1719 search results - page 181 / 344
» Scheduling with soft constraints
Sort
View
ICPADS
2007
IEEE
14 years 4 months ago
Supporting deadline monotonic policy over 802.11 average service time analysis
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
Inès El Korbi, Leïla Azouz Saïdan...
RTSS
1999
IEEE
14 years 2 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
EOR
2007
174views more  EOR 2007»
13 years 10 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
ICSE
2009
IEEE-ACM
14 years 5 months ago
Deployment automation with BLITZ
Minimizing the computing infrastructure (such as processors) in a distributed real-time embedded (DRE) system deployment helps reduce system size, weight, power consumption, and c...
Brian Dougherty, Jules White, Jaiganesh Balasubram...
INFOCOM
2009
IEEE
14 years 4 months ago
A Theory of QoS for Wireless
—Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control,...
I-Hong Hou, Vivek Borkar, P. R. Kumar