Multi-version memory: software cache management for concurrent B-trees

The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the number of processors sharing the tree is large or the communication delay between processors (or between processors and the global memory for a s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel and Distributed Processing, 2nd IEEE Symposium On S. 650 - 655
Hauptverfasser: Weihl, W.E., Wang, P.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE Comput. Soc. Press 1990
Schlagworte:
Algorithm design and analysis
Analytical models
Computer science
Contracts
Delay
Laboratories
Memory management
Read-write memory
Technology management
ISBN:0818620870, 9780818620874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the number of processors sharing the tree is large or the communication delay between processors (or between processors and the global memory for a shared-memory system) is large relative to the speed of local computation. The basis of the algorithm is an abstraction that is similar to coherent shared memory, but provides a weaker semantics; this abstraction is called multiversion memory. Multi-version memory uses caches but weakens the semantics of ordinary shared memory by allowing process reading data to be given an old version of the data. This semantics is adequate for the non-leaf nodes in the B-tree algorithms presented.< >
AbstractList The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the number of processors sharing the tree is large or the communication delay between processors (or between processors and the global memory for a shared-memory system) is large relative to the speed of local computation. The basis of the algorithm is an abstraction that is similar to coherent shared memory, but provides a weaker semantics; this abstraction is called multiversion memory. Multi-version memory uses caches but weakens the semantics of ordinary shared memory by allowing process reading data to be given an old version of the data. This semantics is adequate for the non-leaf nodes in the B-tree algorithms presented.< >
Author Weihl, W.E.
Wang, P.
Author_xml – sequence: 1
  givenname: W.E.
  surname: Weihl
  fullname: Weihl, W.E.
  organization: Lab. for Comput. Sci., MIT, Cambridge, MA, USA
– sequence: 2
  givenname: P.
  surname: Wang
  fullname: Wang, P.
  organization: Lab. for Comput. Sci., MIT, Cambridge, MA, USA
BookMark eNotj8FKAzEURQMqaGv34io_MDWvkxkTd1qtFlos2H15ffOiI51EklTp3ztS7-ZyzuLCHYhTHzwLcQVqDKDszdvqcTUGa3vUZT2BEzFQBkw9UeZWnYtRSp-qT1X1Sl-I2XK_y23xzTG1wcuOuxAPdzIFl38wsiSkD5Ydenznjn2WLkRJwdM-xj98KHJkTpfizOEu8ei_h2I9e1pPX4rF6_N8er8oWmNzgWSsa3SNDZVbS4QatbPEWlUlE6NloKphqjUgsAbrKl1Do51qtsqRKYfi-jjbMvPmK7YdxsPmeLT8BbEqTPQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1990.143621
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 655
ExternalDocumentID 143621
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-ac89fd46adc3b9cca4a4f9ce4053ecea9e1c5dec641a1e419f5461d4f0db0fc83
IEDL.DBID RIE
ISBN 0818620870
9780818620874
IngestDate Tue Aug 26 17:03:07 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-ac89fd46adc3b9cca4a4f9ce4053ecea9e1c5dec641a1e419f5461d4f0db0fc83
PageCount 6
ParticipantIDs ieee_primary_143621
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Parallel and Distributed Processing, 2nd IEEE Symposium On
PublicationTitleAbbrev SPDP
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558624
Score 1.2254723
Snippet The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the...
SourceID ieee
SourceType Publisher
StartPage 650
SubjectTerms Algorithm design and analysis
Analytical models
Computer science
Contracts
Delay
Laboratories
Memory management
Read-write memory
Technology management
Title Multi-version memory: software cache management for concurrent B-trees
URI https://ieeexplore.ieee.org/document/143621
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYmAqlCLe8sBqGjd2YjPyqJiqSHToVjnni9ShLeoL8e85O2kREgub7SGy7pLc8_uOsft-H0pVJZXw5I0KBd4JayhwDUU0b9GViVNx2EQ-HJrx2BYNz3bEwiBibD7Dh7CMtXy_gE1IlfXItmcBNH6Y51kN1dqnUxKtA9QhMjxKWiX0Hjb8Oru92lUpE9t7L16KANSjbXzmr9kq0bQM2v-61Anr_kD0eLE3PqfsAOcd1t7NaODNJ3vGBhFhK7Z1WozPQmPt1yNf0d_30y2RQyB05rN9EwwnJ5ZTjAw1bxN_EqFsveqy0eB19PwmmtkJYmrsWjgwtvIqcx7S0pKWlFOVBST3LEVAZ1GC9giZkk6ikrbSKpOetObLpAKTnrPWfDHHC8bz0mmrHMVJKSrSntEmdaDyfiWVLqW7ZJ0glMlHzY4xqeVx9efpNTsOQq9TGDestV5u8JYdwXY9XS3voka_AYnkoAk
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFLVQQYKpUIp444HVNE6uU5uRR1VEqSLRoVvl2DdSh7aoL8TfYztpERILm50hinyS3Oc5l5DbODY5FFHBrPNGGRirmZIucPVFNKtQ55GGMGyi3e_L4VBllc524MIgYmg-wzu_DLV8OzMrnyprOdueetL4rgCIo5KstU2oREJ4skPQeORuFbk3sVLY2exhU6eMVOs9e8o8Vc9tw11_TVcJxqVT_9djHZLmD0mPZlvzc0R2cNog9c2UBlp9tMekEzi2bF0mxujEt9Z-3dOF-_9-6jlS4yWd6WTbBkOdG0tdlGxK5Sb6wHzhetEkg87z4LHLqukJbCzVkmkjVWEh1dYkuXI4gYZCGXQOWoIGtUJuhEWTAtccgatCQMqtw83mUWFkckJq09kUTwlt51oo0C5SShAcflLIRBtoxwUHkXN9Rhr-UEYfpT7GqDyP8z-v3pD97uCtN-q99F8vyIEHoExoXJLacr7CK7Jn1svxYn4d0P0GDd2jUA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+2nd+IEEE+Symposium+On&rft.atitle=Multi-version+memory%3A+software+cache+management+for+concurrent+B-trees&rft.au=Weihl%2C+W.E.&rft.au=Wang%2C+P.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620874&rft.spage=650&rft.epage=655&rft_id=info:doi/10.1109%2FSPDP.1990.143621&rft.externalDocID=143621
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/sc.gif&client=summon&freeimage=true