Sciweavers

232 search results - page 8 / 47
» A Message Ordering Problem in Parallel Programs
Sort
View
UAI
2008
14 years 11 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
IPPS
2007
IEEE
15 years 3 months ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...
EUROPAR
2003
Springer
15 years 2 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
EUROPAR
2003
Springer
15 years 2 months ago
KOJAK - A Tool Set for Automatic Performance Analysis of Parallel Programs
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
Bernd Mohr, Felix Wolf
CLUSTER
2003
IEEE
15 years 2 months ago
Coordinated Checkpoint versus Message Log for Fault Tolerant MPI
— Large Clusters, high availability clusters and Grid deployments often suffer from network, node or operating system faults and thus require the use of fault tolerant programmin...
Aurelien Bouteiller, Pierre Lemarinier, Gér...