Sciweavers

1499 search results - page 202 / 300
» Chopping Concurrent Programs
Sort
View
CIE
2010
Springer
14 years 3 months ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram
CF
2004
ACM
14 years 3 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
POPL
2008
ACM
14 years 10 months ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
IPPS
2008
IEEE
14 years 4 months ago
Programmability of the HPCS Languages: A case study with a quantum chemistry kernel
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
Aniruddha G. Shet, Wael R. Elwasif, Robert J. Harr...
OOPSLA
2007
Springer
14 years 4 months ago
Software speculative multithreading for Java
We apply speculative multithreading to sequential Java programs in software to achieve speedup on existing multiprocessors. A common speculation library supports both Java bytecod...
Christopher J. F. Pickett