Sciweavers

1499 search results - page 203 / 300
» Chopping Concurrent Programs
Sort
View
ASPLOS
2006
ACM
14 years 4 months ago
Atomicity and visibility in tiny embedded systems
Visibility is a property of a programming language’s memory model that determines when values stored by one concurrent computation become visible to other computations. Our work...
John Regehr, Nathan Cooprider, David Gay
PEPM
2009
ACM
14 years 2 months ago
Clone detection and removal for Erlang/OTP within a refactoring environment
A well-known bad code smell in refactoring and software maintenance is duplicated code, or code clones. A code clone is a code fragment that is identical or similar to another. Un...
Huiqing Li, Simon Thompson
SAIG
2001
Springer
14 years 2 months ago
MetaKlaim: Meta-programming for Global Computing
Most foundational models for global computing have focused on the spatial dimension of computations, however global computing requires also new ways of thinking about the temporal ...
Gian Luigi Ferrari, Eugenio Moggi, Rosario Puglies...
SC
2000
ACM
14 years 2 months ago
Dynamic Software Testing of MPI Applications with Umpire
As evidenced by the popularity of MPI (Message Passing Interface), message passing is an effective programming technique for managing coarse-grained concurrency on distributed com...
Jeffrey S. Vetter, Bronis R. de Supinski
POS
1998
Springer
14 years 2 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...