Sciweavers

819 search results - page 65 / 164
» Parallelization with Tree Skeletons
Sort
View
HICSS
2008
IEEE
142views Biometrics» more  HICSS 2008»
14 years 10 months ago
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
Yamin Li, Shietung Peng, Wanming Chu
CGO
2009
IEEE
15 years 1 months ago
Alchemist: A Transparent Dependence Distance Profiling Infrastructure
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
Xiangyu Zhang, Armand Navabi, Suresh Jagannathan
PC
2011
413views Management» more  PC 2011»
14 years 4 months ago
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
José Ignacio Aliaga, Matthias Bollhöfe...
IJPP
2007
91views more  IJPP 2007»
14 years 9 months ago
A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato...
EUROPAR
2001
Springer
15 years 2 months ago
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
Abstract. When parallelizing hierarchical view frustum culling and collision detection, the low computation cost per node and the fact that the traversal path through the tree stru...
Ulf Assarsson, Per Stenström