Contention-sensitive data structures and algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in common cases, when there is no contention, or when processes with non-interfering operations access it concurrently. When a process invokes an operation on a contention-s...
Saved in:
| Published in: | Theoretical computer science Vol. 677; pp. 41 - 55 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
16.05.2017
|
| Subjects: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in common cases, when there is no contention, or when processes with non-interfering operations access it concurrently. When a process invokes an operation on a contention-sensitive data structure, in the absence of contention or interference, the process must be able to complete its operation in a small number of steps and without using locks. Using locks is permitted only when there is interference. We formally define the notion of contention-sensitive data structures, propose four general transformations that facilitate devising such data structures, and illustrate the benefits of the approach by implementing a contention-sensitive consensus algorithm, a contention-sensitive double-ended queue data structure, and a contention-sensitive election algorithm. |
|---|---|
| AbstractList | A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in common cases, when there is no contention, or when processes with non-interfering operations access it concurrently. When a process invokes an operation on a contention-sensitive data structure, in the absence of contention or interference, the process must be able to complete its operation in a small number of steps and without using locks. Using locks is permitted only when there is interference. We formally define the notion of contention-sensitive data structures, propose four general transformations that facilitate devising such data structures, and illustrate the benefits of the approach by implementing a contention-sensitive consensus algorithm, a contention-sensitive double-ended queue data structure, and a contention-sensitive election algorithm. |
| Author | Taubenfeld, Gadi |
| Author_xml | – sequence: 1 givenname: Gadi surname: Taubenfeld fullname: Taubenfeld, Gadi email: tgadi@idc.ac.il organization: The Interdisciplinary Center, P.O.Box 167, Herzliya 46150, Israel |
| BookMark | eNp9j81qwzAQBkVJoUnaB-jNL2B3JdmSTU8l9A8CveQuVvK6VUjkIimBvn0d0lMP2csclvlgFmwWxkCM3XOoOHD1sK2yS5UAriuQ1YQrNuet7kohunrG5iChLmWnmxu2SGkL0zVazZlcjSFTyH4MZaKQfPZHKnrMWKQcDy4fIqUCQ1_g7nOMPn_t0y27HnCX6O6PS7Z5ed6s3sr1x-v76mldOtHpXEoLCMIJkqrt62bgBINtcfoRSuuQFFrdKGVFR6ptHaoBbGvrng8KuJNLxs-zLo4pRRrMd_R7jD-GgzlFm62Zos0p2oA0EyZH_3Ocz3iqyxH97qL5eDZpKjp6iiY5T8FR7yO5bPrRX7B_AfCbdRY |
| CitedBy_id | crossref_primary_10_1007_s00446_019_00356_0 crossref_primary_10_1007_s11042_020_10198_9 |
| Cites_doi | 10.1145/114005.102808 10.1145/365559.365617 10.1007/s002360050034 10.1145/319628.319663 10.1145/78969.78972 10.1007/978-3-642-32027-9 10.1109/2.546611 10.1007/BF00263762 10.1016/j.ic.2013.11.007 10.1109/TC.1979.1675439 10.1016/0167-6423(95)00009-H 10.1145/7351.7352 10.1016/0020-0190(87)90052-4 10.1007/s00446-007-0046-9 10.1145/3149.214121 10.1145/320613.320619 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2017.03.017 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 55 |
| ExternalDocumentID | 10_1016_j_tcs_2017_03_017 S030439751730230X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c297t-3b0a02c2e368d45f1e0fb8a297ea3bcae6ab7566b29e688ca6f0b8b4d1f601c3 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000401886600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 05:15:26 EST 2025 Tue Nov 18 22:38:50 EST 2025 Fri Feb 23 02:30:24 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Shortcut code Disable-free Livelock Starvation Interference k-obstruction-free Locks Wait-free Prevention-free Synchronization Contention-sensitive |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-3b0a02c2e368d45f1e0fb8a297ea3bcae6ab7566b29e688ca6f0b8b4d1f601c3 |
| PageCount | 15 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2017_03_017 crossref_citationtrail_10_1016_j_tcs_2017_03_017 elsevier_sciencedirect_doi_10_1016_j_tcs_2017_03_017 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05-16 |
| PublicationDateYYYYMMDD | 2017-05-16 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Aguilera, Toueg (br0040) 2008 Moran, Wolfsthal (br0320) 1987; 26 Sundell, Tsigas (br0380) 2004 Raynal (br0340) 2013 Guerraoui, Herlihy, Pochon (br0120) 2005 McKenney, Michael, Walpole (br0260) 2007 Fischer, Lynch, Paterson (br0100) 1985; 32 Dijkstra (br0060) 1965; 8 Herlihy, Moss (br0170) 1993 Luchangco, Moir, Shavit (br0240) 2003; vol. 2848 Moir, Anderson (br0270) 1995; 25 Ellis (br0080) 1983 Herlihy (br0150) January 1991; 13 Guerraoui, Kapalka, Kouznetsov (br0130) 2008; 20 Loui, Abu-Amara (br0230) 1987; 4 Kung, Lehman (br0200) 1980; 5 Harris (br0140) 2003; vol. 2180 Hart, McKenney, Brown (br0180) 2006 Attiya, Guerraoui, Kouznetsov (br0020) 2005; vol. 3724 Herlihy, Wing (br0190) 1990; 12 Lamport (br0210) 1987; 5 Taubenfeld (br0410) 2009; vol. 5805 Lehman, Yao (br0250) 1981; 6 Valois (br0440) 1994 Bayer, Schkolnick (br0050) 1977; 9 Herlihy, Luchangco, Moir (br0160) 2003 Massalin, Pu (br0280) 1991 Lamport (br0220) September 1979; 28 Scherer, Scott (br0360) 2005 Shavit, Touitou (br0370) 1995 Merritt, Taubenfeld (br0300) 2013; 233 Taubenfeld (br0400) 2006 Adve, Gharachorloo (br0010) September 1996; 29 Merritt, Taubenfeld (br0310) 2003; vol. 2848 Taubenfeld, Moran (br0430) 1996; 33 Taubenfeld (br0390) 2007; vol. 4731 Easton (br0070) 1971 Taubenfeld (br0420) May 2016 Michael, Scott (br0290) 1996 Raynal (br0330) 1986 Rajwar, Goodman (br0350) 2001 br0450 Fich, Luchangco, Moir, Shavit (br0090) 2005; vol. 3724 Fomitchev, Ruppert (br0110) 2004 Lamport (10.1016/j.tcs.2017.03.017_br0220) 1979; 28 Merritt (10.1016/j.tcs.2017.03.017_br0310) 2003; vol. 2848 Herlihy (10.1016/j.tcs.2017.03.017_br0160) 2003 Moran (10.1016/j.tcs.2017.03.017_br0320) 1987; 26 Harris (10.1016/j.tcs.2017.03.017_br0140) 2003; vol. 2180 Valois (10.1016/j.tcs.2017.03.017_br0440) 1994 Herlihy (10.1016/j.tcs.2017.03.017_br0170) 1993 Adve (10.1016/j.tcs.2017.03.017_br0010) 1996; 29 Scherer (10.1016/j.tcs.2017.03.017_br0360) 2005 Easton (10.1016/j.tcs.2017.03.017_br0070) 1971 Fomitchev (10.1016/j.tcs.2017.03.017_br0110) 2004 Dijkstra (10.1016/j.tcs.2017.03.017_br0060) 1965; 8 Merritt (10.1016/j.tcs.2017.03.017_br0300) 2013; 233 Luchangco (10.1016/j.tcs.2017.03.017_br0240) 2003; vol. 2848 Attiya (10.1016/j.tcs.2017.03.017_br0020) 2005; vol. 3724 Bayer (10.1016/j.tcs.2017.03.017_br0050) 1977; 9 Fich (10.1016/j.tcs.2017.03.017_br0090) 2005; vol. 3724 Lamport (10.1016/j.tcs.2017.03.017_br0210) 1987; 5 Massalin (10.1016/j.tcs.2017.03.017_br0280) 1991 Michael (10.1016/j.tcs.2017.03.017_br0290) 1996 Taubenfeld (10.1016/j.tcs.2017.03.017_br0420) 2016 Kung (10.1016/j.tcs.2017.03.017_br0200) 1980; 5 Loui (10.1016/j.tcs.2017.03.017_br0230) 1987; 4 Ellis (10.1016/j.tcs.2017.03.017_br0080) 1983 McKenney (10.1016/j.tcs.2017.03.017_br0260) 2007 Guerraoui (10.1016/j.tcs.2017.03.017_br0120) 2005 Hart (10.1016/j.tcs.2017.03.017_br0180) 2006 Taubenfeld (10.1016/j.tcs.2017.03.017_br0390) 2007; vol. 4731 Shavit (10.1016/j.tcs.2017.03.017_br0370) 1995 Taubenfeld (10.1016/j.tcs.2017.03.017_br0430) 1996; 33 Herlihy (10.1016/j.tcs.2017.03.017_br0150) 1991; 13 Herlihy (10.1016/j.tcs.2017.03.017_br0190) 1990; 12 Lehman (10.1016/j.tcs.2017.03.017_br0250) 1981; 6 Moir (10.1016/j.tcs.2017.03.017_br0270) 1995; 25 Rajwar (10.1016/j.tcs.2017.03.017_br0350) 2001 Fischer (10.1016/j.tcs.2017.03.017_br0100) 1985; 32 Raynal (10.1016/j.tcs.2017.03.017_br0340) 2013 Taubenfeld (10.1016/j.tcs.2017.03.017_br0400) 2006 Guerraoui (10.1016/j.tcs.2017.03.017_br0130) 2008; 20 Aguilera (10.1016/j.tcs.2017.03.017_br0040) 2008 Taubenfeld (10.1016/j.tcs.2017.03.017_br0410) 2009; vol. 5805 Raynal (10.1016/j.tcs.2017.03.017_br0330) 1986 Sundell (10.1016/j.tcs.2017.03.017_br0380) 2004 |
| References_xml | – volume: 32 start-page: 374 year: 1985 end-page: 382 ident: br0100 article-title: Impossibility of distributed consensus with one faulty process publication-title: J. ACM – start-page: 522 year: 2003 end-page: 529 ident: br0160 article-title: Obstruction-free synchronization: double-ended queues as an example publication-title: Proc. of the 23rd International Conf. on Dist. Computing Systems – start-page: 1 year: 2007 end-page: 5 ident: br0260 article-title: Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory publication-title: Proc. of the 4th Workshop on Programming Languages and Operating Systems – start-page: 95 year: 1971 end-page: 100 ident: br0070 article-title: Process synchronization without long-term interlock publication-title: Proc. of the 3rd ACM Symp. on Operating Systems Principles – volume: 29 start-page: 66 year: September 1996 end-page: 76 ident: br0010 article-title: Shared memory consistency models: a tutorial publication-title: IEEE Comput. – year: 1991 ident: br0280 article-title: A Lock-Free Multiprocessor OS Kernel – ident: br0450 – volume: vol. 2180 start-page: 300 year: 2003 end-page: 314 ident: br0140 article-title: A pragmatic implementation of non-blocking linked-lists publication-title: Proc. 15th International Symp. on Distributed Computing – start-page: 258 year: 2005 end-page: 264 ident: br0120 article-title: Towards a theory of transactional contention managers publication-title: Proc. of the 24th Symp. on Principles of Dist. Computing – volume: 28 start-page: 690 year: September 1979 end-page: 691 ident: br0220 article-title: How to make a multiprocessor computer that correctly executes multiprocess programs publication-title: IEEE Trans. Comput. – year: 2013 ident: br0340 article-title: Concurrent Programming: Algorithms, Principles, and Foundations – volume: vol. 3724 start-page: 122 year: 2005 end-page: 136 ident: br0020 article-title: Computing with reads and writes in the absence of step contention publication-title: Proceedings of the 19th International Symposium on Distributed Computing – volume: 9 start-page: 1 year: 1977 end-page: 21 ident: br0050 article-title: Concurrency of operations on B-trees publication-title: Acta Inform. – volume: vol. 2848 start-page: 45 year: 2003 end-page: 59 ident: br0240 article-title: On the uncontended complexity of consensus publication-title: Proc. of the 17th International Symp. on Distributed Computing – volume: 13 start-page: 124 year: January 1991 end-page: 149 ident: br0150 article-title: Wait-free synchronization publication-title: ACM Trans. Program. Lang. Syst. – start-page: 294 year: 2001 end-page: 305 ident: br0350 article-title: Speculative lock elision: enabling highly concurrent multithreaded execution publication-title: Proc. 34th Inter. Symp. on Microarchitecture – start-page: 212 year: 1994 end-page: 222 ident: br0440 article-title: Implementing lock-free queues publication-title: Proc. of the 7th International Conference on Parallel and Distributed Computing Systems – volume: 25 start-page: 1 year: 1995 end-page: 39 ident: br0270 article-title: Wait-free algorithms for fast, long-lived renaming publication-title: Sci. Comput. Program. – volume: 6 start-page: 650 year: 1981 end-page: 670 ident: br0250 article-title: Efficient locking for concurrent operations on B-trees publication-title: ACM Trans. Database Syst. – volume: vol. 2848 start-page: 1 year: 2003 end-page: 15 ident: br0310 article-title: Resilient consensus for infinitely many processes publication-title: Proc. of the 17th International Symp. on Distributed Computing – start-page: 267 year: 1996 end-page: 275 ident: br0290 article-title: Simple fast and practical non-blocking and blocking concurrent queue algorithms publication-title: Proc. 15th ACM Symp. on Principles of Distributed Computing – volume: 4 start-page: 163 year: 1987 end-page: 183 ident: br0230 article-title: Memory requirements for agreement among unreliable asynchronous processes publication-title: Adv. Comput. Res., JAI Press – start-page: 305 year: 2008 end-page: 314 ident: br0040 article-title: Timeliness-based wait-freedom: a gracefully degrading progress condition publication-title: Proc. 27rd ACM Symp. on Principles of Distributed Computing – start-page: 289 year: 1993 end-page: 300 ident: br0170 article-title: Transactional memory: architectural support for lock-free data structures publication-title: Proc. of the 20th Annual International Symp. on Computer Architecture – volume: vol. 5805 start-page: 157 year: 2009 end-page: 171 ident: br0410 article-title: Contention-sensitive data structures and algorithms publication-title: 23rd International Symposium on Distributed Computing – start-page: 204 year: 1995 end-page: 213 ident: br0370 article-title: Software transactional memory publication-title: Proc. 14th ACM Symp. on Principles of Distributed Computing – volume: 5 start-page: 354 year: 1980 end-page: 382 ident: br0200 article-title: Concurrent manipulation of binary search trees publication-title: ACM Trans. Database Syst. – start-page: 240 year: 2005 end-page: 248 ident: br0360 article-title: Advanced contention management for dynamic software transactional memory publication-title: Proc. of the 24th Symp. on Principles of Dist. Computing – volume: 233 start-page: 12 year: 2013 end-page: 31 ident: br0300 article-title: Computing with infinitely many processes publication-title: Inform. and Comput. – start-page: 106 year: 1983 end-page: 116 ident: br0080 article-title: Extendible hashing for concurrent operations and distributed data publication-title: Proc. of the 2nd ACM Symposium on Principles of Database Systems – year: 2004 ident: br0380 article-title: Lock-free and practical deques using single-word compare-and-swap publication-title: 8th International Conference on Principles of Distributed Systems – year: 2006 ident: br0180 article-title: Making lockless synchronization fast: performance implications of memory reclamation publication-title: Proc. of the 20th International Parallel and Distributed Processing Symp. – volume: 26 start-page: 141 year: 1987 end-page: 151 ident: br0320 article-title: An extended impossibility result for asynchronous complete networks publication-title: Inform. Process. Lett. – volume: vol. 3724 start-page: 78 year: 2005 end-page: 92 ident: br0090 article-title: Obstruction-free algorithms can be practically wait-free publication-title: Proc. of the 19th International Symp. on Distributed Computing – start-page: 50 year: 2004 end-page: 59 ident: br0110 article-title: Lock-free linked lists and skip lists publication-title: Proc. 23rd ACM Symp. on Principles of Distributed Computing – volume: 8 start-page: 569 year: 1965 ident: br0060 article-title: Solution of a problem in concurrent programming control publication-title: Commun. ACM – volume: 20 start-page: 415 year: 2008 end-page: 433 ident: br0130 article-title: The weakest failure detectors to boost obstruction-freedom publication-title: Distrib. Comput. – volume: 12 start-page: 463 year: 1990 end-page: 492 ident: br0190 article-title: Linearizability: a correctness condition for concurrent objects publication-title: ACM Trans. Program. Lang. Syst. – year: 2006 ident: br0400 article-title: Synchronization Algorithms and Concurrent Programming – volume: 33 start-page: 1 year: 1996 end-page: 20 ident: br0430 article-title: Possibility and impossibility results in a shared memory environment publication-title: Acta Inform. – volume: vol. 4731 start-page: 450 year: 2007 end-page: 464 ident: br0390 article-title: Efficient transformations of obstruction-free algorithms into non-blocking algorithms publication-title: Proc. of the 21st International Symp. on Distributed Computing – year: 1986 ident: br0330 article-title: Algorithms for Mutual Exclusion – volume: 5 start-page: 1 year: 1987 end-page: 11 ident: br0210 article-title: A fast mutual exclusion algorithm publication-title: ACM Trans. Comput. Syst. – year: May 2016 ident: br0420 article-title: Waiting in concurrent algorithms publication-title: 4th International Conference on Networked Systems – start-page: 522 year: 2003 ident: 10.1016/j.tcs.2017.03.017_br0160 article-title: Obstruction-free synchronization: double-ended queues as an example – start-page: 267 year: 1996 ident: 10.1016/j.tcs.2017.03.017_br0290 article-title: Simple fast and practical non-blocking and blocking concurrent queue algorithms – volume: 13 start-page: 124 issue: 1 year: 1991 ident: 10.1016/j.tcs.2017.03.017_br0150 article-title: Wait-free synchronization publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/114005.102808 – volume: 4 start-page: 163 year: 1987 ident: 10.1016/j.tcs.2017.03.017_br0230 article-title: Memory requirements for agreement among unreliable asynchronous processes publication-title: Adv. Comput. Res., JAI Press – volume: 8 start-page: 569 issue: 9 year: 1965 ident: 10.1016/j.tcs.2017.03.017_br0060 article-title: Solution of a problem in concurrent programming control publication-title: Commun. ACM doi: 10.1145/365559.365617 – volume: 33 start-page: 1 issue: 1 year: 1996 ident: 10.1016/j.tcs.2017.03.017_br0430 article-title: Possibility and impossibility results in a shared memory environment publication-title: Acta Inform. doi: 10.1007/s002360050034 – year: 1991 ident: 10.1016/j.tcs.2017.03.017_br0280 – volume: vol. 2848 start-page: 1 year: 2003 ident: 10.1016/j.tcs.2017.03.017_br0310 article-title: Resilient consensus for infinitely many processes – year: 1986 ident: 10.1016/j.tcs.2017.03.017_br0330 – volume: vol. 3724 start-page: 78 year: 2005 ident: 10.1016/j.tcs.2017.03.017_br0090 article-title: Obstruction-free algorithms can be practically wait-free – volume: 6 start-page: 650 issue: 4 year: 1981 ident: 10.1016/j.tcs.2017.03.017_br0250 article-title: Efficient locking for concurrent operations on B-trees publication-title: ACM Trans. Database Syst. doi: 10.1145/319628.319663 – volume: vol. 4731 start-page: 450 year: 2007 ident: 10.1016/j.tcs.2017.03.017_br0390 article-title: Efficient transformations of obstruction-free algorithms into non-blocking algorithms – year: 2006 ident: 10.1016/j.tcs.2017.03.017_br0400 – volume: 12 start-page: 463 issue: 3 year: 1990 ident: 10.1016/j.tcs.2017.03.017_br0190 article-title: Linearizability: a correctness condition for concurrent objects publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/78969.78972 – start-page: 204 year: 1995 ident: 10.1016/j.tcs.2017.03.017_br0370 article-title: Software transactional memory – year: 2013 ident: 10.1016/j.tcs.2017.03.017_br0340 doi: 10.1007/978-3-642-32027-9 – start-page: 212 year: 1994 ident: 10.1016/j.tcs.2017.03.017_br0440 article-title: Implementing lock-free queues – volume: vol. 2180 start-page: 300 year: 2003 ident: 10.1016/j.tcs.2017.03.017_br0140 article-title: A pragmatic implementation of non-blocking linked-lists – volume: 29 start-page: 66 issue: 12 year: 1996 ident: 10.1016/j.tcs.2017.03.017_br0010 article-title: Shared memory consistency models: a tutorial publication-title: IEEE Comput. doi: 10.1109/2.546611 – start-page: 95 year: 1971 ident: 10.1016/j.tcs.2017.03.017_br0070 article-title: Process synchronization without long-term interlock – volume: vol. 2848 start-page: 45 year: 2003 ident: 10.1016/j.tcs.2017.03.017_br0240 article-title: On the uncontended complexity of consensus – volume: 9 start-page: 1 year: 1977 ident: 10.1016/j.tcs.2017.03.017_br0050 article-title: Concurrency of operations on B-trees publication-title: Acta Inform. doi: 10.1007/BF00263762 – start-page: 50 year: 2004 ident: 10.1016/j.tcs.2017.03.017_br0110 article-title: Lock-free linked lists and skip lists – year: 2016 ident: 10.1016/j.tcs.2017.03.017_br0420 article-title: Waiting in concurrent algorithms – start-page: 294 year: 2001 ident: 10.1016/j.tcs.2017.03.017_br0350 article-title: Speculative lock elision: enabling highly concurrent multithreaded execution – volume: vol. 3724 start-page: 122 year: 2005 ident: 10.1016/j.tcs.2017.03.017_br0020 article-title: Computing with reads and writes in the absence of step contention – volume: 233 start-page: 12 year: 2013 ident: 10.1016/j.tcs.2017.03.017_br0300 article-title: Computing with infinitely many processes publication-title: Inform. and Comput. doi: 10.1016/j.ic.2013.11.007 – volume: 28 start-page: 690 issue: 9 year: 1979 ident: 10.1016/j.tcs.2017.03.017_br0220 article-title: How to make a multiprocessor computer that correctly executes multiprocess programs publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1979.1675439 – volume: 25 start-page: 1 issue: 1 year: 1995 ident: 10.1016/j.tcs.2017.03.017_br0270 article-title: Wait-free algorithms for fast, long-lived renaming publication-title: Sci. Comput. Program. doi: 10.1016/0167-6423(95)00009-H – volume: 5 start-page: 1 issue: 1 year: 1987 ident: 10.1016/j.tcs.2017.03.017_br0210 article-title: A fast mutual exclusion algorithm publication-title: ACM Trans. Comput. Syst. doi: 10.1145/7351.7352 – volume: 26 start-page: 141 year: 1987 ident: 10.1016/j.tcs.2017.03.017_br0320 article-title: An extended impossibility result for asynchronous complete networks publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(87)90052-4 – start-page: 258 year: 2005 ident: 10.1016/j.tcs.2017.03.017_br0120 article-title: Towards a theory of transactional contention managers – start-page: 305 year: 2008 ident: 10.1016/j.tcs.2017.03.017_br0040 article-title: Timeliness-based wait-freedom: a gracefully degrading progress condition – start-page: 1 year: 2007 ident: 10.1016/j.tcs.2017.03.017_br0260 article-title: Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory – start-page: 106 year: 1983 ident: 10.1016/j.tcs.2017.03.017_br0080 article-title: Extendible hashing for concurrent operations and distributed data – start-page: 289 year: 1993 ident: 10.1016/j.tcs.2017.03.017_br0170 article-title: Transactional memory: architectural support for lock-free data structures – year: 2006 ident: 10.1016/j.tcs.2017.03.017_br0180 article-title: Making lockless synchronization fast: performance implications of memory reclamation – start-page: 240 year: 2005 ident: 10.1016/j.tcs.2017.03.017_br0360 article-title: Advanced contention management for dynamic software transactional memory – year: 2004 ident: 10.1016/j.tcs.2017.03.017_br0380 article-title: Lock-free and practical deques using single-word compare-and-swap – volume: vol. 5805 start-page: 157 year: 2009 ident: 10.1016/j.tcs.2017.03.017_br0410 article-title: Contention-sensitive data structures and algorithms – volume: 20 start-page: 415 issue: 6 year: 2008 ident: 10.1016/j.tcs.2017.03.017_br0130 article-title: The weakest failure detectors to boost obstruction-freedom publication-title: Distrib. Comput. doi: 10.1007/s00446-007-0046-9 – volume: 32 start-page: 374 issue: 2 year: 1985 ident: 10.1016/j.tcs.2017.03.017_br0100 article-title: Impossibility of distributed consensus with one faulty process publication-title: J. ACM doi: 10.1145/3149.214121 – volume: 5 start-page: 354 issue: 3 year: 1980 ident: 10.1016/j.tcs.2017.03.017_br0200 article-title: Concurrent manipulation of binary search trees publication-title: ACM Trans. Database Syst. doi: 10.1145/320613.320619 |
| SSID | ssj0000576 |
| Score | 2.2117016 |
| Snippet | A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in common cases, when there is... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 41 |
| SubjectTerms | Contention-sensitive Disable-free Interference k-obstruction-free Livelock Locks Prevention-free Shortcut code Starvation Synchronization Wait-free |
| Title | Contention-sensitive data structures and algorithms |
| URI | https://dx.doi.org/10.1016/j.tcs.2017.03.017 |
| Volume | 677 |
| WOSCitedRecordID | wos000401886600004&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JSwMxFA5uBz24iztz8KSMzGSWJEcRV7AI9tDbkGQSbZGxdJH-fF8mmRmxKip4mZa0acP7Hu9lefk-hI7ygONYC-xrnOd-nDDqg5cAICQxOYcnUlmxCdJq0U6H3TvVtWEpJ0CKgk4mrP-vUEMbgG2uzv4C7vpHoQHeA-jwBNjh-SPgS76psobRH5rq9LI2yBSCnliu2DEssC1F6_Pjy6A7enJ85b3ab-qbjdJJPpy4PNks88dCFdqJW1_xvPt-8wASkuEdTZsdralbLfYmlTktYVbR5FTZwEgJ8zG2gsRV5EydAouNfZbAymVRy707FZ_tVkHvdCQNVXpISoJZe3nzA-31gxmFGURIjK5R0JlF8-BADCLX_NnNRee2ybcJsSfSbtTV2XVZxffhjz6ffbybUbRX0bJbCnhnFsI1NKOKdbRSyWx4Luquo6W7mlp3uIGiz_D1DL5eg68H-HoNvpuofXnRPr_2nfKFLzEjIz8SAQ-wxCpKaR4nOlSBFpTDZ4pHQnKVckFgIi4wUymlkqc6EFTEeahhgS2jLTRXvBRqG3kRS2OesJwoCvMVlXMay5BSHmoNTZTuoKAySCYdK7wRJ3nOqvK_XgY2zIwNsyDK4GUHHddd-pYS5bsvx5WVM-erdq6WgUt83W33b9320GLj5ftoDsyuDtCCfB11h4ND5zhv2NNwCw |
| linkProvider | Elsevier |
| 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=Contention-sensitive+data+structures+and+algorithms&rft.jtitle=Theoretical+computer+science&rft.au=Taubenfeld%2C+Gadi&rft.date=2017-05-16&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=677&rft.spage=41&rft.epage=55&rft_id=info:doi/10.1016%2Fj.tcs.2017.03.017&rft.externalDocID=S030439751730230X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |