Sciweavers

5615 search results - page 1097 / 1123
» On the Computational Capabilities of Several Models
Sort
View
CLOUD
2010
ACM
14 years 20 days ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
SPAA
1997
ACM
13 years 11 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
PPOPP
1990
ACM
13 years 11 months ago
Concurrent Aggregates (CA)
Toprogrammassivelyconcurrent MIMDmachines, programmersneed tools for managingcomplexity. One important tool that has been used in the sequential programmingworld is hierarchies of...
Andrew A. Chien, William J. Dally
DAC
2010
ACM
13 years 11 months ago
TSV stress aware timing analysis with applications to 3D-IC layout optimization
As the geometry shrinking faces severe limitations, 3D wafer stacking with through silicon via (TSV) has gained interest for future SOC integration. Since TSV fill material and s...
Jae-Seok Yang, Krit Athikulwongse, Young-Joon Lee,...
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 11 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
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...
Martin Hoefer, Alexander Souza
« Prev « First page 1097 / 1123 Last » Next »