Sciweavers

573 search results - page 19 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
PC
2006
124views Management» more  PC 2006»
13 years 8 months ago
Message-passing code generation for non-rectangular tiling transformations
Tiling is a well known loop transformation used to reduce communication overhead in distributed memory machines. Although a lot of theoretical research has been done concerning th...
Georgios I. Goumas, Nikolaos Drosinos, Maria Athan...
ISCOPE
1998
Springer
14 years 19 days ago
An Object-Oriented Collection of Minimum Degree Algorithms
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
Gary Kumfert, Alex Pothen
ESCIENCE
2007
IEEE
14 years 9 days ago
Grid-Enabling an Efficient Algorithm for Demanding Global Optimization Problems in Genetic Analysis
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
Mahen Jayawardena, Sverker Holmgren
GPC
2009
Springer
14 years 3 months ago
Efficient Parallelized Network Coding for P2P File Sharing Applications
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...
Karam Park, Joon-Sang Park, Won Woo Ro
PPOPP
1999
ACM
14 years 22 days ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard