702 search results - page 14 / 141 » Algorithms for Minimizing Response Time in Broadcast Schedul... |
72
Voted
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
84
Voted
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
77
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...