Sciweavers

48 search results - page 2 / 10
» Code and data partitioning for fine-grain parallelism
Sort
View
CODES
2010
IEEE
13 years 1 months ago
Automatic memory partitioning: increasing memory parallelism via data structure partitioning
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
Yosi Ben-Asher, Nadav Rotem
LCTRTS
2007
Springer
13 years 10 months ago
Code and data partitioning for fine-grain parallelism
Michael L. Chu, Scott A. Mahlke
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 4 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
ASPLOS
2008
ACM
13 years 6 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 9 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...