1534 search results - page 289 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
PODC
2009
ACM
14 years 2 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
The explosion of data in the biological community demands the development of more scalable and flexible portals for bioinformatic computation. To address this need, we put forth c...
CCGRID
2011
IEEE
2011
IEEE
Network-Friendly One-Sided Communication through Multinode Cooperation on Petascale Cray XT5 Systems
12 years 11 months ago
—One-sided communication is important to enable asynchronous communication and data movement for Global Address Space (GAS) programming models. Such communication is typically re...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
CCGRID
2008
IEEE
14 years 2 months ago
2008
IEEE
—Current data-centers employ admission control mechanism to maintain low response time and high throughput under overloaded scenarios. Existing mechanisms use internal (on the ov...