We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval c...
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...
In this paper we focus on the issue of repository transactions. Similar to database objects repository objects can be accessed form multiple clients simultaneously. The organizati...
Elements of transaction processing become more and more accepted as a base for general purpose distributed computing.We have developed an action concept with an extended functiona...
: Persistent connections address inefficiencies associated with multiple concurrent connections. They can improve response time when successfully used with pipelining to retrieve a...