Sciweavers

456 search results - page 67 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
IEEEPACT
2005
IEEE
15 years 3 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
CASES
2000
ACM
15 years 2 months ago
A code generation framework for Java component-based designs
In this paper, we describe a software architecture supporting code generation from within Ptolemy II. Ptolemy II is a componentbased design tool intended for embedded and real-tim...
Jeff Tsay, Christopher Hylands, Edward Lee
PPSN
1998
Springer
15 years 1 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
ICCV
2009
IEEE
14 years 7 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
IPPS
2003
IEEE
15 years 3 months ago
Extending OpenMP to Support Slipstream Execution Mode
OpenMP has emerged as a widely accepted standard for writing shared memory programs. Hardware-specific extensions such as data placement are usually needed to improve the scalabi...
Khaled Z. Ibrahim, Gregory T. Byrd