Sciweavers

481 search results - page 41 / 97
» Cache-Conscious Data Placement
Sort
View
PODC
2005
ACM
16 years 19 days ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
FAST
2004
15 years 8 months ago
Segank: A Distributed Mobile Storage System
This paper presents a distributed mobile storage system designed for storage elements connected by a network of non-uniform quality. Flexible data placement is crucial, and it lea...
Sumeet Sobti, Nitin Garg, Fengzhou Zheng, Junwen L...
167
Voted
EUROPAR
2001
Springer
15 years 11 months ago
Performance of High-Accuracy PDE Solvers on a Self-Optimizing NUMA Architecture
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
Sverker Holmgren, Dan Wallin
196
Voted
USITS
2003
15 years 8 months ago
SkipNet: A Scalable Overlay Network with Practical Locality Properties
: Scalable overlay networks such as Chord, Pastry, and Tapestry have recently emerged as a flexible infrastructure for building large peer-to-peer systems. In practice, two disadv...
Nicholas J. A. Harvey, Michael B. Jones, Stefan Sa...
ECRTS
2007
IEEE
16 years 1 months ago
WCET-Directed Dynamic Scratchpad Memory Allocation of Data
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
Jean-François Deverge, Isabelle Puaut