Sciweavers

272 search results - page 42 / 55
» Code Transformations to Improve Memory Parallelism
Sort
View
SPAA
1998
ACM
14 years 27 days ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
14 years 26 days ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
PPAM
2007
Springer
14 years 2 months ago
Enhancing Productivity in High Performance Computing through Systematic Conditioning
Abstract. In order to take full advantage of high-end computing platforms, scientific applications often require modifications to source codes, and to their build systems that ge...
Magdalena Slawiñska, Jaroslaw Slawinski, Va...
CASES
2006
ACM
14 years 2 months ago
High-level languages for small devices: a case study
In this paper we study, through a concrete case, the feasibility of using a high-level, general-purpose logic language in the design and implementation of applications targeting w...
Manuel Carro, José F. Morales, Henk L. Mull...
ICS
2009
Tsinghua U.
14 years 3 months ago
Parametric multi-level tiling of imperfectly nested loops
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...
Albert Hartono, Muthu Manikandan Baskaran, C&eacut...