Sciweavers

358 search results - page 46 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
IPPS
2008
IEEE
15 years 8 months ago
Providing flow based performance guarantees for buffered crossbar switches
Buffered crossbar switches are a special type of combined input-output queued switches with each crosspoint of the crossbar having small on-chip buffers. The introduction of cross...
Deng Pan, Yuanyuan Yang
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
IPPS
2009
IEEE
15 years 8 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
NCA
2007
IEEE
15 years 8 months ago
A Topological Analysis of Monitor Placement
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
Alden W. Jackson, Walter C. Milliken, Cesar A. San...
GRID
2008
Springer
15 years 3 months ago
Dynamic scheduling for heterogeneous Desktop Grids
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
Issam Al-Azzoni, Douglas G. Down