284 search results - page 25 / 57 » Distributed Agreement with Optimal Communication Complexity |
138
click to vote
RTSS
1992
IEEE
15 years 7 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
133
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
159
Voted
SIGCOMM
2012
ACM
13 years 5 months ago
2012
ACM
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
132
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider opportunistic spectrum access for secondary users over multiple channels whose occupancy by primary users is modeled as discrete-time Markov processes. Due to hardware...
141
click to vote
LCPC
1997
Springer
15 years 7 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...