573 search results - page 66 / 115 » Parallel Algorithms for Dandelion-Like Codes |
ICS
1999
Tsinghua U.
13 years 11 months ago
1999
Tsinghua U.
—This paper explores the use of compiler optimizations which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying ...
SPAA
2010
ACM
14 years 7 days ago
2010
ACM
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
PPOPP
2005
ACM
14 years 29 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
PARA
2004
Springer
14 years 23 days ago
2004
Springer
It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specificati...