Sciweavers

2714 search results - page 141 / 543
» Approximation Schemes for Scheduling
Sort
View
101
Voted
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 2 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
100
Voted
ANCS
2006
ACM
15 years 6 months ago
Localized asynchronous packet scheduling for buffered crossbar switches
Buffered crossbar switches are a special type of crossbar switches. In such a switch, besides normal input queues and output queues, a small buffer is associated with each crosspo...
Deng Pan, Yuanyuan Yang
IPPS
2003
IEEE
15 years 6 months ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
103
Voted
SIGCOMM
1998
ACM
15 years 5 months ago
Scalable QoS Provision Through Buffer Management
In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for ...
Roch Guérin, Sanjay Kamat, Vinod G. J. Peri...
96
Voted
TCOM
2010
131views more  TCOM 2010»
14 years 11 months ago
Distance-based node activation for geographic transmissions in fading channels
In wireless multi-hop packet radio networks (MPRNs) that employ geographic transmissions, sleep schedules or node activation techniques may be used to power off some nodes to cons...
Tathagata D. Goswami, John M. Shea, Murali Rao, Jo...