Euler's laws of motion: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
Newer edit →
en>Maschen
 
Line 1: Line 1:
A '''quorum''' is the minimum number of votes that a distributed transaction has to obtain in order to be allowed to perform an operation in a [[distributed system]]. A '''quorum'''-based technique is implemented to enforce consistent operation in a distributed system.


== Quorum-based techniques in distributed database systems ==
Quorum-based voting can be used as a [[Replication (computer science)#Database replication|replica]] control method<ref name="ozsu">
{{cite book |last1= Ozsu
|first1= Tamer M
|last2= Valduriez
|first2= Patrick
|title= Principles of distributed database systems
|edition= 2nd
|isbn = 0-13-691643-0
|year= 1991
|publisher= Prentice-Hall, Inc.
|location= Upper Saddle River, NJ
|chapter= 12
}}</ref>
, as well as a commit method to ensure [[Database transaction|transaction]] [[Atomicity (database systems)|atomicity]] in the presence of [[network partitioning]].<ref name="ozsu"/>


The shorter canoe is a lot easier to control and  gold watches additionally balance piece wing sportfishing. Kayakers must be aware that lower flatwater kayaks obtain brief monitoring capabilities and do not go rapidly too. Though, they can indeed be excellent all those that never prefer to opportunity considerably (further than 3 kilometers). Most of these kayaks are easy to maneuver when compared with much larger flatwater kayaks, the primary factor as part of jig angling.   <br><br> Often the amateur kayakers usually tend not to have pleasure in soar angling from your boat since they just do not possess the skill to be able to poise some of the boat long time day [http://www.youtube.com/watch?v=QrMw2niRTXg fishing kayaks reviews].  Kayaks are typically principally employed for fly day fishing nothing but [http://www.youtube.com/watch?v=YEtPp9RSW4c sit on top kayak reviews] the subject of this type of waters and also ponds where exactly a single craft may be used. Kayaks are extremely welcome, super  [http://www.youtube.com/watch?v=KuXL3BRGMyI Kayak reviews] quick, can help to conserve a great number of energy and allow searching online reef [http://www.youtube.com/watch?v=LV_frKTc-kw fishing kayak Review] segments. <br><br> Each functionality and flexibility which is available from inflatable kayaks obtain allowed plenty of aquatic adventures fans to be able to persue kayaking. Which means that, paddlers can now visit one particular outside sources as well as rivers without getting nervous about the shift related to kayaks. Furthermore, these types of kayaks tend to be stronger and can quickly slide through rocks or perhaps squeeze between them.
=== Quorum-based voting in commit protocols ===
In a distributed database system, a transaction could be executing its operations at multiple sites. Since atomicity requires every distributed transaction to be atomic, the transaction must have the same fate ([[Commit (data management)|commit]] or [[Rollback (data management)|abort]]) at every site. In case of network partitioning, sites are partitioned and the partitions may not be able to communicate with each other. This is where a quorum-based technique comes in. The fundamental idea is that a transaction is executed if the majority of sites vote to execute it.
 
Every site in the system is assigned a vote V<sub>i</sub>. Let us assume that the total number of votes in the system is V and the abort and commit quorums are V<sub>a</sub> and V<sub>c</sub>, respectively. Then the following rules must be obeyed in the implementation of the commit protocol:
# V<sub>a</sub> + V<sub>c</sub> > V, where 0 < V<sub>c</sub>, V<sub>a</sub> <math>\le</math> V.
# Before a transaction commits, it must obtain a commit quorum V<sub>c</sub>.<br/>The total of at least one site that is prepared to commit and zero or more sites waiting <math>\ge</math> V<sub>c</sub>.<ref>{{cite web|last=Skeen|first=Dale|title=A Quorum-based Commit Protocol|url=https://ecommons.library.cornell.edu/handle/1813/6323|publisher=Cornell University ECommons Library|accessdate=10 February 2013}}</ref>
# Before a transaction aborts, it must obtain an abort quorum V<sub>a</sub><br/>The total of zero or more sites that are prepared to abort or any sites waiting <math>\ge</math> V<sub>a</sub>.
 
The first rule ensures that a transaction cannot be committed and aborted at the same time. The next two rules indicate the votes that a transaction has to obtain before it can terminate one way or the other.
 
=== Quorum-based voting for replica control ===
In replicated databases, a data object has copies present at several sites. To ensure [[serializability]], no two transactions should be allowed to read or write a data item concurrently. In case of replicated databases, a quorum-based replica control protocol can be used to ensure that no two copies of a data item are read or written by two transactions concurrently.
 
The quorum-based voting for replica control is due to [Gifford, 1979]<ref>
{{Cite document
| first = David K.
| last = Gifford
| contribution = Weighted voting for replicated data
| title = SOSP '79: Proceedings of the seventh ACM symposium on Operating systems principles
| year = 1979
| pages = 150–162
| place = Pacific Grove, California, United States
| url = http://doi.acm.org/10.1145/800215.806583
| publisher = ACM
| doi = 10.1145/800215.806583
| postscript = <!--None-->
}}</ref>
. Each copy of a replicated data item is assigned a vote. Each operation then has to obtain a ''read quorum'' (V<sub>r</sub>) or a ''write quorum'' (V<sub>w</sub>) to read or write a data item, respectively. If a given data item has a total of V votes, the quorums have to obey the following rules:
# V<sub>r</sub> + V<sub>w</sub> > V
# V<sub>w</sub> > V/2
 
The first rule ensures that a data item is not read and written by two transactions concurrently. The second rule ensures that two write operations from two transactions cannot occur concurrently on the same data item. The two rules ensure that one-copy serializability is maintained.
 
==See also==
* [[CAP theorem]]
* [[Database transaction]]
* [[Replication (computer science)]]
* [[Atomicity (database systems)]]
 
==References==
<references/>
 
<!-- categories -->
[[Category:Database management systems]]
[[Category:Transaction processing]]

Revision as of 04:46, 21 December 2013

A quorum is the minimum number of votes that a distributed transaction has to obtain in order to be allowed to perform an operation in a distributed system. A quorum-based technique is implemented to enforce consistent operation in a distributed system.

Quorum-based techniques in distributed database systems

Quorum-based voting can be used as a replica control method[1] , as well as a commit method to ensure transaction atomicity in the presence of network partitioning.[1]

Quorum-based voting in commit protocols

In a distributed database system, a transaction could be executing its operations at multiple sites. Since atomicity requires every distributed transaction to be atomic, the transaction must have the same fate (commit or abort) at every site. In case of network partitioning, sites are partitioned and the partitions may not be able to communicate with each other. This is where a quorum-based technique comes in. The fundamental idea is that a transaction is executed if the majority of sites vote to execute it.

Every site in the system is assigned a vote Vi. Let us assume that the total number of votes in the system is V and the abort and commit quorums are Va and Vc, respectively. Then the following rules must be obeyed in the implementation of the commit protocol:

  1. Va + Vc > V, where 0 < Vc, Va ≤ V.
  2. Before a transaction commits, it must obtain a commit quorum Vc.
    The total of at least one site that is prepared to commit and zero or more sites waiting ≥ Vc.[2]
  3. Before a transaction aborts, it must obtain an abort quorum Va
    The total of zero or more sites that are prepared to abort or any sites waiting ≥ Va.

The first rule ensures that a transaction cannot be committed and aborted at the same time. The next two rules indicate the votes that a transaction has to obtain before it can terminate one way or the other.

Quorum-based voting for replica control

In replicated databases, a data object has copies present at several sites. To ensure serializability, no two transactions should be allowed to read or write a data item concurrently. In case of replicated databases, a quorum-based replica control protocol can be used to ensure that no two copies of a data item are read or written by two transactions concurrently.

The quorum-based voting for replica control is due to [Gifford, 1979][3] . Each copy of a replicated data item is assigned a vote. Each operation then has to obtain a read quorum (Vr) or a write quorum (Vw) to read or write a data item, respectively. If a given data item has a total of V votes, the quorums have to obey the following rules:

  1. Vr + Vw > V
  2. Vw > V/2

The first rule ensures that a data item is not read and written by two transactions concurrently. The second rule ensures that two write operations from two transactions cannot occur concurrently on the same data item. The two rules ensure that one-copy serializability is maintained.

See also

References

  1. ↑ 1.0 1.1 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  2. ↑ Template:Cite web
  3. ↑ Template:Cite document
Retrieved from "https://en.formulasearchengine.com/index.php?title=Euler%27s_laws_of_motion&oldid=23922"