Sciweavers

619 search results - page 30 / 124
» Programming Distributed Memory Sytems Using OpenMP
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
Scott Schneider, Jae-Seung Yeom, Benjamin Rose, Jo...
HPCN
1995
Springer
13 years 11 months ago
The Pandore data-parallel compiler and its portable runtime
Abstract. This paper presents an environment for programming distributed memory computers using High Performance Fortran. Emphasis is put on compilation techniques and distributed ...
Françoise André, Marc Le Fur, Yves M...
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 7 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
CONCUR
2005
Springer
14 years 1 months ago
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
Eric Goubault, Emmanuel Haucourt
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
14 years 27 days ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...