Sciweavers

279 search results - page 20 / 56
» Dependency-Driven Distribution of Synchronous Programs
Sort
View
SNPD
2003
13 years 10 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
WDAG
2005
Springer
82views Algorithms» more  WDAG 2005»
14 years 2 months ago
Distributed Transactional Memory for Metric-Space Networks
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
Maurice Herlihy, Ye Sun
IPPS
2003
IEEE
14 years 2 months ago
A Case Study of Selected SPLASH-2 Applications and the SBT Debugging Tool
SBT is portable library and tool for on-line debugging and performance monitoring of shared-memory parallel programs using the single-program-multiple-data (SPMD) model of paralle...
Ernesto Novillo, Paul Lu
IPPS
2000
IEEE
14 years 17 days ago
Scalable Monitoring Technique for Detecting Races in Parallel Programs
Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-the- y t...
Yong-Kee Jun, Charles E. McDowell
PPOPP
2012
ACM
12 years 4 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank