Sciweavers

268 search results - page 34 / 54
» Analyzing Parallel Programs with Pin
Sort
View
123
Voted
HPCN
1994
Springer
15 years 7 months ago
Experiments with HPF Compilation for a Network of Workstations
Abstract. High Performance Fortran (hpf) is a data-parallel Fortran for Distributed Memory Multiprocessors. Hpf provides an interesting programming model but compilers are yet to c...
Fabien Coelho
CONCUR
2006
Springer
15 years 7 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
PPSN
2010
Springer
15 years 1 months ago
Using Co-solvability to Model and Exploit Synergetic Effects in Evolution
Abstract. We introduce, analyze, and experimentally examine co-solvability, an ability of a solution to solve a pair of fitness cases (tests). Based on this concept, we devise a co...
Krzysztof Krawiec, Pawel Lichocki
IPPS
2008
IEEE
15 years 10 months ago
Intermediate checkpointing with conflicting access prediction in transactional memory systems
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
M. M. Waliullah, Per Stenström
APPT
2009
Springer
15 years 10 months ago
Evaluating SPLASH-2 Applications Using MapReduce
MapReduce has been prevalent for running data-parallel applications. By hiding other non-functionality parts such as parallelism, fault tolerance and load balance from programmers,...
Shengkai Zhu, Zhiwei Xiao, Haibo Chen, Rong Chen, ...