Sciweavers

898 search results - page 134 / 180
» A Linear Tabling Mechanism
Sort
View
CF
2010
ACM
13 years 11 months ago
A communication infrastructure for a million processor machine
: The SpiNNaker machine is a massively parallel computing system, consisting of 1,000,000 cores. From one perspective, it has a place in Flynns' taxonomy: it is a straightforw...
Andrew D. Brown, Steve Furber, Jeff S. Reeve, Pete...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
NSDI
2004
13 years 9 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
USITS
2003
13 years 9 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
CONEXT
2009
ACM
13 years 8 months ago
SafeGuard: safe forwarding during route changes
This paper presents the design and evaluation of SafeGuard, an intra-domain routing system that can safely forward packets to their destinations even when routes are changing. Saf...
Ang Li, Xiaowei Yang, David Wetherall