Transposable integer: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search

163.1.70.21 (talk)

en>MSGJ
remove template designed for talk page
 
No edit summary
 
Line 1: Line 1:
Black Power<br><br>In the history of African Americans in this country, there have been some tremendous movements and images that seem to capture the mood of the country and the black community at that time. And this one phrase "black power" is without a doubt one of the most simple and elegant statements of pride and unity in the black community.  But it was also a phrase that came to represent the more violent and objectionable side of the struggle for equality in the black community. And that makes it a controversial phrase then and now.<br><br>Probably the greatest image of black power is the strong hand of a black man, clenched in a black glove and raised in the air in defiance and pride. Never has that salute been used so perfectly as it was at the 1968 Olympics when Tommy Smith and John  [http://tinyurl.com/ku6vjks ugg boots usa] Carlos raised the black power fist complete with black glove as they received their medals for their performances at those Olympic Games.<br><br>The phrase "black power" was not coined in a march or riot as might be implied.  It was actually created by Robert Williams, the head of the NAACP in the early sixties. But it really started becoming a "street term" when it was adopted by Makasa Dada and Stokely Carmichael, founders of The Student Nonviolent Coordinating Committee which was the precursor to the famous Black Panther Party.<br><br>Sadly the black power movement became characterized by radical elements that went much further than seeking the goals of Martin Luther King and the rest of the civil rights movement's leadership. These radical elements sought black separation and social change by violent means.  And so in a time when there was tremendous turmoil in the country because of the violence in Vietnam and on the streets of America because of that social strife, The Black Panthers and other fringe groups sewed fear  [http://tinyurl.com/ku6vjks http://tinyurl.com/ku6vjks] and hatred in response to racism which at times made it more difficult to achieve long lasting change.<br><br>But there is good to be seen even in some of the darker elements of black history and the leadership who looked to find the best way forward for African Americans.  Sometimes it is necessary for the radical  [http://tinyurl.com/ku6vjks http://tinyurl.com/ku6vjks] elements to make themselves known so reasonable members of a community can know the outer limits and find compromise. This was a value to the black power [http://www.reddit.com/r/howto/search?q=movement movement] because it did charge the discussion, albeit with violence and made the importance of reasonable Americans to come together to seek peaceful change all the more important.<br><br>But there is another good that came from the black power movement. Those images of the raised fist were images of a pride and a willingness to stand up for the rights of black Americans.  They inspired a generation of young people to become more politically active, to stand up in their own world and make that statement made famous by James Brown "Say it Loud. I'm Black and I'm Proud."  That pride is an important thing and for young people to find. They have to find it in their communities and in their heroes.   [http://tinyurl.com/ku6vjks ugg boots usa] So if black youth took pride and courage to face their own circumstances from the bold stance of leaders who, albeit radically, said loud that black America was now going to be a force to be reckoned with, the resultant call to action to the black community produced many more positive effects than negative ones. The fringe voice does speak what is in people's hearts and by getting that anger and frustration out, it became part of the movement.  That energy could be captured and used for good instead of evil. And the end result was a movement that was energized for change and to make life better for all of black America. And that was what everybody wanted.<br><br>PPPPP 643arvinoor<br>arvinoor siregar<br>arvinoor siregar  [http://tinyurl.com/ku6vjks ugg boots] sh.<br>arvinoor siregar sh.mh.
A '''version vector''' is a mechanism for tracking changes to data in a [[distributed system]], where multiple agents might update the data at different times. The version vector allows the participants to determine if one update preceded another ([[happened-before]]), followed it, or if the two updates happened concurrently (and therefore might conflict with each other). In this way, version vectors enable [[causality]] tracking among data replicas and are a basic mechanism for [[optimistic replication]].  In mathematical terms, the version vector generates a [[preorder]] that tracks the events that precede, and may therefore influence, later updates.
 
Version vectors maintain state identical to that in a [[vector clock]], but the update rules differ slightly;  in this example, replicas can either experience local updates (e.g., the user editing a file on the local node), or can synchronize with another replica:
 
* Initially all vector counters are zero.
* Each time a replica experiences a local update event, it increments its own counter in the vector by one.
* Each time two replicas <math>a</math> and <math>b</math> synchronize, they both set the elements in their copy of the vector to the maximum of the element across both counters: <math>V_a[x] = V_b[x] = max(V_a[x], V_b[x])</math>.  After synchronization, the two replicas have identical version vectors.
 
Pairs of replicas, <math>a</math>, <math>b</math>, can be compared by inspecting their version vectors and determined to be either: identical (<math>a=b</math>), concurrent (<math>a \parallel b</math>), or ordered (<math>a < b</math> or <math>b < a</math>). The ordered relation is defined as:  Vector <math>a < b</math> if and only if every element of <math>V_a</math> is less than or equal to its corresponding element in <math>V_b</math>, and at least one of the elements is strictly less than.  If neither <math>a < b</math> or <math>b < a</math>, but the vectors are not identical, then the two vectors must be concurrent.
 
Version vectors<ref>Douglas Parker, Gerald Popek, Gerard Rudisin, Allen Stoughton, Bruce Walker, Evelyn Walton, Johanna Chow, David Edwards, Stephen Kiser, and [[Charles S. Kline|Charles Kline]]. Detection of mutual inconsistency in distributed systems. Transactions on Software Engineering. 1983</ref> or variants are used to track updates in many distributed file systems, such as [[Coda (file system)]] and Ficus, and are the main data structure behind optimistic replication.<ref>David Ratner, Peter Reiher, and Gerald Popek. Dynamic version vector maintenance. Technical Report CSD-970022, Department of Computer Science, University of California, Los Angeles, 1997</ref>
 
==Other Mechanisms==
 
* Hash Histories <ref>ByungHoon Kang, Robert Wilensky, and John Kubiatowicz.
The Hash History Approach for Reconciling Mutual Inconsistency.
ICDCS, pp. 670-677, IEEE Computer Society, 2003.</ref> avoid the use of counters by keeping a set of hashes of each updated version and comparing those sets by set inclusion. However this mechanism can only give probabilistic guarantees.
* Concise Version Vectors <ref>Dalia Malkhi and Doug Terry. Concise Version Vectors in WinFS.Distributed Computing, Vol. 20, 2007.</ref> allow significant space savings when handling multiple replicated items, such as in directory structures in filesystems.
* Version Stamps <ref>Paulo Almeida, Carlos Baquero and Victor Fonte. Version Stamps: Decentralized Version Vectors. ICDCS, pp. 544-551, 2002.</ref> allow tracking of a variable number of replicas and do not resort to counters. This mechanism can depict scalability problems in some settings, but can be replaced by Interval Tree Clocks.
* Interval Tree Clocks<ref>Paulo Almeida, Carlos Baquero and Victor Fonte. Interval Tree Clocks. OPODIS, Lecture Notes in Computer Science, Vol. 5401, pp. 259-274, Springer, 2008.</ref> generalize version vectors and vector clocks and allows dynamic numbers of replicas/processes.
* Bounded Version Vectors <ref>José Almeida, Paulo Almeida and Carlos Baquero. Bounded Version Vectors. DISC: International Symposium on Distributed Computing, LNCS, 2004.</ref> allow a bounded implementation, with bounded size counters, as long as replica pairs can be atomically synchronized.
* Dotted Version Vectors <ref>Nuno Preguiça, Carlos Baquero, Paulo Almeida, Victor Fonte and Ricardo Gonçalves. Brief Announcement: Efficient Causality Tracking in Distributed Storage Systems With Dotted Version Vectors. ACM PODC, pp. 335-336, 2012.</ref> address scalability with a small set of servers mediating replica access by a large number of concurrent clients.
 
==References==
{{reflist}}
 
[[Category:Data synchronization]]
[[Category:Distributed computing problems]]
[[Category:Causality]]

Latest revision as of 14:02, 24 June 2013

A version vector is a mechanism for tracking changes to data in a distributed system, where multiple agents might update the data at different times. The version vector allows the participants to determine if one update preceded another (happened-before), followed it, or if the two updates happened concurrently (and therefore might conflict with each other). In this way, version vectors enable causality tracking among data replicas and are a basic mechanism for optimistic replication. In mathematical terms, the version vector generates a preorder that tracks the events that precede, and may therefore influence, later updates.

Version vectors maintain state identical to that in a vector clock, but the update rules differ slightly; in this example, replicas can either experience local updates (e.g., the user editing a file on the local node), or can synchronize with another replica:

  • Initially all vector counters are zero.
  • Each time a replica experiences a local update event, it increments its own counter in the vector by one.
  • Each time two replicas a and b synchronize, they both set the elements in their copy of the vector to the maximum of the element across both counters: Va[x]=Vb[x]=max(Va[x],Vb[x]). After synchronization, the two replicas have identical version vectors.

Pairs of replicas, a, b, can be compared by inspecting their version vectors and determined to be either: identical (a=b), concurrent (a∥b), or ordered (a<b or b<a). The ordered relation is defined as: Vector a<b if and only if every element of Va is less than or equal to its corresponding element in Vb, and at least one of the elements is strictly less than. If neither a<b or b<a, but the vectors are not identical, then the two vectors must be concurrent.

Version vectors[1] or variants are used to track updates in many distributed file systems, such as Coda (file system) and Ficus, and are the main data structure behind optimistic replication.[2]

Other Mechanisms

  • Hash Histories [3] avoid the use of counters by keeping a set of hashes of each updated version and comparing those sets by set inclusion. However this mechanism can only give probabilistic guarantees.
  • Concise Version Vectors [4] allow significant space savings when handling multiple replicated items, such as in directory structures in filesystems.
  • Version Stamps [5] allow tracking of a variable number of replicas and do not resort to counters. This mechanism can depict scalability problems in some settings, but can be replaced by Interval Tree Clocks.
  • Interval Tree Clocks[6] generalize version vectors and vector clocks and allows dynamic numbers of replicas/processes.
  • Bounded Version Vectors [7] allow a bounded implementation, with bounded size counters, as long as replica pairs can be atomically synchronized.
  • Dotted Version Vectors [8] address scalability with a small set of servers mediating replica access by a large number of concurrent clients.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. ↑ Douglas Parker, Gerald Popek, Gerard Rudisin, Allen Stoughton, Bruce Walker, Evelyn Walton, Johanna Chow, David Edwards, Stephen Kiser, and Charles Kline. Detection of mutual inconsistency in distributed systems. Transactions on Software Engineering. 1983
  2. ↑ David Ratner, Peter Reiher, and Gerald Popek. Dynamic version vector maintenance. Technical Report CSD-970022, Department of Computer Science, University of California, Los Angeles, 1997
  3. ↑ ByungHoon Kang, Robert Wilensky, and John Kubiatowicz. The Hash History Approach for Reconciling Mutual Inconsistency. ICDCS, pp. 670-677, IEEE Computer Society, 2003.
  4. ↑ Dalia Malkhi and Doug Terry. Concise Version Vectors in WinFS.Distributed Computing, Vol. 20, 2007.
  5. ↑ Paulo Almeida, Carlos Baquero and Victor Fonte. Version Stamps: Decentralized Version Vectors. ICDCS, pp. 544-551, 2002.
  6. ↑ Paulo Almeida, Carlos Baquero and Victor Fonte. Interval Tree Clocks. OPODIS, Lecture Notes in Computer Science, Vol. 5401, pp. 259-274, Springer, 2008.
  7. ↑ José Almeida, Paulo Almeida and Carlos Baquero. Bounded Version Vectors. DISC: International Symposium on Distributed Computing, LNCS, 2004.
  8. ↑ Nuno Preguiça, Carlos Baquero, Paulo Almeida, Victor Fonte and Ricardo Gonçalves. Brief Announcement: Efficient Causality Tracking in Distributed Storage Systems With Dotted Version Vectors. ACM PODC, pp. 335-336, 2012.
Retrieved from "https://en.formulasearchengine.com/w/index.php?title=Transposable_integer&oldid=24672"