Searching for authors named "Divyakant Agrawal" – sorted by Relevance.
127 documents found, showing 1 through 10.
Next 10 →
-
Modular synchronization in distributed, multiversion databases: Version control and concurrency control
- …Abstract- A version control mechanism is proposed that enhances the modularity and extensibility of multiversion concurrency control algorithms. We decouple the multiversion algorithms into two components: version control and concurrency control. This permits modular development of multiversion prot…
- Cited by 15 (0 self) – Add To MetaCart
-
Abbadi. Reducing storage for quorum consensus algorithms
- …In this paper, we first develop a fragmentation method that reduces the storage overhead of replicated ob-jects. We then present a data management protocol for these fragmented objects, and show that this protocol is a generalisation of quorum consensus algorithms for replicated data in which object…
- Cited by 3 (0 self) – Add To MetaCart
-
Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks
- …Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as th…
- Add To MetaCart
-
Power aware routing for sensor databases
- …Abstract — Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), an…
- Cited by 4 (0 self) – Add To MetaCart
-
Distributed navigation algorithms for sensor networks
- …Abstract — We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed nav…
- Cited by 4 (0 self) – Add To MetaCart
-
A Game Theoretic Framework for Incentives in P2P Systems
- …Peer-To-Peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and unpredictable. In this paper, we use ideas from Game Theory to study…
- Cited by 57 (0 self) – Add To MetaCart
-
Medians and Beyond: New Aggregation Techniques for Sensor Networks
- …Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), making communication very expensive. Another important issue in the context of sensorbased information systems is that individu…
- Cited by 71 (5 self) – Add To MetaCart
-
Evaluating Weak Memories with Maya
- …Maya is a simulation platform for evaluating the performance of parallel programs on parallel architectures with different memory coherence protocols. Rapid prototyping of different memory protocols supporting varying degrees of coherence is possible and the impact of these protocols on the perfor…
- Add To MetaCart
-
Distributed Optimistic Concurrency Control with Reduced Rollback
- …terests include design of algo-rithms for concurrent systems, optimistic protocols and distrib-uted systems. Arthur Bernstein is a Professor of Computer Science at the State…
- Cited by 5 (0 self) – Add To MetaCart
-
Abstract Locks with Constrained Sharing* (Extended Abstract)
- …In this paper, we propose a new mode for locks that permits sharing in a constrained manner. We develop a family of locking protocols, the strictest of which is the two phase locking protocol while the most permissive recognizes all conflict-preserving serializable histories. This is the first locki…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
