Sciweavers

183 search results - page 21 / 37
» Linear-Time Algorithms in Memory Hierarchies
Sort
View
TVCG
2010
165views more  TVCG 2010»
14 years 4 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
ICS
2007
Tsinghua U.
15 years 3 months ago
Adaptive Strassen's matrix multiplication
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
Paolo D'Alberto, Alexandru Nicolau
EMSOFT
2007
Springer
15 years 3 months ago
The revenge of the overlay: automatic compaction of OS kernel code via on-demand code loading
There is increasing interest in using general-purpose operating systems, such as Linux, on embedded platforms. It is especially important in embedded systems to use memory effici...
Haifeng He, Saumya K. Debray, Gregory R. Andrews
ACMMSP
2006
ACM
232views Hardware» more  ACMMSP 2006»
15 years 3 months ago
Implicit and explicit optimizations for stencil computations
Stencil-based kernels constitute the core of many scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due pr...
Shoaib Kamil, Kaushik Datta, Samuel Williams, Leon...
PPSC
1989
14 years 10 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra