TY - GEN
T1 - Site selection for real-time client request handling
AU - Kanitkar, Vinay
AU - Delis, Alex
N1 - Copyright:
Copyright 2004 Elsevier Science B.V., Amsterdam. All rights reserved.
PY - 1999
Y1 - 1999
N2 - 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. An 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 volumes of update transactions.
AB - 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. An 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 volumes of update transactions.
UR - http://www.scopus.com/inward/record.url?scp=0032670205&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032670205&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0032670205
SN - 0769502229
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 298
EP - 305
BT - Proceedings - International Conference on Distributed Computing Systems
PB - IEEE
T2 - Proceedings of the 1999 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99)
Y2 - 31 May 1999 through 4 June 1999
ER -