Sciweavers

95 search results - page 2 / 19
» Constructive, Deterministic Implementation of Shared Memory ...
Sort
View
CONCURRENCY
2000
106views more  CONCURRENCY 2000»
13 years 4 months ago
Performance characteristics for OpenMP constructs on different parallel computer architectures
OpenMP is emerging as a quasi-standard for shared memory parallel programming on small SMP-systems. To serve as a common programming interface in shared memory parallel programmin...
Rudolf Berrendorf, Guido Nieken
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 5 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
ASPLOS
2011
ACM
12 years 8 months ago
RCDC: a relaxed consistency deterministic computer
Providing deterministic execution significantly simplifies the debugging, testing, replication, and deployment of multithreaded programs. Recent work has developed deterministic...
Joseph Devietti, Jacob Nelson, Tom Bergan, Luis Ce...
CGF
2004
127views more  CGF 2004»
13 years 4 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
HPCA
1997
IEEE
13 years 9 months ago
A Performance Comparison of Hierarchical Ring- and Mesh-Connected Multiprocessor Networks
This paper compares the performance of hierarchical ring- and mesh-connected wormhole routed shared memory multiprocessor networks in a simulation study. Hierarchical rings are in...
Govindan Ravindran, Michael Stumm