475 search results - page 81 / 95 » Feasible distributed CSP models for scheduling problems |
DIALM
2010
ACM
13 years 5 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
DC
2006
13 years 7 months ago
2006
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— In a multi-source video streaming system, premature draining of low-power nodes can cause sudden failures of peer connections and degrade streaming performance. To solv...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...