Sciweavers

2714 search results - page 16 / 543
» Approximation Schemes for Scheduling
Sort
View
TON
2010
176views more  TON 2010»
14 years 4 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
91
Voted
RTS
2008
155views more  RTS 2008»
14 years 9 months ago
An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
102
Voted
TMC
2012
12 years 12 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
ICALP
2004
Springer
15 years 2 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
TWC
2010
14 years 4 months ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...