The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (1999)
Austin, Texas
May 31, 1999 to June 4, 1999
ISBN: 0-7695-0222-9
pp: 0298
Alex Delis , Polytechnic University
Vinay Kanitkar , Polytechnic University
In a conventional client-server database system (CS-DBS), a transaction and its requisite data have to be colocated at a single site for the operation to proceed. This has traditionally been achieved by moving either the data or the transaction. Today, the availability of powerful workstations and high-bandwidth networking options has led users to expect real-time guarantees about the completion times of their tasks. So as to offer such guarantees in a CS-DBS, a transaction should be processed by any means that allows it to meet its deadline. In this paper, we explore the option of moving both transactions and data to the most promising sites for successful completion. We propose a load-sharing mechanism that oversees the shipment of data and transactions in order to increase the efficiency of a client-server cluster. Additionally, we make use of the concept of grouped locks to schedule the movement of data objects in the cluster in a more efficient manner. Our experimental evaluation shows that the use of our load-sharing algorithm provides a considerable improvement in the real-time processing efficiency of a CS-DBS even in the presence of very high updating rates.
real-time systems, client-server databases, load-sharing techniques
Alex Delis, Vinay Kanitkar, "Site Selection for Real-Time Client Request Handling", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 0298, 1999, doi:10.1109/ICDCS.1999.776531
91 ms
(Ver 3.3 (11022016))