4311 search results - page 229 / 863 » Code Generation for Distributed Systems |
132
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multi-dimensional array. Previous techniques for multi...
182
click to vote
HPCA
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper introduces a new architectural approach that supports compiler-synthesized dynamic branch predication. In compiler-synthesized dynamic branch prediction, the compiler g...
161
click to vote
LCTRTS
2005
Springer
15 years 12 months ago
2005
Springer
Real-time garbage collection has been shown to be feasible, but for programs with high allocation rates, the utilization achievable is not sufficient for some systems. Since a hi...
152
click to vote
MM
2010
ACM
15 years 6 months ago
2010
ACM
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
155
click to vote
SPAA
2006
ACM
16 years 11 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...