Sciweavers

631 search results - page 76 / 127
» Composable memory transactions
Sort
View
ICDCS
1990
IEEE
15 years 1 months ago
Implementing Fault-Tolerant Distributed Applications
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
Santosh K. Shrivastava, Stuart M. Wheater
CAISE
2008
Springer
14 years 11 months ago
An Electronic Market-place Centralising Exchanges in the Virtual Enterprise: a Model Proposition
In this paper, we show that Service Oriented Architectures enable exchanges to be more flexible inside the virtual enterprise (VE), because they create an electronic market-place b...
Hervé Mathieu
JASIS
2010
170views more  JASIS 2010»
14 years 8 months ago
Analyzing URL queries
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
Wei Meng Lee, Mark Sanderson
ASPLOS
2008
ACM
14 years 11 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
ASPLOS
2008
ACM
14 years 11 months ago
Concurrency control with data coloring
Concurrency control is one of the main sources of error and complexity in shared memory parallel programming. While there are several techniques to handle concurrency control such...
Luis Ceze, Christoph von Praun, Calin Cascaval, Pa...