27 search results - page 2 / 6 » Efficient Run-Time Support for Irregular Block-Structured Ap... |
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper explains how efficient support for semiregular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work ...
HIPS
1998
IEEE
13 years 10 months ago
1998
IEEE
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
JPDC
2006
13 years 6 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
JCSS
2008
13 years 6 months ago
2008
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
WEA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...