Why control of the concurrency level in distributed systems is more fundamental than deadlock management

1 January 1982

proceedings article
Published by Association for Computing Machinery (ACM)

p. 183-193
https://doi.org/10.1145/800220.806696

Abstract

Over the past years, stress has been put on global deadlock processing in distributed database management systems. This paper presents the main results of evaluation studies which were intended to provide clues for the choice of a concurrency control mechanism for the SCOT project. The relationship between deadlock management algorithm and concurrency level is exhibited. Their respective influence on system performance is studied in the light of simulations of several concurrency control techniques. A good algorithm for concurrency control is that which controls the concurrency level while solving, as a side effect, the deadlock question.

Keywords

GLOBAL DEADLOCK PROCESSING
DEADLOCK MANAGEMENT ALGORITHM
CONCURRENCY LEVEL
DEADLOCK QUESTION
DATABASE MANAGEMENT SYSTEM
CONCURRENCY CONTROL
CONCURRENCY CONTROL MECHANISM
SCOT PROJECT
CONCURRENCY CONTROL TECHNIQUE
GOOD ALGORITHM
DISTRIBUTED SYSTEM
MANAGEMENT SYSTEM
PARALLEL COMMUNICATION
RANDOMIZATION
DISTRIBUTED DATABASE
SYSTEM PERFORMANCE
SIDE EFFECT

This publication has 0 references indexed in Scilit: