3171 search results - page 179 / 635 » Application of Reduce Order Modeling to Time Parallelization |
124
click to vote
PPOPP
2010
ACM
16 years 25 days ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
143
click to vote
ISPASS
2009
IEEE
2009
IEEE
Machine learning based online performance prediction for runtime parallelization and task scheduling
15 years 10 months ago
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
138
Voted
CBSE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Predicting the performance of component-based applications is difficult due to the complexity of the underlying component technology. This problem is exacerbated when a m...
107
Voted
JPDC
2006
15 years 3 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
184
click to vote
ECRTS
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model...