Sciweavers

48 search results - page 2 / 10
» A Sound and Complete Algorithm for Distributed Commerce Tran...
Sort
View
CONCUR
2008
Springer
13 years 8 months ago
Completeness and Nondeterminism in Model Checking Transactional Memories
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
WWW
2005
ACM
14 years 7 months ago
Diversified SCM standard for the Japanese retail industry
In this paper, we present the concept of a diversified SCM (supply chain management) standard and distributed hub architecture which were used in B2B experiments for the Japanese ...
Koichi Hayashi, Naoki Koguro, Reki Murakami
IAT
2007
IEEE
14 years 1 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
RV
2010
Springer
171views Hardware» more  RV 2010»
13 years 5 months ago
Runtime Verification for Software Transactional Memories
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
Vasu Singh
JAIR
2008
110views more  JAIR 2008»
13 years 7 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels