Concurrent Treaps and Impact of Locking Objects

We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechani...

Full description

Saved in:

Bibliographic Details
Published in:	New generation computing Vol. 38; no. 1; pp. 187 - 212
Main Authors:	Alapati, Praveen, Mutyam, Madhu, Saranam, Swamy
Format:	Journal Article
Language:	English
Published:	Tokyo Ohmsha 01.03.2020 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Computer Hardware Computer Science Computer Systems Organization and Communication Networks Data structures Locking Nodes Software Engineering/Programming and Operating Systems Synchronism Trees Treaps Concurrent data structures Locking objects Concurrency
ISSN:	0288-3635, 1882-7055
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechanism along with logical ordering and physical ordering of nodes’ keys. We initially study the throughput and performance-per-Watt (PPW) of our concurrent treap implementation and observe that it scales well, and performs better than the state-of-the-art implementations. We further continue studies to understand the impact of different locking objects on both throughput and PPW. Our experiments show that a concurrent treap implementation that uses AtomicInteger as the locking object provides better throughput and PPW, at the same time uses a low memory footprint. As part of the application study, we consider concurrent interval trees by choosing different underlying concurrent search tree implementations as the base. We observe that the concurrent interval tree implementation that uses concurrent treap as an underlying data structure provides better throughput.
AbstractList	We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechanism along with logical ordering and physical ordering of nodes’ keys. We initially study the throughput and performance-per-Watt (PPW) of our concurrent treap implementation and observe that it scales well, and performs better than the state-of-the-art implementations. We further continue studies to understand the impact of different locking objects on both throughput and PPW. Our experiments show that a concurrent treap implementation that uses AtomicInteger as the locking object provides better throughput and PPW, at the same time uses a low memory footprint. As part of the application study, we consider concurrent interval trees by choosing different underlying concurrent search tree implementations as the base. We observe that the concurrent interval tree implementation that uses concurrent treap as an underlying data structure provides better throughput. We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechanism along with logical ordering and physical ordering of nodes’ keys. We initially study the throughput and performance-per-Watt (PPW) of our concurrent treap implementation and observe that it scales well, and performs better than the state-of-the-art implementations. We further continue studies to understand the impact of different locking objects on both throughput and PPW. Our experiments show that a concurrent treap implementation that uses AtomicInteger as the locking object provides better throughput and PPW, at the same time uses a low memory footprint. As part of the application study, we consider concurrent interval trees by choosing different underlying concurrent search tree implementations as the base. We observe that the concurrent interval tree implementation that uses concurrent treap as an underlying data structure provides better throughput.
Author	Saranam, Swamy Mutyam, Madhu Alapati, Praveen
Author_xml	– sequence: 1 givenname: Praveen orcidid: 0000-0002-6746-3136 surname: Alapati fullname: Alapati, Praveen email: praveena@cse.iitm.ac.in organization: Department of Computer Science and Engineering, Indian Institute of Technology Madras – sequence: 2 givenname: Madhu surname: Mutyam fullname: Mutyam, Madhu organization: Department of Computer Science and Engineering, Indian Institute of Technology Madras – sequence: 3 givenname: Swamy surname: Saranam fullname: Saranam, Swamy organization: Department of Computer Science and Engineering, Indian Institute of Technology Madras
BookMark	eNp9kE1LAzEURYNUsK3-AVcDrqMveZNJZinFj0Khm-5DJk1Kq03GZLqwv97oCO5cPS6cex-cGZmEGBwhtwzuGYB8yAAoagqspVAy0vMFmTKlOJUgxIRMgStFsUFxRWY5HwreYM2n5GERgz2l5MJQbZIzfa5M2FbLY2_sUEVfraJ924ddte4Ozg75mlx6857dze-dk83z02bxSlfrl-XicUUtlzDQbSf9tqmldML4GhuOTHFlRC2d955ZyWs0QgAI1zbMF4pJ33ad7zr01uOc3I2zfYofJ5cHfYinFMpHzbEFpmTLsFB8pGyKOSfndZ_2R5M-NQP97UWPXnTxon-86HMp4VjKBQ47l_6m_2l9AcfwZvg
Cites_doi	10.1145/274787.274812 10.1145/78969.78972 10.1007/BF01940876 10.1007/978-3-319-65482-9_63 10.1145/78973.78977 10.1145/1897852.1897873 10.1145/2692916.2555256 10.1109/SFCS.1989.63531 10.1007/978-3-642-40047-6_25 10.1145/1840845.1840883 10.1145/2692916.2555269 10.1145/1837853.1693488 10.1145/1835698.1835736
ContentType	Journal Article
Copyright	Ohmsha, Ltd. and Springer Japan KK, part of Springer Nature 2019 Ohmsha, Ltd. and Springer Japan KK, part of Springer Nature 2019.
Copyright_xml	– notice: Ohmsha, Ltd. and Springer Japan KK, part of Springer Nature 2019 – notice: Ohmsha, Ltd. and Springer Japan KK, part of Springer Nature 2019.
DBID	AAYXX CITATION JQ2
DOI	10.1007/s00354-019-00073-z
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1882-7055
EndPage	212
ExternalDocumentID	10_1007_s00354_019_00073_z
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29N 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 78A 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABEFU ABFTD ABFTV ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACPIV ACUHS ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFFNX AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 EAD EAP EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F IKXTQ ITM IWAJR IZIGR I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KOV LLZTM M4Y MA- MK~ ML~ N2Q N9A NDZJH NF0 NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF0 PT4 PT5 QOK QOS R89 R9I RHV RIG RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XJT YIN YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS JQ2
ID	FETCH-LOGICAL-c270t-db7fd6477e5af436231828a547efff1c7243a55005e961fe5a17f9bbfbb3fcf3
IEDL.DBID	RSV
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000526046300010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0288-3635
IngestDate	Thu Sep 25 00:39:16 EDT 2025 Sat Nov 29 03:59:08 EST 2025 Fri Feb 21 02:34:42 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Trees Treaps Concurrent data structures Locking objects Concurrency
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c270t-db7fd6477e5af436231828a547efff1c7243a55005e961fe5a17f9bbfbb3fcf3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-6746-3136
PQID	2390187913
PQPubID	2043744
PageCount	26
ParticipantIDs	proquest_journals_2390187913 crossref_primary_10_1007_s00354_019_00073_z springer_journals_10_1007_s00354_019_00073_z
PublicationCentury	2000
PublicationDate	2020-03-01
PublicationDateYYYYMMDD	2020-03-01
PublicationDate_xml	– month: 03 year: 2020 text: 2020-03-01 day: 01
PublicationDecade	2020
PublicationPlace	Tokyo
PublicationPlace_xml	– name: Tokyo – name: Heidelberg
PublicationTitle	New generation computing
PublicationTitleAbbrev	New Gener. Comput
PublicationYear	2020
Publisher	Ohmsha Springer Nature B.V
Publisher_xml	– name: Ohmsha – name: Springer Nature B.V
References	Seidel, Aragon (CR23) 1996; 16 Pugh (CR20) 1990; 33 CR19 CR18 CR15 CR14 Herlihy, Shavit (CR12) 2008 CR11 CR10 Liu, Pinto, Liu (CR16) 2015 Afek, Kaplan, Korenfeld, Morrison, Tarjan (CR1) 2014; 27 Herlihy, Wing (CR13) 1990; 12 Shavit (CR24) 2011; 54 CR4 CR3 CR6 CR5 CR8 CR7 CR9 Reitbauer (CR22) 2011 Alapati, Saranam, Mutyam, Alapati (CR2) 2017 CR21 Martínez, Roura (CR17) 1998; 45 Weiss (CR25) 2009 Y Afek (73_CR1) 2014; 27 73_CR18 73_CR19 A Reitbauer (73_CR22) 2011 73_CR10 73_CR11 W Pugh (73_CR20) 1990; 33 73_CR14 MP Herlihy (73_CR12) 2008 73_CR15 73_CR7 73_CR6 73_CR9 73_CR8 73_CR3 R Seidel (73_CR23) 1996; 16 73_CR5 73_CR4 MP Herlihy (73_CR13) 1990; 12 MA Weiss (73_CR25) 2009 P Alapati (73_CR2) 2017 73_CR21 N Shavit (73_CR24) 2011; 54 C Martínez (73_CR17) 1998; 45 K Liu (73_CR16) 2015
References_xml	– ident: CR18 – volume: 45 start-page: 288 issue: 2 year: 1998 end-page: 323 ident: CR17 article-title: Randomized binary search trees publication-title: JACM doi: 10.1145/274787.274812 – year: 2008 ident: CR12 publication-title: The Art of Multiprocessor Programming – start-page: 316 year: 2015 end-page: 331 ident: CR16 publication-title: Data-Oriented Characterization of Application-Level Energy Optimization – ident: CR4 – ident: CR14 – volume: 27 start-page: 393 issue: 6 year: 2014 end-page: 417 ident: CR1 article-title: Cbtree: a practical concurrent self-adjusting search tree publication-title: DISC – year: 2011 ident: CR22 publication-title: Java Enterprise Performance – ident: CR10 – volume: 12 start-page: 463 issue: 3 year: 1990 end-page: 492 ident: CR13 article-title: Linearizability: a correctness condition for concurrent objects publication-title: TOPLAS doi: 10.1145/78969.78972 – ident: CR6 – ident: CR8 – volume: 16 start-page: 464 issue: 4 year: 1996 end-page: 497 ident: CR23 article-title: Randomized search trees publication-title: Algorithmica doi: 10.1007/BF01940876 – ident: CR21 – ident: CR19 – start-page: 776 year: 2017 end-page: 790 ident: CR2 article-title: Concurrent treaps publication-title: Algorithms and Architectures for Parallel Processing doi: 10.1007/978-3-319-65482-9_63 – volume: 33 start-page: 668 issue: 6 year: 1990 end-page: 676 ident: CR20 article-title: Skip lists: a probabilistic alternative to balanced trees publication-title: CACM doi: 10.1145/78973.78977 – ident: CR3 – ident: CR15 – ident: CR11 – ident: CR9 – year: 2009 ident: CR25 publication-title: Data Structures and Algorithm Analysis in C++ – ident: CR5 – ident: CR7 – volume: 54 start-page: 76 issue: 3 year: 2011 end-page: 84 ident: CR24 article-title: Data structures in the multicore age publication-title: CACM doi: 10.1145/1897852.1897873 – ident: 73_CR21 – ident: 73_CR19 – ident: 73_CR18 doi: 10.1145/2692916.2555256 – ident: 73_CR3 doi: 10.1109/SFCS.1989.63531 – ident: 73_CR15 – ident: 73_CR6 doi: 10.1007/978-3-642-40047-6_25 – ident: 73_CR10 – ident: 73_CR7 doi: 10.1145/1840845.1840883 – volume: 33 start-page: 668 issue: 6 year: 1990 ident: 73_CR20 publication-title: CACM doi: 10.1145/78973.78977 – ident: 73_CR14 – volume-title: Data Structures and Algorithm Analysis in C++ year: 2009 ident: 73_CR25 – volume-title: Java Enterprise Performance year: 2011 ident: 73_CR22 – ident: 73_CR8 doi: 10.1145/2692916.2555269 – volume: 27 start-page: 393 issue: 6 year: 2014 ident: 73_CR1 publication-title: DISC – volume: 54 start-page: 76 issue: 3 year: 2011 ident: 73_CR24 publication-title: CACM doi: 10.1145/1897852.1897873 – ident: 73_CR5 – start-page: 776 volume-title: Algorithms and Architectures for Parallel Processing year: 2017 ident: 73_CR2 doi: 10.1007/978-3-319-65482-9_63 – ident: 73_CR4 doi: 10.1145/1837853.1693488 – volume: 45 start-page: 288 issue: 2 year: 1998 ident: 73_CR17 publication-title: JACM doi: 10.1145/274787.274812 – ident: 73_CR11 – volume-title: The Art of Multiprocessor Programming year: 2008 ident: 73_CR12 – start-page: 316 volume-title: Data-Oriented Characterization of Application-Level Energy Optimization year: 2015 ident: 73_CR16 – ident: 73_CR9 doi: 10.1145/1835698.1835736 – volume: 12 start-page: 463 issue: 3 year: 1990 ident: 73_CR13 publication-title: TOPLAS doi: 10.1145/78969.78972 – volume: 16 start-page: 464 issue: 4 year: 1996 ident: 73_CR23 publication-title: Algorithmica doi: 10.1007/BF01940876
SSID	ssj0036342
Score	2.1645467
Snippet	We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	187
SubjectTerms	Algorithms Artificial Intelligence Computer Hardware Computer Science Computer Systems Organization and Communication Networks Data structures Locking Nodes Software Engineering/Programming and Operating Systems Synchronism
Title	Concurrent Treaps and Impact of Locking Objects
URI	https://link.springer.com/article/10.1007/s00354-019-00073-z https://www.proquest.com/docview/2390187913
Volume	38
WOSCitedRecordID	wos000526046300010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLink Core Collection customDbUrl: eissn: 1882-7055 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0036342 issn: 0288-3635 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BYWChPEWhIA9sYJH4EccjqqhAqgqCCnWL4pfEklZNYeivx3GTViAYYIxiOdFn38O---4ALiWnzKqEYi6twYwZgXNLOSZUJ5ZoylweirgOxHCYjsfyqSaFlU22exOSDJp6RXargl5VxoTEIb6EF5uw5c1dWjVseH55bfQvTWhomeMNZ4r9A6-pMj_P8dUcrX3Mb2HRYG367f_95x7s1t4lul1uh33YsMUBtJvODagW5EO46U0KvazMhEbebZyWKC8MegiUSTRxaODVpP8oelTVPU15BKP-3ah3j-vWCVgTEc2xUcKZimNqee6YN1JedEmacyascy7WgjCa-8NJxK1MYudHxcJJpZxS1GlHj6FVTAp7AsgvF3HKJIbyiFkmU--SJSSPLDVSe--tA1cNgNl0WSAjW5VCDlBkHoosQJEtOtBtMM5qYSkzUt27pELGtAPXDabr17_Pdvq34WewQ6rTcsgg60JrPnu357CtP-Zv5ewibKJPUtDAcg
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFH_oFPTi_MTp1By8aXBN0qY5ynBsWKdokd1C0ybgpRvr9LC_3jRrNxQ96LE0pOWXvPd-yfsCuBQ-ZVoFFPtCZ5ixjONEUx8TmgaapJSZxBVxjfhwGI5G4qlKCivqaPfaJek09TLZrXR6lRETAjv_Ep6vwwazFqusmP_88lrrXxpQ1zLHGs4Q2we_SpX5eY6v5mjFMb-5RZ216TX_95-7sFOxS3S72A57sKbzfWjWnRtQJcgHcNMd5-miMhOKLW2cFCjJMzRwKZNobFBk1aT9KHpU5T1NcQhx7y7u9nHVOgGnhHdmOFPcZGWOqfYTw6yRsqJLwsRnXBtjvJQTRhN7OOn4WgSesaM8boRSRilqUkOPoJGPc30MyC4XMSoLMup3mGYitJQsIElH00yklr214KoGUE4WBTLkshSyg0JaKKSDQs5b0K4xlpWwFJKU9y4hFx5twXWN6er177Od_G34BWz144dIRoPh_Slsk_Lk7KLJ2tCYTd_1GWymH7O3YnruNtQnYybDVg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BQYiF8hTl6YENrDa2E8cjKlRUVKUSFeoWJbEtsaRVExj667GdpAUEA2KMbFnWF5_vznffHcCV8ClTSUCxL5TEjEmOY0V9TGgaKJJSpmNXxHXAh8NwMhGjTyx-l-1ehyRLToOt0pQV7ZnU7SXxzQbAbPaEwC7WhBfrsMFsIr31159f6ruYBtS1zzFKNMTmw69oMz-v8VU1rezNbyFSp3l6zf_veRd2KqsT3ZbHZA_WVLYPzbqjA6oE_ADa3WmWlhWb0NiYk7McxZlEfUelRFONBub6NBtAT4l9v8kPYdy7H3cfcNVSAaeEdwosE66l5Z4qP9bMKC8j0iSMfcaV1tpLOWE0Nk5Lx1ci8LSZ5XEtkkQnCdWppkfQyKaZOgZkfiPRiQwk9TtMMREaUy0gcUdRKVJj1bXgugYzmpWFM6JliWQHRWSgiBwU0aIFZzXeUSVEeUTse0zIhUdbcFPjuxr-fbWTv02_hK3RXS8a9IePp7BNrEPtkszOoFHM39Q5bKbvxWs-v3Bn6wPUksw6
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%3Ajournal&rft.genre=article&rft.atitle=Concurrent+Treaps+and+Impact+of+Locking+Objects&rft.jtitle=New+generation+computing&rft.au=Alapati%2C+Praveen&rft.au=Mutyam%2C+Madhu&rft.au=Saranam%2C+Swamy&rft.date=2020-03-01&rft.issn=0288-3635&rft.eissn=1882-7055&rft.volume=38&rft.issue=1&rft.spage=187&rft.epage=212&rft_id=info:doi/10.1007%2Fs00354-019-00073-z&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00354_019_00073_z
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0288-3635&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0288-3635&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0288-3635&client=summon