567 search results - page 16 / 114 » Program Optimization and Parallelization Using Idioms |
SPAA
2006
ACM
15 years 3 months 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...
PPOPP
2003
ACM
15 years 2 months ago
2003
ACM
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
154
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
TPDS
2010
14 years 8 months ago
2010
—This paper derives simple, yet fundamental formulas to describe the interplay between parallelism of an application, program performance, and energy consumption. Given the ratio...
VR
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we introduce DLoVe, a new paradigm for designing and implementing distributed and nondistributed virtual reality applications, using one-way constraints. DLoVe allo...