Sciweavers

337 search results - page 17 / 68
» Run-Time Methods for Parallelizing Partially Parallel Loops
Sort
View
IPPS
2002
IEEE
14 years 12 days ago
Efficient Pipelining of Nested Loops: Unroll-and-Squash
The size and complexity of current custom VLSI have forced the use of high-level programming languages to describe hardware, and compiler and synthesis technology bstract designs ...
Darin Petkov, Randolph E. Harr, Saman P. Amarasing...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 12 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...
ICPPW
2005
IEEE
14 years 1 months ago
A Comparison of Two Methods for Building Astronomical Image Mosaics on a Grid
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...
Daniel S. Katz, Joseph C. Jacob, G. Bruce Berriman...
IEEEPACT
1998
IEEE
13 years 11 months ago
Scanning Polyhedra without Do-loops
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...
Pierre Boulet, Paul Feautrier
VIP
2000
13 years 8 months ago
Use of Series Parallel Digraph Analysis in Generating Instructions for Multiple Users
Series Parallel (SP) digraphs are a common method of representing instructions with partially ordered actions, but not always an ideal one, as relationships among groups of action...
Margaret Mitchell