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

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
SLOWOMIR Pil  Simon Fraser大学, 情報学部, 助教授
ART Liestman  Simon Fraser大学, 情報学部, 準教授
POVOL Hell  Simon Fraser大学, 情報学部, 教授
TIKO Kameda  Simon Fraser大学, 情報学部, 教授
Project Period (FY) 1991 – 1992
Project Status Completed (Fiscal Year 1992)
Budget Amount *help
¥6,000,000 (Direct Cost: ¥6,000,000)
Fiscal Year 1992: ¥3,000,000 (Direct Cost: ¥3,000,000)
Fiscal Year 1991: ¥3,000,000 (Direct Cost: ¥3,000,000)
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.

Report

(2 results)
  • 1992 Final Research Report Summary
  • 1991 Annual Research Report
  • Research Products

    (14 results)

All Other

All Publications (14 results)

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

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

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

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

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1992 Final Research Report Summary
  • [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
      「研究成果報告書概要(欧文)」より
    • Related Report
      1992 Final Research Report Summary
  • [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
      「研究成果報告書概要(欧文)」より
    • Related Report
      1992 Final Research Report Summary
  • [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
      「研究成果報告書概要(欧文)」より
    • Related Report
      1992 Final Research Report Summary
  • [Publications] H.Nagamochi and T.Ibaraki: "Computing edge-connectivity in multiple and capacitated graphs" SIAM J. on Discrete Mathematics. 5. 54-66 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1992 Final Research Report Summary
  • [Publications] 茨木 俊彦,T.Kameda: "Boolean Theory of Coteries" Proceedings of Third IEEE Symopsium on Parallel and Distributed Processing. Vol.3. 150-157 (1991)

    • Related Report
      1991 Annual Research Report
  • [Publications] 永持 仁,茨木 俊秀: "A Linear Time Algorithm for Computing 3ーEdgeーConnected Components in a Multigraph" Japan Journal of Industrial and Applied Mathematics. Vol.9. (1992)

    • Related Report
      1991 Annual Research Report
  • [Publications] 茨木 俊秀,T.Kameda: "Theory of Coteries" IEEE Transations on Parallel and Distributed Computing.

    • Related Report
      1991 Annual Research Report

URL: 

Published: 1991-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi