Causal memory: definitions, implementation, and programming

Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Ahamad, Mustaque [verfasserIn] Neiger, Gil Burns, James E. Kohli, Prince Hutto, Phillip W.

Format:	Artikel
Sprache:	Englisch

Erschienen:	1995

Anmerkung:	© Springer-Verlag 1995

Übergeordnetes Werk:	Enthalten in: Distributed computing - Springer-Verlag, 1986, 9(1995), 1 vom: März, Seite 37-49
Übergeordnetes Werk:	volume:9 ; year:1995 ; number:1 ; month:03 ; pages:37-49

Links:	Volltext

DOI / URN:	10.1007/BF01784241

Katalog-ID:	OLC2054807222

Internformat


LEADER	01000caa a22002652 4500
001	OLC2054807222
003	DE-627
005	20230403073023.0
007	tu
008	200819s1995 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/BF01784241 \|2 doi
035			\|a (DE-627)OLC2054807222
035			\|a (DE-He213)BF01784241-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 004 \|q VZ
082	0	4	\|a 620 \|q VZ
100	1		\|a Ahamad, Mustaque \|e verfasserin \|4 aut
245	1	0	\|a Causal memory: definitions, implementation, and programming
264		1	\|c 1995
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
500			\|a © Springer-Verlag 1995
520			\|a Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory.
700	1		\|a Neiger, Gil \|4 aut
700	1		\|a Burns, James E. \|4 aut
700	1		\|a Kohli, Prince \|4 aut
700	1		\|a Hutto, Phillip W. \|4 aut
773	0	8	\|i Enthalten in \|t Distributed computing \|d Springer-Verlag, 1986 \|g 9(1995), 1 vom: März, Seite 37-49 \|w (DE-627)13042885X \|w (DE-600)635600-X \|w (DE-576)01592789X \|x 0178-2770 \|7 nnns
773	1	8	\|g volume:9 \|g year:1995 \|g number:1 \|g month:03 \|g pages:37-49
856	4	1	\|u https://doi.org/10.1007/BF01784241 \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_40
912			\|a GBV_ILN_62
912			\|a GBV_ILN_70
912			\|a GBV_ILN_105
912			\|a GBV_ILN_130
912			\|a GBV_ILN_267
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2016
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4036
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4277
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4310
912			\|a GBV_ILN_4311
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
912			\|a GBV_ILN_4336
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 9 \|j 1995 \|e 1 \|c 03 \|h 37-49

Indexfelder

