Verify CAP Theorem Based on Numerical Simulation and Discuss the Requirement for a Distributed System
-
- Atushi Ogata
- Graduate School of Engineering and Science, Shibaura Institute of Technology
-
- Masaomi Kimura
- Department of Information Science and Engineering, Shibaura Institute of Technology
Bibliographic Information
- Other Title
-
- 数値的なシミュレーションを用いたCAP定理の検証と対応する分散システムの条件の検討
Search this article
Description
CAP theorem proposed by Eric A. Brewer in 2000. CAP theorem tells that it is impossible for a distributed system to concurrently have the following three properties: consistency, availability, and partition-tolerance. In 2002, Seth Gilbert and Nancy Lynch proved this theorem. However, in their proof. they assumed as system always guarantee availability. Namely, they did not discuss that every distributed system held CAP theorem. Moreover, in many other studies, three properties were not given a clear definition and were discussed ambiguously. In this study, we gave these three properties mathematical definitions based on an adjacency matrix. Based on this, we conducted a simulation to verify whether CAP theorem holds in every distributed system. Finally, we discuss the requirement of a distributed system that satisfy CA, AP or CP.
Journal
-
- IPSJ SIG Notes
-
IPSJ SIG Notes 2013 (7), 1-6, 2013-11-19
Information Processing Society of Japan (IPSJ)
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1572543027745543808
-
- NII Article ID
- 110009632326
-
- NII Book ID
- AN10112482
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles