Sciweavers

10805 search results - page 101 / 2161
» Mapping Computation with No Memory
Sort
View
CLUSTER
2004
IEEE
15 years 10 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
CCGRID
2006
IEEE
16 years 13 days ago
The Computational and Storage Potential of Volunteer Computing
“Volunteer computing” uses Internet-connected computers, volunteered by their owners, as a source of computing power and storage. This paper studies the potential capacity of ...
David P. Anderson, Gilles Fedak
PPOPP
2009
ACM
16 years 7 months ago
Transactional memory with strong atomicity using off-the-shelf memory protection hardware
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
Martín Abadi, Tim Harris, Mojtaba Mehrara
ICDCS
2007
IEEE
16 years 21 days ago
Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks
Contour mapping is a crucial part of many wireless sensor network applications. Many efforts have been made to avoid collecting data from all the sensors in the network and produc...
Yunhao Liu, Mo Li
WG
2004
Springer
15 years 11 months ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...