Sciweavers

835 search results - page 130 / 167
» On optimal slicing of parallel programs
Sort
View
FGCS
2006
119views more  FGCS 2006»
13 years 10 months ago
OpenMP versus MPI for PDE solvers based on regular sparse numerical operators
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
Markus Nordén, Sverker Holmgren, Michael Th...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 10 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
SOFSEM
2010
Springer
14 years 7 months ago
Source Code Rejuvenation Is Not Refactoring
Programmers rely on programming idioms, design patterns, and workaround techniques to make up for missing programming language support. Evolving languages often address frequently ...
Peter Pirkelbauer, Damian Dechev, Bjarne Stroustru...
IWOMP
2009
Springer
14 years 2 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
ASPLOS
2006
ACM
14 years 2 months ago
Accurate and efficient filtering for the Intel thread checker race detector
Debugging data races in parallel applications is a difficult task. Error-causing data races may appear to vanish due to changes in an application's optimization level, thread...
Paul Sack, Brian E. Bliss, Zhiqiang Ma, Paul Peter...