Sciweavers

68 search results - page 2 / 14
» Memory Hierarchy Management for Iterative Graph Structures
Sort
View
IPPS
2006
IEEE
13 years 11 months ago
An approach to locality-conscious load balancing and transparent memory hierarchy management with a global-address-space paralle
The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
GD
2004
Springer
13 years 10 months ago
Drawing the AS Graph in 2.5 Dimensions
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorot...
ASPLOS
2011
ACM
12 years 9 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
EVOW
2011
Springer
12 years 8 months ago
Two Iterative Metaheuristic Approaches to Dynamic Memory Allocation for Embedded Systems
Abstract. Electronic embedded systems designers aim at finding a tradeoff between cost and power consumption. As cache memory management has been shown to have a significant imp...
María Soto, André Rossi, Marc Sevaux
DEBU
2010
113views more  DEBU 2010»
13 years 2 months ago
Storage Class Memory Aware Data Management
Storage Class Memory (SCM) is here to stay. It has characteristics that place it in a class apart both from main memory and hard disk drives. Software and systems, architectures a...
Bishwaranjan Bhattacharjee, Mustafa Canim, Christi...