Sciweavers

1380 search results - page 4 / 276
» scheduling 2008
Sort
View
CISS
2008
IEEE
14 years 1 months ago
Throughput of random access without message passing
— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
Alexandre Proutiere, Yung Yi, Mung Chiang
IJPP
2008
148views more  IJPP 2008»
13 years 7 months ago
Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...
Traian Pop, Paul Pop, Petru Eles, Zebo Peng
MST
2008
157views more  MST 2008»
13 years 7 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
COMCOM
2002
104views more  COMCOM 2002»
13 years 7 months ago
Low-latency guaranteed-rate scheduling using Elastic Round Robin
Packet scheduling algorithms in switches and routers will likely play a critical role in providing the Quality-of-Service (QoS) guarantees required by many real-time multimedia ap...
Salil S. Kanhere, Harish Sethu
WSC
2008
13 years 9 months ago
A simulation based scheduling model for call centers with uncertain arrival rates
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...
Thomas R. Robbins, Terry P. Harrison