Sciweavers

135 search results - page 13 / 27
» Concurrency in Prolog Using Threads and a Shared Database
Sort
View
COMCOM
2007
111views more  COMCOM 2007»
13 years 7 months ago
Failover, load sharing and server architecture in SIP telephony
We apply some of the existing web server redundancy techniques for high service availability and scalability to the relatively new IP telephony context. The paper compares various...
Kundan Singh, Henning Schulzrinne
CIDR
2011
252views Algorithms» more  CIDR 2011»
12 years 11 months ago
Hyder - A Transactional Record Manager for Shared Flash
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Philip A. Bernstein, Colin W. Reid, Sudipto Das
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 11 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
ASPLOS
2011
ACM
12 years 11 months ago
ConSeq: detecting concurrency bugs through sequential errors
Concurrency bugs are caused by non-deterministic interleavings between shared memory accesses. Their effects propagate through data and control dependences until they cause softwa...
Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Sc...
TKDE
2002
112views more  TKDE 2002»
13 years 7 months ago
Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
Chanjung Park, Seog Park, Sang Hyuk Son