By Topic

Alleviating hot spots in a distributed database system in a high speed wide area network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Banerjee ; Dept. of Inf. Sci., Pittsburgh Univ., PA, USA ; V. O. K. Li

The performance of conventional distributed algorithms does not scale with the network data rate, owing to communication latency overheads. Thus new algorithms are necessary in high speed wide area networks. At the same time, the new algorithms cannot instantly replace the ones that are widely in use today. Hence a gradual transition is necessary. One such concurrency control algorithm based on locking is described. Locking is one of the most common concurrency control mechanisms in use today. This new algorithm is a modification of distributed locking that enables high performance operation in a high speed wide area networking environment

Published in:

TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994

Date of Conference:

22-26 Aug 1994