Sciweavers

337 search results - page 19 / 68
» Run-Time Methods for Parallelizing Partially Parallel Loops
Sort
View
ICS
1995
Tsinghua U.
13 years 11 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
SPAA
1993
ACM
13 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
CGO
2003
IEEE
14 years 24 days ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein
ICIP
2005
IEEE
14 years 9 months ago
Camera pose determination from a single view of parallel lines
In this paper, we present a method for finding the closed form solutions to the problem of determining the pose of a camera with respect to a given set of parallel lines in 3D spac...
Xianghua Ying, Hongbin Zha
IMPERIAL
1993
13 years 11 months ago
Laws of Parallel Synchronised Termination
The salient feature of the composition operators for Gamma programs is that for termination, the parallel composition operator demands that its operands must terminate synchronous...
David Sands