Efficient concurrency control for broadcast environments

Shanmugasundaram, Jayavel ; Nithrakashyap, Arvind ; Sivasankaran, Rajendran ; Ramamritham, Krithi (1999) Efficient concurrency control for broadcast environments ACM SIGMOD Record, 28 (2). pp. 85-96. ISSN 0163-5808

Full text not available from this repository.

Official URL: http://dl.acm.org/citation.cfm?id=304190

Related URL: http://dx.doi.org/10.1145/304181.304190

Abstract

A crucial consideration in environments where data is broadcast to clients is the low bandwidth available for clients to communicate with servers. Advanced applications in such environments do need to read data that is mutually consistent as well as current. However, given the asymmetric communication capabilities and the needs of clients in mobile environments, traditional serializability-based approaches are too restrictive, unnecessary, and impractical. We thus propose the use of a weaker correctness criterion called update consistency and outline mechanisms based on this criterion that ensure (1) the mutual consistency of data maintained by the server and read by clients, and (2) the currency of data read by clients. Using these mechanisms, clients can obtain data that is current and mutually consistent “off the air”, i.e., without contacting the server to, say, obtain locks. Experimental results show a substantial reduction in response times as compared to existing (serializability-based) approaches. A further attractive feature of the approach is that if caching is possible at a client, weaker forms of currency can be obtained while still satisfying the mutual consistency of data.

Item Type:Article
Source:Copyright of this article belongs to Association for Computing Machinery.
ID Code:94294
Deposited On:23 Aug 2012 11:37
Last Modified:23 Aug 2012 11:37

Repository Staff Only: item control page