Fast and Portable Locking for Multicore Architectures

The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access contention and cache misses. The main contribution presented in this article is a new locking technique, Remote Core Locking (RCL), that aims to ac...

Full description

Saved in:

Bibliographic Details
Published in	ACM transactions on computer systems Vol. 33; no. 4; pp. 1 - 62
Main Authors	Lozi, Jean-Pierre, David, Florian, Thomas, Gaël, Lawall, Julia, Muller, Gilles
Format	Journal Article
Language	English
Published	New York Association for Computing Machinery 01.01.2016
Subjects	Algorithms Architecture Computer Science Hardware Legacy systems Locking Locks Microprocessors Noise levels Operating Systems Optimization algorithms Processors Scalability Servers Software engineering Studies Categories and Subject Descriptors: D41 [Operating Systems]: Process Management—Mutual exclusion General Terms: Design Performance Additional Key Words and Phrases: Multicore busy-waiting Algorithms profiling RPC reengineering locality synchronization memory contention locks
Online Access	Get full text
ISSN	0734-2071 1557-7333 1557-7333
DOI	10.1145/2845079

Cover

Abstract	The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access contention and cache misses. The main contribution presented in this article is a new locking technique, Remote Core Locking (RCL), that aims to accelerate the execution of critical sections in legacy applications on multicore architectures. The idea of RCL is to replace lock acquisitions by optimized remote procedure calls to a dedicated server hardware thread. RCL limits the performance collapse observed with other lock algorithms when many threads try to acquire a lock concurrently and removes the need to transfer lock-protected shared data to the hardware thread acquiring the lock, because such data can typically remain in the server’s cache. Other contributions presented in this article include a profiler that identifies the locks that are the bottlenecks in multithreaded applications and that can thus benefit from RCL, and a reengineering tool that transforms POSIX lock acquisitions into RCL locks. Eighteen applications were used to evaluate RCL: the nine applications of the SPLASH-2 benchmark suite, the seven applications of the Phoenix 2 benchmark suite, Memcached, and Berkeley DB with a TPC-C client. Eight of these applications are unable to scale because of locks and benefit from RCL on an ×86 machine with four AMD Opteron processors and 48 hardware threads. By using RCL instead of Linux POSIX locks, performance is improved by up to 2.5 times on Memcached, and up to 11.6 times on Berkeley DB with the TPC-C client. On a SPARC machine with two Sun Ultrasparc T2+ processors and 128 hardware threads, three applications benefit from RCL. In particular, performance is improved by up to 1.3 times with respect to Solaris POSIX locks on Memcached, and up to 7.9 times on Berkeley DB with the TPC-C client.
AbstractList	The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access contention and cache misses. The main contribution presented in this article is a new locking technique, Remote Core Locking (RCL), that aims to accelerate the execution of critical sections in legacy applications on multicore architectures. The idea of RCL is to replace lock acquisitions by optimized remote procedure calls to a dedicated server hardware thread. RCL limits the performance collapse observed with other lock algorithms when many threads try to acquire a lock concurrently and removes the need to transfer lock-protected shared data to the hardware thread acquiring the lock, because such data can typically remain in the server's cache. Other contributions presented in this article include a profiler that identifies the locks that are the bottlenecks in multithreaded applications and that can thus benefit from RCL, and a reengineering tool that transforms POSIX lock acquisitions into RCL locks. Eighteen applications were used to evaluate RCL: the nine applications of the SPLASH-2 benchmark suite, the seven applications of the Phoenix 2 benchmark suite, Memcached, and Berkeley DB with a TPC-C client. Eight of these applications are unable to scale because of locks and benefit from RCL on an ×86 machine with four AMD Opteron processors and 48 hardware threads. By using RCL instead of Linux POSIX locks, performance is improved by up to 2.5 times on Memcached, and up to 11.6 times on Berkeley DB with the TPC-C client. On a SPARC machine with two Sun Ultrasparc T2+ processors and 128 hardware threads, three applications benefit from RCL. In particular, performance is improved by up to 1.3 times with respect to Solaris POSIX locks on Memcached, and up to 7.9 times on Berkeley DB with the TPC-C client.. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access contention and cache misses. The main contribution presented in this article is a new locking technique, Remote Core Locking (RCL), that aims to accelerate the execution of critical sections in legacy applications on multicore architectures. The idea of RCL is to replace lock acquisitions by optimized remote procedure calls to a dedicated server hardware thread. RCL limits the performance collapse observed with other lock algorithms when many threads try to acquire a lock concurrently and removes the need to transfer lock-protected shared data to the hardware thread acquiring the lock, because such data can typically remain in the server’s cache. Other contributions presented in this article include a profiler that identifies the locks that are the bottlenecks in multithreaded applications and that can thus benefit from RCL, and a reengineering tool that transforms POSIX lock acquisitions into RCL locks. Eighteen applications were used to evaluate RCL: the nine applications of the SPLASH-2 benchmark suite, the seven applications of the Phoenix 2 benchmark suite, Memcached, and Berkeley DB with a TPC-C client. Eight of these applications are unable to scale because of locks and benefit from RCL on an ×86 machine with four AMD Opteron processors and 48 hardware threads. By using RCL instead of Linux POSIX locks, performance is improved by up to 2.5 times on Memcached, and up to 11.6 times on Berkeley DB with the TPC-C client. On a SPARC machine with two Sun Ultrasparc T2+ processors and 128 hardware threads, three applications benefit from RCL. In particular, performance is improved by up to 1.3 times with respect to Solaris POSIX locks on Memcached, and up to 7.9 times on Berkeley DB with the TPC-C client. The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access contention and cache misses. The main contribution presented in this article is a new locking technique, Remote Core Locking (RCL), that aims to accelerate the execution of critical sections in legacy applications on multicore architectures. The idea of RCL is to replace lock acquisitions by optimized remote procedure calls to a dedicated server hardware thread. RCL limits the performance collapse observed with other lock algorithms when many threads try to acquire a lock concurrently and removes the need to transfer lock-protected shared data to the hardware thread acquiring the lock, because such data can typically remain in the server's cache. Other contributions presented in this article include a profiler that identifies the locks that are the bottlenecks in multithreaded applications and that can thus benefit from RCL, and a reengineering tool that transforms POSIX lock acquisitions into RCL locks. Eighteen applications were used to evaluate RCL: the nine applications of the SPLASH-2 benchmark suite, the seven applications of the Phoenix 2 benchmark suite, Memcached, and Berkeley DB with a TPC-C client. Eight of these applications are unable to scale because of locks and benefit from RCL on an 86 machine with four AMD Opteron processors and 48 hardware threads. By using RCL instead of Linux POSIX locks, performance is improved by up to 2.5 times on Memcached, and up to 11.6 times on Berkeley DB with the TPC-C client. On a SPARC machine with two Sun Ultrasparc T2+ processors and 128 hardware threads, three applications benefit from RCL. In particular, performance is improved by up to 1.3 times with respect to Solaris POSIX locks on Memcached, and up to 7.9 times on Berkeley DB with the TPC-C client. The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access contention and cache misses. The main contribution presented in this article is a new locking technique, Remote Core Locking (RCL), that aims to accelerate the execution of critical sections in legacy applications on multicore architectures. The idea of RCL is to replace lock acquisitions by optimized remote procedure calls to a dedicated server hardware thread. By using RCL instead of Linux POSIX locks, performance is improved by up to 2.5 times on Memcached, and up to 11.6 times on Berkeley DB with the TPC-C client. On a SPARC machine with two Sun Ultrasparc T2+ processors and 128 hardware threads, three applications benefit from RCL. In particular, performance is improved by up to 1.3 times with respect to Solaris POSIX locks on Memcached, and up to 7.9 times on Berkeley DB with the TPC-C client.
Author	Lawall, Julia Muller, Gilles Thomas, Gaël David, Florian Lozi, Jean-Pierre
Author_xml	– sequence: 1 givenname: Jean-Pierre surname: Lozi fullname: Lozi, Jean-Pierre organization: Université Nice Sophia Antipolis, CNRS – sequence: 2 givenname: Florian surname: David fullname: David, Florian organization: Sorbonne Universités, Inria, CNRS, UPMC – sequence: 3 givenname: Gaël surname: Thomas fullname: Thomas, Gaël organization: SAMOVAR, CNRS, Télécom ParisSud, Université Paris-Saclay – sequence: 4 givenname: Julia surname: Lawall fullname: Lawall, Julia organization: Sorbonne Universités, Inria, CNRS, UPMC – sequence: 5 givenname: Gilles surname: Muller fullname: Muller, Gilles organization: Sorbonne Universités, Inria, CNRS, UPMC
BackLink	https://inria.hal.science/hal-01252167$$DView record in HAL
BookMark	eNp1j81KAzEURoMoWKv4CgMu1MVokpsfuyyiVqjown24k8nY1HFSk4zSt3dKBUF0deHjcLjngOx2oXOEHDN6wZiQl_xKSKonO2TEpNSlBoBdMqIaRMmpZvvkIKUlpXTY-YjIW0y5wK4unkLMWLWumAf76ruXogmxeOjb7G2IrphGu_DZ2dxHlw7JXoNtckffd0yeb2-er2fl_PHu_no6Ly1IyCWgrhCwYbyyUFnZKMuBMqBUooYK6dWEKyukkK5WtbB8QlEJWkENdVU7GJOzrbbvVrj-xLY1q-jfMK4No2ZTa75rB_R8iy7wBwrozWw6N5uNMi45U_qD_WhXMbz3LmXz5pN1bYudC30ybPBxAQzUgJ78Qpehj93QPFAKtFBKbYTllrIxpBRdY6zPmH3ockTf_vHs6S_-v6wvwVmKZg
CitedBy_id	crossref_primary_10_1145_3689775 crossref_primary_10_1016_j_jpdc_2022_01_001 crossref_primary_10_1145_3301501 crossref_primary_10_3390_app14156449 crossref_primary_10_1109_TPDS_2016_2630695 crossref_primary_10_1145_3139645_3139650 crossref_primary_10_1002_cpe_5964 crossref_primary_10_1109_TPDS_2019_2927481 crossref_primary_10_1007_s11227_021_03719_2 crossref_primary_10_1109_TPDS_2017_2767046
Cites_doi	10.1145/2555243.2555251 10.1145/1465482.1465560 10.1145/2686884 10.1145/1327452.1327492 10.1109/HPCA.2007.346181 10.1145/106972.106999 10.1109/IPDPS.2014.30 10.1145/1352592.1352618 10.1145/2145816.2145848 10.5555/1924943.1924955 10.1145/2145816.2145849 10.1145/1755913.1755928 10.1145/1629575.1629579 10.1145/1810479.1810540 10.1007/11864219_29 10.1145/223982.223990 10.1109/IISWC.2009.5306783 10.1145/1809049.1809079 10.1145/2517349.2522714 10.1109/71.80120 10.1145/1996092.1996095 10.1109/ASSCC.2007.4425786 10.1145/2688500.2688503 10.1145/359060.359076 10.1145/355620.361161 10.1145/2555243.2555273 10.5555/822080.822810 10.1145/103727.103729 10.1109/RTAS.2013.6531087 10.1109/IPDPS.2011.87 10.1145/1989493.1989502 10.1145/1064212.1064233 10.1145/170035.170042 10.5555/645604.662740 10.1007/11602569_6 10.1007/11823285_84 10.1145/130823.130824
ContentType	Journal Article
Copyright	Copyright Association for Computing Machinery Jan 2016 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: Copyright Association for Computing Machinery Jan 2016 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES ADTOC UNPAY
DOI	10.1145/2845079
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) Unpaywall for CDI: Periodical Content Unpaywall
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	CrossRef Computer and Information Systems Abstracts Computer and Information Systems Abstracts
Database_xml	– sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Architecture
EISSN	1557-7333
EndPage	62
ExternalDocumentID	10.1145/2845079 oai:HAL:hal-01252167v1 3946575931 10_1145_2845079
Genre	Feature
GroupedDBID	-DZ -~X .4S .DC 23M 2FS 4.4 5GY 5VS 6J9 85S 8US 8VB AAIKC AAKMM AALFJ AAMNW AAYFX AAYXX ABPPZ ACGFO ACGOD ACM ADBCU ADL ADMLS AEBYY AEFXT AEGXH AEJOY AENEX AENSD AETEA AFWIH AFWXC AHQJS AIAGR AIKLT AKRVB AKVCP ALMA_UNASSIGNED_HOLDINGS ARCSS ASPBG AVWKF BDXCO CCLIF CITATION CS3 D0L EBS EBU EDO EJD FEDTE GUFHI HGAVV H~9 I07 IAO ICD IEA IGS IOF K1G LHSKQ MK~ ML~ P1C P2P PQQKQ QWB RNS ROL RXW TAE TH9 TUS U5U UPT WH7 X6Y XH6 XSW ZCA ZL0 7SC 8FD JQ2 L7M L~C L~D 1XC 9M8 ABFSI ADMHC AFFNX AI. E.L HF~ ITC MVM OHT VH1 VOOES XJT XOL ZCG ZY4 ADTOC UNPAY
ID	FETCH-LOGICAL-c353t-3a7ba3af12bc3bc5f6c23013005a73ba08926c4545ed6d4c290a640b3d3dbde3
IEDL.DBID	UNPAY
ISSN	0734-2071 1557-7333
IngestDate	Sun Oct 26 03:48:55 EDT 2025 Sun Oct 19 01:06:21 EDT 2025 Thu Jul 10 22:31:59 EDT 2025 Sun Jun 29 16:45:32 EDT 2025 Thu Apr 24 23:08:04 EDT 2025 Wed Oct 01 06:00:53 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Categories and Subject Descriptors: D41 [Operating Systems]: Process Management—Mutual exclusion General Terms: Design Performance Additional Key Words and Phrases: Multicore busy-waiting Algorithms profiling RPC reengineering locality synchronization memory contention locks
Language	English
License	Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c353t-3a7ba3af12bc3bc5f6c23013005a73ba08926c4545ed6d4c290a640b3d3dbde3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ORCID	0009-0002-2876-8292 0000-0002-9444-1071
OpenAccessLink	https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/2845079?download=true
PQID	1763746661
PQPubID	37304
PageCount	62
ParticipantIDs	unpaywall_primary_10_1145_2845079 hal_primary_oai_HAL_hal_01252167v1 proquest_miscellaneous_1793243136 proquest_journals_1763746661 crossref_citationtrail_10_1145_2845079 crossref_primary_10_1145_2845079
ProviderPackageCode	CITATION AAYXX
PublicationCentury	2000
PublicationDate	2016-01-01
PublicationDateYYYYMMDD	2016-01-01
PublicationDate_xml	– month: 01 year: 2016 text: 2016-01-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	ACM transactions on computer systems
PublicationYear	2016
Publisher	Association for Computing Machinery
Publisher_xml	– name: Association for Computing Machinery
References	Lozi Jean-Pierre (e_1_2_1_34_1) 2012 e_1_2_1_20_1 Oyama Yoshihiro (e_1_2_1_42_1) 1999 Ousterhout John K. (e_1_2_1_41_1) 1982 e_1_2_1_45_1 e_1_2_1_22_1 e_1_2_1_43_1 e_1_2_1_28_1 e_1_2_1_49_1 e_1_2_1_26_1 e_1_2_1_47_1 Interactive Danga (e_1_2_1_12_1) 2003 Herlihy Maurice (e_1_2_1_30_1) e_1_2_1_31_1 e_1_2_1_54_1 e_1_2_1_8_1 e_1_2_1_56_1 Boyd-Wickizer Silas (e_1_2_1_6_1) 2008 e_1_2_1_35_1 e_1_2_1_50_1 e_1_2_1_10_1 e_1_2_1_33_1 e_1_2_1_52_1 e_1_2_1_2_1 e_1_2_1_16_1 e_1_2_1_14_1 e_1_2_1_37_1 e_1_2_1_18_1 Fatourou Panagiota (e_1_2_1_21_1) 2011 Fowler Martin (e_1_2_1_24_1) 1999 e_1_2_1_40_1 e_1_2_1_46_1 e_1_2_1_44_1 e_1_2_1_25_1 e_1_2_1_48_1 e_1_2_1_29_1 Olson Michael A. (e_1_2_1_39_1) 1999 Boyd-Wickizer Silas (e_1_2_1_7_1) 2010 Dijkstra Edsger W. (e_1_2_1_19_1) 1965 Auslander Marc (e_1_2_1_4_1) 2003 e_1_2_1_55_1 e_1_2_1_5_1 e_1_2_1_57_1 e_1_2_1_3_1 e_1_2_1_13_1 He Bijun (e_1_2_1_27_1) 2005 e_1_2_1_51_1 e_1_2_1_1_1 Fitzpatrick Brad (e_1_2_1_23_1) 2004; 2004 e_1_2_1_32_1 e_1_2_1_53_1 e_1_2_1_17_1 e_1_2_1_38_1 e_1_2_1_15_1 e_1_2_1_36_1 e_1_2_1_9_1
References_xml	– ident: e_1_2_1_44_1 doi: 10.1145/2555243.2555251 – ident: e_1_2_1_2_1 doi: 10.1145/1465482.1465560 – volume-title: Proceedings of the 3rd International Conference on Distributed Computing Systems (ICDCS’82) year: 1982 ident: e_1_2_1_41_1 – ident: e_1_2_1_18_1 doi: 10.1145/2686884 – ident: e_1_2_1_15_1 doi: 10.1145/1327452.1327492 – volume-title: Proceedings of the 2012. USENIX Annual Technical Conference (USENIX ATC’12) year: 2012 ident: e_1_2_1_34_1 – ident: e_1_2_1_47_1 doi: 10.1109/HPCA.2007.346181 – ident: e_1_2_1_51_1 – ident: e_1_2_1_38_1 doi: 10.1145/106972.106999 – ident: e_1_2_1_25_1 doi: 10.1109/IPDPS.2014.30 – ident: e_1_2_1_43_1 doi: 10.1145/1352592.1352618 – ident: e_1_2_1_17_1 doi: 10.1145/2145816.2145848 – ident: e_1_2_1_55_1 doi: 10.5555/1924943.1924955 – ident: e_1_2_1_22_1 doi: 10.1145/2145816.2145849 – volume: 2004 start-page: 124 year: 2004 ident: e_1_2_1_23_1 article-title: Distributed caching with memcached publication-title: Linux Journal – ident: e_1_2_1_32_1 doi: 10.1145/1755913.1755928 – volume-title: Berkeley DB. In Proceedings of the Annual Conference on USENIX Annual Technical Conference (USENIX ATC’99) year: 1999 ident: e_1_2_1_39_1 – volume-title: The Art of Multiprocessor Programming ident: e_1_2_1_30_1 – ident: e_1_2_1_53_1 – start-page: 745 issue: 10 year: 2003 ident: e_1_2_1_4_1 article-title: Enhancement to the MCS lock for increased functionality and improved programmability. (Oct. 2003) publication-title: U.S. Patent Application – volume-title: Scott year: 2005 ident: e_1_2_1_27_1 – ident: e_1_2_1_5_1 doi: 10.1145/1629575.1629579 – ident: e_1_2_1_29_1 doi: 10.1145/1810479.1810540 – ident: e_1_2_1_13_1 – ident: e_1_2_1_9_1 doi: 10.1007/11864219_29 – ident: e_1_2_1_54_1 doi: 10.1145/223982.223990 – ident: e_1_2_1_56_1 doi: 10.1109/IISWC.2009.5306783 – ident: e_1_2_1_20_1 doi: 10.1145/1809049.1809079 – volume-title: Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI’08) year: 2008 ident: e_1_2_1_6_1 – ident: e_1_2_1_40_1 – ident: e_1_2_1_14_1 doi: 10.1145/2517349.2522714 – volume-title: Proceedings of the International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA’99) year: 1999 ident: e_1_2_1_42_1 – volume-title: Memcached: Distributed Memory Object Caching System. year: 2003 ident: e_1_2_1_12_1 – ident: e_1_2_1_3_1 doi: 10.1109/71.80120 – volume-title: Cooperating sequential processes. (Sept year: 1965 ident: e_1_2_1_19_1 – ident: e_1_2_1_28_1 doi: 10.1145/1810479.1810540 – volume-title: Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI’10) year: 2010 ident: e_1_2_1_7_1 – ident: e_1_2_1_52_1 doi: 10.1145/1996092.1996095 – ident: e_1_2_1_49_1 doi: 10.1109/ASSCC.2007.4425786 – ident: e_1_2_1_10_1 doi: 10.1145/2688500.2688503 – ident: e_1_2_1_48_1 doi: 10.1145/359060.359076 – ident: e_1_2_1_31_1 doi: 10.1145/355620.361161 – ident: e_1_2_1_45_1 doi: 10.1145/2555243.2555273 – ident: e_1_2_1_46_1 doi: 10.5555/822080.822810 – ident: e_1_2_1_37_1 doi: 10.1145/103727.103729 – ident: e_1_2_1_8_1 doi: 10.1109/RTAS.2013.6531087 – ident: e_1_2_1_1_1 doi: 10.1109/IPDPS.2011.87 – ident: e_1_2_1_16_1 doi: 10.1145/1989493.1989502 – ident: e_1_2_1_57_1 doi: 10.1145/1064212.1064233 – ident: e_1_2_1_33_1 doi: 10.1145/170035.170042 – ident: e_1_2_1_36_1 doi: 10.5555/645604.662740 – ident: e_1_2_1_26_1 doi: 10.1007/11602569_6 – volume-title: Refactoring: Improving the Design of Existing Code year: 1999 ident: e_1_2_1_24_1 – ident: e_1_2_1_35_1 doi: 10.1007/11823285_84 – ident: e_1_2_1_50_1 doi: 10.1145/130823.130824 – volume-title: Kallimanis year: 2011 ident: e_1_2_1_21_1
SSID	ssj0003332
Score	2.2247608
Snippet	The scalability of multithreaded applications on current multicore systems is hampered by the performance of lock algorithms, due to the costs of access...
SourceID	unpaywall hal proquest crossref
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database
StartPage	1
SubjectTerms	Algorithms Architecture Computer Science Hardware Legacy systems Locking Locks Microprocessors Noise levels Operating Systems Optimization algorithms Processors Scalability Servers Software engineering Studies
Title	Fast and Portable Locking for Multicore Architectures
URI	https://www.proquest.com/docview/1763746661 https://www.proquest.com/docview/1793243136 https://inria.hal.science/hal-01252167 https://dl.acm.org/doi/pdf/10.1145/2845079?download=true
UnpaywallVersion	publishedVersion
Volume	33
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1557-7333 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003332 issn: 0734-2071 databaseCode: ADMLS dateStart: 20080601 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost
link	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS9xAEB_07qF9qf3EUytrkb7FJtmPJA-lhLbHIacIKuhT2K8gmOYOL9eif72zyeY4Wwqlr9lh2WR2dn6T2fkNwGGsXdQhTVCGugyYCG2QcasC9MVSiJiZuG3fdnIqJpfs-IpfbUDa18KYCuf50abwnU3PTekJbfknPEgRvGRfjGORn0nzublb2k0YCo4ofADDy9Oz_Lpl3aQMld_FWpwnQUIp7epl1-d54og2b9w1yDWM-WxZz-X9L1lVa-5mvAXX_UK7Wya3R8tGHemH3zgc_-dNXsILj0FJ3m2aV7Bh69ew1fd3IN7c3wAfy0VDZG1Ie99UVZZM8fhEZ0cQ6pK2dtexYJJ8LRuxeAsX4-8XXyeBb7MQaMppE1CZKEllGcVKU6V5KTTGJS7NxWVClQzTLBaaIdSyRhim4yyUgoWKGmqUsfQdDOpZbbeBINSRobVJHGcRs6lOy0ioMlU6iUqEx2oEH_tPXmhPQe46YVRFVx7NC_9lRkBWgvOOdeNPkQ-os9WoY8me5NPCPUOfi6BEJD-jEez1Ki28bS6KCI_UhGHYhsMHq2G0KpcqkbWdLZ0M4lrEVlSgzGor_G0tO_8gswvPEWv5vzd7MHAqf494plH7MMy_nUzP9_0WfgTICfAa
linkProvider	Unpaywall
linkToUnpaywall	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS9xAEB_0fKgvXmsrntqyLeJbbJL9SPIgcojHUaz4oKBPYb-CYMwdXk7Rv97ZZHOclkLpa3ZYNpmdnd9kdn4DsB9rF3VIExShLgImQhtk3KoAfbEUImYmbtq3_T4X4yv265pfr0Da1cKYEue5b1L4zqanpvCEtvwnHqQIXrJj41jkJ9Ic1Q9zuwprgiMK78Ha1fnF8KZh3aQMld_GWpwnQUIpbetll-d544hWb901yCWM-WFeTeXzkyzLJXcz6sNNt9D2lsnd4bxWh_rlHYfj_7zJR9jwGJQM203zCVZstQn9rr8D8eb-GfhIzmoiK0Oa-6aqtOQMj090dgShLmlqdx0LJhkuZSNmX-BydHp5Mg58m4VAU07rgMpESSqLKFaaKs0LoTEucWkuLhOqZJhmsdAMoZY1wjAdZ6EULFTUUKOMpVvQqyaV3QaCUEeG1iZxnEXMpjotIqGKVOkkKhAeqwEcdJ88156C3HXCKPO2PJrn_ssMgCwEpy3rxp8iP1Bni1HHkj0enuXuGfpcBCUieYwGsNepNPe2OcsjPFIThmEbDn9fDKNVuVSJrOxk7mQQ1yK2ogJlFlvhb2vZ-QeZXVhHrOX_3uxBz6n8K-KZWn3zW_cVTxvuhg
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=Fast+and+Portable+Locking+for+Multicore+Architectures&rft.jtitle=ACM+transactions+on+computer+systems&rft.au=Lozi%2C+Jean-Pierre&rft.au=David%2C+Florian&rft.au=Thomas%2C+Gaeel&rft.au=Lawall%2C+Julia&rft.date=2016-01-01&rft.issn=0734-2071&rft.eissn=1557-7333&rft.volume=33&rft.issue=4&rft.spage=1&rft.epage=62&rft_id=info:doi/10.1145%2F2845079&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0734-2071&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0734-2071&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0734-2071&client=summon