Performance evaluation of a new optimistic concurrency control algorithm

Jonathan Addess; Ehud Gudes; Doron Tal; Naphtali Rishe

Performance evaluation of a new optimistic concurrency control algorithm

Jonathan Addess
, Ehud Gudes
, Doron Tal
, Naphtali Rishe

Research output: Contribution to conference › Paper › peer-review

Abstract

A modification of the classic Kung-Robinson timestamp-based concurrency control algorithm is described. The algorithm is based on two innovative techniques: query killing notes and weak serializability of transactions. In particular, it prefers long transactions over short queries and thus reduces considerably the number of transaction rollbacks required. In order to test the validity and evaluate the performance of the proposed algorithm, a simulation program was written and run using a realistic set of transactions. The simulation was performed using Flat Concurrent Prolog (FCP). The advantages of FCP for specifying and implementing parallel algorithms include its refined granularity of parallelism, its declarativeness and conciseness, and its powerful communication and synchronization primitives. Results of algorithm performance are presented.

Original language	English
Pages	522-525
Number of pages	4
State	Published - 1 Jan 1990
Event	PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications - Miami Beach, FL, USA Duration: 7 Mar 1990 → 9 Mar 1990

Conference

Conference	PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications
City	Miami Beach, FL, USA
Period	7/03/90 → 9/03/90

ASJC Scopus subject areas

General Engineering

Cite this

@conference{19152e3cd810474db791f0d2b5f39b45,

title = "Performance evaluation of a new optimistic concurrency control algorithm",

abstract = "A modification of the classic Kung-Robinson timestamp-based concurrency control algorithm is described. The algorithm is based on two innovative techniques: query killing notes and weak serializability of transactions. In particular, it prefers long transactions over short queries and thus reduces considerably the number of transaction rollbacks required. In order to test the validity and evaluate the performance of the proposed algorithm, a simulation program was written and run using a realistic set of transactions. The simulation was performed using Flat Concurrent Prolog (FCP). The advantages of FCP for specifying and implementing parallel algorithms include its refined granularity of parallelism, its declarativeness and conciseness, and its powerful communication and synchronization primitives. Results of algorithm performance are presented.",

author = "Jonathan Addess and Ehud Gudes and Doron Tal and Naphtali Rishe",

year = "1990",

month = jan,

day = "1",

language = "English",

pages = "522--525",

note = "PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications ; Conference date: 07-03-1990 Through 09-03-1990",

}

TY - CONF

T1 - Performance evaluation of a new optimistic concurrency control algorithm

AU - Addess, Jonathan

AU - Gudes, Ehud

AU - Tal, Doron

AU - Rishe, Naphtali

PY - 1990/1/1

Y1 - 1990/1/1

N2 - A modification of the classic Kung-Robinson timestamp-based concurrency control algorithm is described. The algorithm is based on two innovative techniques: query killing notes and weak serializability of transactions. In particular, it prefers long transactions over short queries and thus reduces considerably the number of transaction rollbacks required. In order to test the validity and evaluate the performance of the proposed algorithm, a simulation program was written and run using a realistic set of transactions. The simulation was performed using Flat Concurrent Prolog (FCP). The advantages of FCP for specifying and implementing parallel algorithms include its refined granularity of parallelism, its declarativeness and conciseness, and its powerful communication and synchronization primitives. Results of algorithm performance are presented.

AB - A modification of the classic Kung-Robinson timestamp-based concurrency control algorithm is described. The algorithm is based on two innovative techniques: query killing notes and weak serializability of transactions. In particular, it prefers long transactions over short queries and thus reduces considerably the number of transaction rollbacks required. In order to test the validity and evaluate the performance of the proposed algorithm, a simulation program was written and run using a realistic set of transactions. The simulation was performed using Flat Concurrent Prolog (FCP). The advantages of FCP for specifying and implementing parallel algorithms include its refined granularity of parallelism, its declarativeness and conciseness, and its powerful communication and synchronization primitives. Results of algorithm performance are presented.

UR - https://www.scopus.com/pages/publications/0025209643

M3 - Paper

AN - SCOPUS:0025209643

SP - 522

EP - 525

T2 - PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

Y2 - 7 March 1990 through 9 March 1990

ER -

Performance evaluation of a new optimistic concurrency control algorithm

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this