Sciweavers

72 search results - page 13 / 15
» Debugging programs that use atomic blocks and transactional ...
Sort
View
POPL
2009
ACM
14 years 2 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
PPOPP
2003
ACM
14 years 18 days ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
ECOOP
1999
Springer
13 years 11 months ago
Providing Persistent Objects in Distributed Systems
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic...
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul ...
ICPP
1999
IEEE
13 years 11 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
IPPS
2008
IEEE
14 years 1 months ago
A deterministic multi-way rendezvous library for haskell
The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, m...
Nalini Vasudevan, Satnam Singh, Stephen A. Edwards