1257 search results - page 98 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
105
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
102
click to vote
ICDCN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...
159
click to vote
CSCW
2011
ACM
14 years 8 months ago
2011
ACM
The performance of a collaborative system depends on how two mandatory collaborative tasks, processing and transmission of user commands, are scheduled. We have developed multiple...
115
click to vote
TECS
2010
15 years 13 hour ago
2010
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...