244 search results - page 38 / 49 » Basic Compiler Algorithms for Parallel Programs |
126
click to vote
FIDJI
2003
Springer
15 years 5 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
LCPC
2005
Springer
15 years 5 months ago
2005
Springer
Static Single Assignment (SSA) has been widely accepted as the intermediate program representation of choice in most modern compilers. It allows for a much more efficient data flo...
PLDI
1995
ACM
15 years 3 months ago
1995
ACM
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
119
click to vote
EUROPAR
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
MICRO
1999
IEEE
15 years 4 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...