Sciweavers

239 search results - page 23 / 48
» A practical scalable distributed B-tree
Sort
View
SIGCOMM
2004
ACM
15 years 3 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
86
Voted
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
15 years 7 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
ASPLOS
2004
ACM
15 years 3 months ago
FAB: building distributed enterprise disk arrays from commodity components
This paper describes the design, implementation, and evaluation of a Federated Array of Bricks (FAB), a distributed disk array that provides the reliability of traditional enterpr...
Yasushi Saito, Svend Frølund, Alistair C. V...
91
Voted
CAL
2007
14 years 10 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
94
Voted
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 3 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan