1257 search results - page 114 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
156
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of dea...
118
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
110
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
116
click to vote
QEST
2009
IEEE
15 years 8 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
137
click to vote
INFOSCALE
2006
ACM
15 years 7 months ago
2006
ACM
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and scalable resource model is described by a hybrid multi-level tree reflecting a...