Sciweavers

1993 search results - page 218 / 399
» Designing and Building Parallel Program
Sort
View
PPOPP
2006
ACM
14 years 3 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
EDO
2005
Springer
14 years 3 months ago
A middleware-independent model and language for component distribution
A distribution model for the new generation of component languages, which allows to plug required into provided interfaces, is presented together with the distributed component la...
Hans Albrecht Schmid, Marco Pfeifer, Thorsten Schn...
IPPS
1998
IEEE
14 years 1 months ago
Migration and Rollback Transparency for Arbitrary Distributed Applications in Workstation Clusters
Programmers and users of compute intensive scientific applications often do not want to (or even cannot) code load balancing and fault tolerance into their programs. The PBEAM syst...
Stefan Petri, Matthias Bolz, Horst Langendörf...
PPOPP
2009
ACM
14 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
CCGRID
2003
IEEE
14 years 1 months ago
Kernel Level Speculative DSM
Interprocess communication (IPC) is ubiquitous in today's computing world. One of the simplest mechanisms for IPC is shared memory. We present a system that enhances the Syst...
Cristian Tapus