Sciweavers

2104 search results - page 342 / 421
» Sorting with networks of data structures
Sort
View
ISLPED
2003
ACM
115views Hardware» more  ISLPED 2003»
15 years 9 months ago
Reducing energy and delay using efficient victim caches
In this paper, we investigate methods for improving the hit rates in the first level of memory hierarchy. Particularly, we propose victim cache structures to reduce the number of ...
Gokhan Memik, Glenn Reinman, William H. Mangione-S...
COMCOM
2007
82views more  COMCOM 2007»
15 years 4 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
WWW
2007
ACM
16 years 5 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...
SAC
2005
ACM
15 years 10 months ago
Dynamic group communication in mobile peer-to-peer environments
This paper presents an approach to integrate publish/subscribe semantics with on-demand multicast in wireless ad hoc networks, providing dynamic group communication with fine-gra...
Eiko Yoneki, Jean Bacon
SIROCCO
2003
15 years 5 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...