Sciweavers

16128 search results - page 3215 / 3226
» Distributed network scheduling
Sort
View
TOCS
1998
114views more  TOCS 1998»
14 years 9 months ago
Performance Evaluation of the Orca Shared-Object System
Orca is a portable, object-based distributed shared memory system. This paper studies and evaluates the design choices made in the Orca system and compares Orca with other DSMs. T...
Henri E. Bal, Raoul Bhoedjang, Rutger F. H. Hofman...
TPDS
1998
122views more  TPDS 1998»
14 years 9 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
TON
2002
114views more  TON 2002»
14 years 9 months ago
Dynamic parallel access to replicated content in the internet
Popular content is frequently replicated in multiple servers or caches in the Internet to offload origin servers and improve end-user experience. However, choosing the best server ...
Pablo Rodriguez, Ernst Biersack
VLDB
2002
ACM
137views Database» more  VLDB 2002»
14 years 9 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
« Prev « First page 3215 / 3226 Last » Next »