1257 search results - page 164 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
WICON
2008
14 years 11 months ago
2008
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
110
click to vote
SIGCOMM
2012
ACM
13 years 16 days ago
2012
ACM
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
102
click to vote
MP
2007
14 years 9 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...