Sciweavers

244 search results - page 1 / 49
» Basic Compiler Algorithms for Parallel Programs
Sort
View
PPOPP
1999
ACM
13 years 9 months ago
Basic Compiler Algorithms for Parallel Programs
Jaejin Lee, David A. Padua, Samuel P. Midkiff
MICRO
1992
IEEE
124views Hardware» more  MICRO 1992»
13 years 9 months ago
A shape matching approach for scheduling fine-grained parallelism
- We present a compilation technique for scheduling parallelism on fine grained asynchronous MIMD systems. The shape scheduling algorithm is introduced that utilizes the flexibilit...
Brian A. Malloy, Rajiv Gupta, Mary Lou Soffa
IEEEPACT
1997
IEEE
13 years 9 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
PPOPP
1991
ACM
13 years 8 months ago
Coarse-Grain Parallel Programming in Jade
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
Monica S. Lam, Martin C. Rinard
PLDI
2000
ACM
13 years 9 months ago
Exploiting superword level parallelism with multimedia instruction sets
Increasing focus on multimedia applications has prompted the addition of multimedia extensions to most existing general purpose microprocessors. This added functionality comes pri...
Samuel Larsen, Saman P. Amarasinghe