author_variant	m a ma g n gn j e b je jeb p k pk p w h pw pwh
matchkey_str	article:01782770:1995----::asleoyeiiinipeetto
hierarchy_sort_str	1995
publishDate	1995
allfields	10.1007/BF01784241 doi (DE-627)OLC2054807222 (DE-He213)BF01784241-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Ahamad, Mustaque verfasserin aut Causal memory: definitions, implementation, and programming 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1995 Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. Neiger, Gil aut Burns, James E. aut Kohli, Prince aut Hutto, Phillip W. aut Enthalten in Distributed computing Springer-Verlag, 1986 9(1995), 1 vom: März, Seite 37-49 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:9 year:1995 number:1 month:03 pages:37-49 https://doi.org/10.1007/BF01784241 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 9 1995 1 03 37-49
spelling	10.1007/BF01784241 doi (DE-627)OLC2054807222 (DE-He213)BF01784241-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Ahamad, Mustaque verfasserin aut Causal memory: definitions, implementation, and programming 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1995 Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. Neiger, Gil aut Burns, James E. aut Kohli, Prince aut Hutto, Phillip W. aut Enthalten in Distributed computing Springer-Verlag, 1986 9(1995), 1 vom: März, Seite 37-49 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:9 year:1995 number:1 month:03 pages:37-49 https://doi.org/10.1007/BF01784241 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 9 1995 1 03 37-49
allfields_unstemmed	10.1007/BF01784241 doi (DE-627)OLC2054807222 (DE-He213)BF01784241-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Ahamad, Mustaque verfasserin aut Causal memory: definitions, implementation, and programming 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1995 Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. Neiger, Gil aut Burns, James E. aut Kohli, Prince aut Hutto, Phillip W. aut Enthalten in Distributed computing Springer-Verlag, 1986 9(1995), 1 vom: März, Seite 37-49 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:9 year:1995 number:1 month:03 pages:37-49 https://doi.org/10.1007/BF01784241 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 9 1995 1 03 37-49
allfieldsGer	10.1007/BF01784241 doi (DE-627)OLC2054807222 (DE-He213)BF01784241-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Ahamad, Mustaque verfasserin aut Causal memory: definitions, implementation, and programming 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1995 Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. Neiger, Gil aut Burns, James E. aut Kohli, Prince aut Hutto, Phillip W. aut Enthalten in Distributed computing Springer-Verlag, 1986 9(1995), 1 vom: März, Seite 37-49 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:9 year:1995 number:1 month:03 pages:37-49 https://doi.org/10.1007/BF01784241 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 9 1995 1 03 37-49
allfieldsSound	10.1007/BF01784241 doi (DE-627)OLC2054807222 (DE-He213)BF01784241-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Ahamad, Mustaque verfasserin aut Causal memory: definitions, implementation, and programming 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1995 Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. Neiger, Gil aut Burns, James E. aut Kohli, Prince aut Hutto, Phillip W. aut Enthalten in Distributed computing Springer-Verlag, 1986 9(1995), 1 vom: März, Seite 37-49 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:9 year:1995 number:1 month:03 pages:37-49 https://doi.org/10.1007/BF01784241 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 9 1995 1 03 37-49
language	English
source	Enthalten in Distributed computing 9(1995), 1 vom: März, Seite 37-49 volume:9 year:1995 number:1 month:03 pages:37-49
sourceStr	Enthalten in Distributed computing 9(1995), 1 vom: März, Seite 37-49 volume:9 year:1995 number:1 month:03 pages:37-49
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	004
isfreeaccess_bool	false
container_title	Distributed computing
authorswithroles_txt_mv	Ahamad, Mustaque @@aut@@ Neiger, Gil @@aut@@ Burns, James E. @@aut@@ Kohli, Prince @@aut@@ Hutto, Phillip W. @@aut@@
publishDateDaySort_date	1995-03-01T00:00:00Z
hierarchy_top_id	13042885X
dewey-sort	14
id	OLC2054807222
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054807222</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073023.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1995 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01784241</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054807222</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01784241-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ahamad, Mustaque</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Causal memory: definitions, implementation, and programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1995</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 1995</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Neiger, Gil</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Burns, James E.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kohli, Prince</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hutto, Phillip W.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">9(1995), 1 vom: März, Seite 37-49</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:1995</subfield><subfield code="g">number:1</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:37-49</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01784241</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">1995</subfield><subfield code="e">1</subfield><subfield code="c">03</subfield><subfield code="h">37-49</subfield></datafield></record></collection>
author	Ahamad, Mustaque
spellingShingle	Ahamad, Mustaque ddc 004 ddc 620 Causal memory: definitions, implementation, and programming
authorStr	Ahamad, Mustaque
ppnlink_with_tag_str_mv	@@773@@(DE-627)13042885X
format	Article
dewey-ones	004 - Data processing & computer science 620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut aut aut aut aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0178-2770
topic_title	004 VZ 620 VZ Causal memory: definitions, implementation, and programming
topic	ddc 004 ddc 620
topic_unstemmed	ddc 004 ddc 620
topic_browse	ddc 004 ddc 620
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	Distributed computing
hierarchy_parent_id	13042885X
dewey-tens	000 - Computer science, knowledge & systems 620 - Engineering
hierarchy_top_title	Distributed computing
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)13042885X (DE-600)635600-X (DE-576)01592789X
title	Causal memory: definitions, implementation, and programming
ctrlnum	(DE-627)OLC2054807222 (DE-He213)BF01784241-p
title_full	Causal memory: definitions, implementation, and programming
author_sort	Ahamad, Mustaque
journal	Distributed computing
journalStr	Distributed computing
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works 600 - Technology
recordtype	marc
publishDateSort	1995
contenttype_str_mv	txt
container_start_page	37
author_browse	Ahamad, Mustaque Neiger, Gil Burns, James E. Kohli, Prince Hutto, Phillip W.
container_volume	9
class	004 VZ 620 VZ
format_se	Aufsätze
author-letter	Ahamad, Mustaque
doi_str_mv	10.1007/BF01784241
dewey-full	004 620
title_sort	causal memory: definitions, implementation, and programming
title_auth	Causal memory: definitions, implementation, and programming
abstract	Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. © Springer-Verlag 1995
abstractGer	Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. © Springer-Verlag 1995
abstract_unstemmed	Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory. © Springer-Verlag 1995
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700
container_issue	1
title_short	Causal memory: definitions, implementation, and programming
url	https://doi.org/10.1007/BF01784241
remote_bool	false
author2	Neiger, Gil Burns, James E. Kohli, Prince Hutto, Phillip W.
author2Str	Neiger, Gil Burns, James E. Kohli, Prince Hutto, Phillip W.
ppnlink	13042885X
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/BF01784241
up_date	2024-07-04T00:27:44.398Z
_version_	1803606152344240128
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054807222</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073023.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1995 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01784241</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054807222</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01784241-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ahamad, Mustaque</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Causal memory: definitions, implementation, and programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1995</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 1995</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Summary The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by definingcausal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that arecausally related. Because causal memory isweakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Neiger, Gil</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Burns, James E.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kohli, Prince</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hutto, Phillip W.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">9(1995), 1 vom: März, Seite 37-49</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:1995</subfield><subfield code="g">number:1</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:37-49</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01784241</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">1995</subfield><subfield code="e">1</subfield><subfield code="c">03</subfield><subfield code="h">37-49</subfield></datafield></record></collection>
score	7.3974905

Nicht das Richtige dabei?

Schreiben Sie uns!

Causal memory: definitions, implementation, and programming

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?