Sciweavers

3394 search results - page 141 / 679
» A Modal Model of Memory
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
A Framework for Portable Shared Memory Programming
Widespread adaptation of shared memory programming for High Performance Computing has been inhibited by a lack of standardization and the resulting portability problems between pl...
Martin Schulz, Sally A. McKee
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 10 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
16 years 17 days ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
VMV
2004
80views Visualization» more  VMV 2004»
15 years 7 months ago
Memory Efficient Billboard Clouds for BTF Textured Objects
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
Jan Meseth, Reinhard Klein
HPDC
1996
IEEE
15 years 10 months ago
Shared Memory NUMA Programming on I-WAY
The performance of the Global Array shared-memory nonuniform memory-access programming model is explored on the I-WAY, wide-area-network distributed supercomputer environment. The...
Jarek Nieplocha, Robert J. Harrison