The complexity of concurrency control (CC) algorithms makes a quantitative analysis of their performance difficult. Some researchers have attempted such studies using analytical modelling and simulation. These studies address only the performance comparison of a few algorithms under limited operating conditions. The operating conditions considered have simplified the analysis and applicability of the results. A very important factor that has not been considered is the transactions profile. This paper establishes the relationship between the average transaction response time and the degree of interference for four CC algorithms based on two-phase locking. The study has been made using simulation and the SIMULA programming language on a IBM 370/168
Synchronisation techniques based on two phase locking in a distributed database system: a performance evaluation study
Thanos C;Carlesi C;
1982
Abstract
The complexity of concurrency control (CC) algorithms makes a quantitative analysis of their performance difficult. Some researchers have attempted such studies using analytical modelling and simulation. These studies address only the performance comparison of a few algorithms under limited operating conditions. The operating conditions considered have simplified the analysis and applicability of the results. A very important factor that has not been considered is the transactions profile. This paper establishes the relationship between the average transaction response time and the degree of interference for four CC algorithms based on two-phase locking. The study has been made using simulation and the SIMULA programming language on a IBM 370/168File | Dimensione | Formato | |
---|---|---|---|
prod_421365-doc_149569.pdf
solo utenti autorizzati
Descrizione: Synchronisation techniques based on two phase locking in a distributed database system: a performance evaluation study
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.2 MB
Formato
Adobe PDF
|
1.2 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.