最終更新日
：2024/08/06
Brewer's theorem
name
(computing
theory)
A
theorem
stating
that
it
is
impossible
for
a
distributed
data
store
to
simultaneously
provide
more
than
two
of
three
guarantees:
consistency
(every
read
receives
the
most
recent
write
or
an
error),
availability
(every
request
receives
a
non-error
response,
without
the
guarantee
that
it
contains
the
most
recent
write),
and
partition
tolerance
(the
system
continues
to
operate
despite
an
arbitrary
number
of
messages
being
dropped
or
delayed
between
nodes).
意味（1）
(computing
theory)
A
theorem
stating
that
it
is
impossible
for
a
distributed
data
store
to
simultaneously
provide
more
than
two
of
three
guarantees:
consistency
(every
read
receives
the
most
recent
write
or
an
error),
availability
(every
request
receives
a
non-error
response,
without
the
guarantee
that
it
contains
the
most
recent
write),
and
partition
tolerance
(the
system
continues
to
operate
despite
an
arbitrary
number
of
messages
being
dropped
or
delayed
between
nodes).
復習用の問題
(computing theory) A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes).
正解を見る
Brewer's theorem
Brewer's theorem is a fundamental result in distributed computing.
正解を見る
Brewer's theorem is a fundamental result in distributed computing.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
