PROVING THE CORRECTNESS OF THE EXTENDED SERIAL GRAPH-VALIDATION QUEUE SCHEME IN THE CLIENT-SERVER SYSTEM

Numerous studies have been conducted to develop concurrency control schemes that can be applied to client-server systems, such as the Extended Serial Graph-Validation Queue (SG-VQ) scheme. Extended SG-VQ is a control concurrency scheme in client-server system which implements object caching on the c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:BAREKENG: Jurnal Ilmu Matematika dan Terapan Ročník 18; číslo 2; s. 1359 - 1368
Hlavní autoři: Salsabila, Fitra Nuvus, Bukhari, Fahren, Nurdiati, Sri
Médium: Journal Article
Jazyk:angličtina
Vydáno: Universitas Pattimura 01.06.2024
Témata:
client-server
concurrency control
graph
locking
serializability
ISSN:1978-7227, 2615-3017
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Numerous studies have been conducted to develop concurrency control schemes that can be applied to client-server systems, such as the Extended Serial Graph-Validation Queue (SG-VQ) scheme. Extended SG-VQ is a control concurrency scheme in client-server system which implements object caching on the client side and locking strategy on the server side. This scheme employs validation algorithms based on queues on the client side and graphs on the server side. This research focuses on the mathematical analysis of the correctness of the Extended SG-VQ scheme using serializability as the criterion that needs to be achieved. Implementing a cycle-free transaction graph is a necessary and sufficient condition to achieve serializability. In this research, the serializability of the Extended SG-VQ scheme has been proven through the exposition of ten definitions, two propositions, three lemmas, and one theorem.
ISSN:1978-7227
2615-3017
DOI:10.30598/barekengvol18iss2pp1359-1368