244 search results - page 9 / 49 » Basic Compiler Algorithms for Parallel Programs |
IPPS
1995
IEEE
15 years 3 months ago
1995
IEEE
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
108
click to vote
PDPTA
2000
15 years 1 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and ...
100
click to vote
ICS
2005
Tsinghua U.
15 years 5 months ago
2005
Tsinghua U.
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
TCAD
2002
14 years 11 months ago
2002
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...