Sciweavers

86 search results - page 8 / 18
» Custom Data Layout for Memory Parallelism
Sort
View
PPOPP
2003
ACM
14 years 22 days ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
SC
1995
ACM
13 years 11 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
CLUSTER
2003
IEEE
14 years 24 days ago
Improving the Performance of MPI Derived Datatypes by Optimizing Memory-Access Cost
The MPI Standard supports derived datatypes, which allow users to describe noncontiguous memory layout and communicate noncontiguous data with a single communication function. Thi...
Surendra Byna, William D. Gropp, Xian-He Sun, Raje...
FCCM
2003
IEEE
96views VLSI» more  FCCM 2003»
14 years 24 days ago
Data Search and Reorganization Using FPGAs: Application to Spatial Pointer-based Data Structures
FPGAs have appealing features such as customizable internal and external bandwidth and the ability to exploit vast amounts of fine-grain parallelism. In this paper we explore the ...
Pedro C. Diniz, Joonseok Park