Sciweavers

573 search results - page 55 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
A Transformational Framework for Skeletal Programs: Overview and Case Study
A structured approach to parallel programming allows to construct applications by composing skeletons, i.e., recurring patterns of task- and data-parallelism. First academic and co...
Sergei Gorlatch, Susanna Pelagatti
IPPS
2007
IEEE
15 years 4 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
IPPS
2007
IEEE
15 years 4 months ago
The Adaptive Code Kitchen: Flexible Tools for Dynamic Application Composition
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...
Pilsung Kang 0002, Mike Heffner, Joy Mukherjee, Na...
WCRE
2002
IEEE
15 years 2 months ago
Estimating Potential Parallelism for Platform Retargeting
Scientific, symbolic, and multimedia applications present diverse computing workloads with different types of inherent parallelism. Tomorrow’s processors will employ varying com...
Linda M. Wills, Tarek M. Taha, Lewis B. Baumstark ...
TIT
2008
129views more  TIT 2008»
14 years 10 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir