• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1992 Fiscal Year Final Research Report Summary

Distributed algorithms for database management, control and recovery

Research Project

Project/Area Number 03044080
Research Category

Grant-in-Aid for international Scientific Research

Allocation TypeSingle-year Grants
SectionJoint Research
Research InstitutionKyoto University

Principal Investigator

IBARAKI Toshihide  Kyoto University. Professor, 工学部, 教授 (50026192)

Co-Investigator(Kenkyū-buntansha) YVES CRAMA  University of Limburg, 経済学部, 準教授
ALEXANDER V.  ロシア科学院, システム研究所, 上級研究員
ART LIESTMAN  Simon Fraser University, 計算科学部, 教授
SLOWOMIR PIL  Simon Fraser University, 計算科学部, 教授
TIKO KAMEDA  Simon Fraser University, 計算科学部, 教授
YAMASHITA Masahumi  Hiroshima University. Professor, 工学部, 教授 (00135419)
KATOH Naoki  Kobe University of Commerce. Professor, 管理科学部, 教授 (40145826)
OHNISHI Masamitsu  Tohoku University. Associate Professor, 経済学部, 助教授 (10160566)
NAGAMOCHI Hiroshi  Kyoto University. Assistant Professor, 工学部, 助手 (70202231)
FUKUSHIMA Masao  Kyoto University. associate Professor, 工学部, 助教授 (30089114)
KARZANOV Alexander V.  Russian Academy of Science, system Institute. Senior Researcher
LIESTMAN Art  Simon Fraser University. professor
HELL Pavol  Simon Fraser University. Professor
PILARSKI Slowomir  Simon Fraser University. Assistant Professor
KAMEDA Tiko  Simon Fraser University. Professor
CRAMA Yves  University of Limburg. Associate Professor
Project Period (FY) 1991 – 1992
KeywordsDistributed databases / Distributed algorithms / Coteries / Graphs and networks / Minimum cut / Concurrency control / Nonlinear optimization
Research Abstract

In these two years of this joint reseatch, we could invite Professor Kmeda (twice) and Professor Pilarski from Canada, and Professor karzanov from Russia, and could send Professor Ibaraki (three times), Dr. Nagamochi and Dr.Ohnishi to Canada. The following is a list of the main results of this study on "Distributed algorithms for database management, control and recovery.
1. Study of coteries as a mutual exclusion mechanism of distributes systems. First, it was pointed out that mathematical properties of coteries can be lucidly described by using the concept of Boolean functions, particularly by the concept of dual minority and self-duality. Based on this, structure of an optimal coterie in the sense of maximizing the availability was clarified for the ring and related newtworks. An efficient algorithm to compute such coteries was also proposed.
2. Study on the concurrency control of database systems. For the cautious scheduler, which had been proposed by our group, an new algorithm was proposed to improve its concurrency. Its mathematical properties were also discussed.
3. Study on the connectivity of graph and networks. When distributed systems are represented at networks, its connectivity (i.e., minimum cut) is an important measure of its capacity and reliability. We proposed a new algorithm, which is different from the existing ones in the sense of not relying on the maximum flow algorithms, and proved that it is faster than any known algorithm.
4. Study on nonlinear optimization. The problem of optimal distributed systems becomes that of nonlinear optimization if we take into account the nonlinearity of system components. For this purpose, we study nonlinear optimization algorithms, and proposed in this period a new descent algorithm for the problem of variational inequalities, which is a generalization of a nonlinear optimization problem.

  • Research Products

    (11 results)

All Other

All Publications (11 results)

  • [Publications] T.LBARAKI,T.KAMEDA: "A theory coteries:Mutuae exclusion in distrbuted systems" IEEE Trams.Parallel and Distributed Systems.

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] N.KATOH,T.LBARAKI,T.KAMEDA: "A muetivesion cautious scheduler with dynamic serialization constraints for database concurrency control" Discrete Applied Mathematics. 40. 379-395 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.LBARAKI,H.NAGAMOCHI,T.KAMEDA: "Optimae coteries for rings and relared networks" Proc.12th Internarional Conference on Distributed Computing. 12. 650-656 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] H.NAGAMOCHI,T.LBARAKI: "A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph" Algorithmica. 7. 583-596 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] H.NAGAMOCHI,T.LBARAKI: "Computinhg edge-connectivity in multiple and capcitated graphs" SIAM J.on Discrete Mathematics. 5. 54-66 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] M.FUKUSHIMA: "Eguivalent differentiae optimization problems and descent methods for asymmetric variationae ineguality problems" Mathematicae Programming. 53. 99-110 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Ibataki, T.Kameda: "A theory of coteries : Mutual exclusion in distributed systems" IEEE Trans. Parallel and Distributed Systems.

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] N.Katoh, T.Ibaraki, T.Kameda: "A multiversion cautious scheduler with dynamic serialization constraints for database concurrency" Discrete Applied Mathematics. 40. 379-395 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Ibaraki, T.Nagamochi and T.Kameda: "Optimal coteries for rings and related networks" Proc. 12th International Conference on Distributed Computing Systems' (ICDCS). 12. 650-656 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H.Nagamochi and T.Ibaraki: "A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph" Algorithmica. 7. 583-596 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H.Nagamochi and T.Ibaraki: "Computing edge-connectivity in multiple and capacitated graphs" SIAM J. on Discrete Mathematics. 5. 54-66 (1992)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1994-03-24  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi