Sciweavers

835 search results - page 52 / 167
» On optimal slicing of parallel programs
Sort
View
ICPP
2005
IEEE
14 years 1 months ago
Optimizing Collective Communications on SMP Clusters
We describe a generic programming model to design collective communications on SMP clusters. The programming model utilizes shared memory for collective communications and overlap...
Meng-Shiou Wu, Ricky A. Kendall, Kyle Wright
IEEEPACT
2005
IEEE
14 years 1 months ago
An Event-Driven Multithreaded Dynamic Optimization Framework
Dynamic optimization has the potential to adapt the program’s behavior at run-time to deliver performance improvements over static optimization. Dynamic optimization systems usu...
Weifeng Zhang, Brad Calder, Dean M. Tullsen
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 1 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ICS
1999
Tsinghua U.
13 years 12 months ago
Improving the performance of speculatively parallel applications on the Hydra CMP
Hydra is a chip multiprocessor (CMP) with integrated support for thread-level speculation. Thread-level speculation provides a way to parallelize sequential programs without the n...
Kunle Olukotun, Lance Hammond, Mark Willey