DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS.

Yuji Sugiyama, Tadao Kasami, Mamoru Fujii, Jun Okui

Research output: Contribution to journalArticle

Abstract

The deadlock detection and recovery are studied in a distributed system, where subsystems operate on equal terms without any centralized control and the number of each resource unit is one. In the system, the key is detecting the ″cyclic waiting″ and determining an interruption process, for which an algorithm is provided satisfying the following conditions. (1) Any process should terminate within a finite period; (2) when a process is determined to be interrupted, there should exist a ″cyclic waiting″ including the process; (3) the communication buffer necessary for detection and recovery amounts at most, up to that proportional to the number of processes and resources in the entire system.

Original languageEnglish
Pages (from-to)18-26
Number of pages9
JournalSYST COMPUT CONTROLS
Volume11
Issue number1
Publication statusPublished - Jan 1980
Externally publishedYes

Fingerprint

Recovery
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Sugiyama, Y., Kasami, T., Fujii, M., & Okui, J. (1980). DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS. SYST COMPUT CONTROLS, 11(1), 18-26.

DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS. / Sugiyama, Yuji; Kasami, Tadao; Fujii, Mamoru; Okui, Jun.

In: SYST COMPUT CONTROLS, Vol. 11, No. 1, 01.1980, p. 18-26.

Research output: Contribution to journalArticle

Sugiyama, Y, Kasami, T, Fujii, M & Okui, J 1980, 'DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS.', SYST COMPUT CONTROLS, vol. 11, no. 1, pp. 18-26.
Sugiyama Y, Kasami T, Fujii M, Okui J. DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS. SYST COMPUT CONTROLS. 1980 Jan;11(1):18-26.
Sugiyama, Yuji ; Kasami, Tadao ; Fujii, Mamoru ; Okui, Jun. / DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS. In: SYST COMPUT CONTROLS. 1980 ; Vol. 11, No. 1. pp. 18-26.
@article{8b66f5612cc14842a79553cf789864e9,
title = "DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS.",
abstract = "The deadlock detection and recovery are studied in a distributed system, where subsystems operate on equal terms without any centralized control and the number of each resource unit is one. In the system, the key is detecting the ″cyclic waiting″ and determining an interruption process, for which an algorithm is provided satisfying the following conditions. (1) Any process should terminate within a finite period; (2) when a process is determined to be interrupted, there should exist a ″cyclic waiting″ including the process; (3) the communication buffer necessary for detection and recovery amounts at most, up to that proportional to the number of processes and resources in the entire system.",
author = "Yuji Sugiyama and Tadao Kasami and Mamoru Fujii and Jun Okui",
year = "1980",
month = "1",
language = "English",
volume = "11",
pages = "18--26",
journal = "Systems, computers, controls",
issn = "0096-8765",
publisher = "Scripta Pub Co.",
number = "1",

}

TY - JOUR

T1 - DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS.

AU - Sugiyama, Yuji

AU - Kasami, Tadao

AU - Fujii, Mamoru

AU - Okui, Jun

PY - 1980/1

Y1 - 1980/1

N2 - The deadlock detection and recovery are studied in a distributed system, where subsystems operate on equal terms without any centralized control and the number of each resource unit is one. In the system, the key is detecting the ″cyclic waiting″ and determining an interruption process, for which an algorithm is provided satisfying the following conditions. (1) Any process should terminate within a finite period; (2) when a process is determined to be interrupted, there should exist a ″cyclic waiting″ including the process; (3) the communication buffer necessary for detection and recovery amounts at most, up to that proportional to the number of processes and resources in the entire system.

AB - The deadlock detection and recovery are studied in a distributed system, where subsystems operate on equal terms without any centralized control and the number of each resource unit is one. In the system, the key is detecting the ″cyclic waiting″ and determining an interruption process, for which an algorithm is provided satisfying the following conditions. (1) Any process should terminate within a finite period; (2) when a process is determined to be interrupted, there should exist a ″cyclic waiting″ including the process; (3) the communication buffer necessary for detection and recovery amounts at most, up to that proportional to the number of processes and resources in the entire system.

UR - http://www.scopus.com/inward/record.url?scp=0018812326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018812326&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0018812326

VL - 11

SP - 18

EP - 26

JO - Systems, computers, controls

JF - Systems, computers, controls

SN - 0096-8765

IS - 1

ER -