41472 search results - page 7973 / 8295 » it 2006 |
177
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
167
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
124
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...
185
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
188
click to vote
SPAA
2006
ACM
16 years 21 days ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...