research-article

Effective use of non-blocking data structures in a deduplication application

Authors:

Steven D. Feldman,

Pierre LaBorde,

Damain DechevAuthors Info & Claims

SPLASH '13: Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity

Pages 133 - 142

https://doi.org/10.1145/2508075.2508431

Published: 26 October 2013 Publication History

Abstract

Efficient multicore programming demands fundamental data structures that support a high degree of concurrency. Existing research on non-blocking data structures promises to satisfy such demands by providing progress guarantees that allow a significant increase in parallelism while avoiding the safety hazards of lock-based synchronizations. It is well-acknowledged that the use of non-blocking containers can bring significant performance benefits to applications where the shared data experience heavy contention. However, the practical implications of integrating these data structures in real-world applications are not well-understood. In this paper, we study the effective use of non-blocking data structures in a data deduplication application which performs a large number of concurrent compression operations on a data stream using the pipeline parallel processing model. We present our experience of manually refactoring the application from using conventional lock-based synchronization mechanisms to using a wait-free hash map and a set of lock-free queues to boost the degree of concurrency of the application. Our experimental study explores the performance trade-offs of parallelization mechanisms that rely on a) traditional blocking techniques, b) fine-grained mutual exclusion, and c) lock-free and wait-free synchronization.

References

[1]

D. Dechev and B. Stroustrup, "Scalable Nonblocking Concurrent Objects for Mission Critical Code," in OOPSLA '09: Proceedings of the ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications, 2009.

Digital Library

[2]

M. Herlihy and N. Shavit, The Art of Multiprocessor Programming. Morgan Kaufmann, March 2008. {Online}. Available: www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0123705916

Digital Library

[3]

D. Dechev, A Concurrency and Time Centered Framework for Autonomous Space Systems. LAP LAMBERT Academic Publishing, August 2010.

Digital Library

[4]

D. Dechev, P. Pirkelbauer, and B. Stroustrup, "Lock-Free Dynamically Resizable Arrays," in OPODIS, ser. Lecture Notes in Computer Science, A. A. Shvartsman, Ed., vol. 4305. Springer, 2006, pp. 142--156.

Digital Library

[5]

K. Fraser and T. Harris, "Concurrent programming without locks," ACM Trans. Comput. Syst., vol. 25, no. 2, p. 5, 2007. {Online}. Available: www.ddj.com/dept/cpp/184401890

Digital Library

[6]

M. Michael, "CAS-Based Lock-Free Algorithm for Shared Deques," in Euro-Par 2003: The Ninth Euro-Par Conference on Parallel Processing, LNCS volume 2790, 2003, pp. 651--660.

[7]

P. Tsigas and Y. Zhang, "The non-blocking programming paradigm in large scale scientific computations," in PPAM, 2003, pp. 1114--1124.

[8]

C. Bienia and K. Li, "Parsec 2.0: A new benchmark suite for chip- multiprocessors," in Proceedings of the 5th Annual Workshop on Modeling, Benchmarking and Simulation, June 2009.

[9]

Intel, "Intel Threading Building Blocks," threadingbuildingblocks.org/, November 2011. {Online}. Available: threadingbuildingblocks.org/

[10]

M. Moir and N. Shavit, Handbook of Data Structures and Applications. Chapman and Hall/CRC Press, 2007, ch. Concurrent Data Structures, pp. 47--1--47--30.

[11]

M. Herlihy, "Wait-Free Synchronization," in Trans. on Programming Languages and Systems. ACM, 1991, pp. 124--149.

Digital Library

[12]

D. Dechev, "The ABA Problem in Multicore Data Structures with Collaborating Operations," in Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2011), 2011.

[13]

S. Feldman, P. LaBorde, and D. Dechev, UCF Technical Report (cse.eecs.ucf.edu/private/UCF-TechReport-HashTable.pdf). Retrieved 04/05/2013.

[14]

S. Feldman, P. LaBorde, and D. Dechev, "A Lock-Free Concurrent Hash Table Design for Effective Information Storage and Retrieval on Large Data Sets," in Proceedings of the 15th Annual High Performance Computing Workshop (HPEC 2011), 2011.

[15]

D. Lea, "Concurrenthashmap," gee.cs.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/ConcurrentHashMap.html, May 2013.

[16]

M. M. Michael and M. L. Scott, "Simple, fast, and practical non- blocking and blocking concurrent queue algorithms," in Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, ser. PODC '96. New York, NY, USA: ACM, 1996, pp. 267--275. {Online}. Available: doi.acm.org/10.1145/248052.248106

Digital Library

[17]

M. M. Michael, "Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects," IEEE Trans. Parallel Distrib. Syst., vol. 15, no. 6, pp. 491--504, 2004. {Online}. Available: www.research.ibm.com/people/m/michael/ieeetpds-2004.pdf

Digital Library

[18]

Linux User's Manual, "mpstat," linuxcommand.org/manpages/mpstat1.html, May 2013.{

[19]

P. Tsigas and Y. Zhang, "Integrating non-blocking synchronisation in parallel applications: performance advantages and methodologies," in Proceedings of the 3rd international workshop on Software and performance, ser. WOSP '02. New York, NY, USA: ACM, 2002, pp. 55--67. {Online}. Available: doi.acm.org/10.1145/584369.584378

Digital Library

[20]

S. Woo, M. Ohara, E. Torrie, J. Singh, and A. Gupta, "The splash-2 programs: Characterization and methodological considerations," in 22nd International Symposium on Computer Architectures, June 1995, pp. 24--36.

Digital Library

[21]

D. R. O'Hallaron, "Spark98: Sparse matrix kernels for shared memory and message passing systems," Tech. Rep. CMU-CS-97-178, October 1997.

[22]

B. Lim and A. Agarwal, "Reactive synchronization algorithms for multiprocessors," in Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, October 1994, pp. 25--35.

Digital Library

[23]

M. M. Michael and M. L. Scott, "Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multi- processors," in Journal of Parallel and Distributed Computing, vol. 51, no. 1, 1998, pp. 1--26.

Digital Library

[24]

T. L. Harris, "A pragmatic implementation of non-blocking linked- lists," in Proceedings of the 15th International Conference on Dis- tributed Computing, ser. DISC '01. London, UK: Springer- Verlag, 2001, pp. 300--314.

Digital Library

[25]

M. M. Michael, "High performance dynamic lock-free hash tables and list-based sets," in SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. New York, NY, USA: ACM Press, 2002, pp. 73--82.

Digital Library

[26]

H. Sundell and P. Tsigas, "Lock-free deques and doubly linked lists," J. Parallel Distrib. Comput., vol. 68, pp. 1008--1020, July 2008.

Digital Library

[27]

Microsoft, "System.collections.concurrent namespace," Microsoft, 2011, .NET Framework 4. {Online}. Available: msdn.microsoft.com/en-us/library/system.collections.concurrent.aspx

[28]

D. Hendler, N. Shavit, and L. Yerushalmi, "A scalable lock-free stack algorithm," J. Parallel Distrib. Comput., vol. 70, pp. 1--12, January 2010.

Digital Library

[29]

H. Gao, J. Groote, and W. Hesselink, "Almost wait-free resizable hashtables," in Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, april 2004, p. 50.

[30]

O. Shalev and N. Shavit, "Split-ordered lists: Lock-free extensible hash tables," in PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing. New York, NY, USA: ACM Press, 2003, pp. 102--111.

Digital Library

[31]

K. Fraser, "Practical lock-freedom," in Computer Laboratory, Cam- bridge Univ, 2004.

[32]

D. Dechev, P. Pirkelbauer, and B. Stroustrup, "Lock-free dynamically resizable arrays," in Principles of Distributed Systems, ser. Lecture Notes in Computer Science, M. Shvartsman, Ed. Springer Berlin / Heidelberg, 2006, vol. 4305, pp. 142--156. {Online}. Available: dx.doi.org/10.1007/1194552911.

Cited By

Zhang JYi QPeterson CDechev D(2023)Compiler‐driven approach for automating nonblocking synchronization in concurrent data abstractionsConcurrency and Computation: Practice and Experience10.1002/cpe.793536:5Online publication date: 24-Oct-2023
https://doi.org/10.1002/cpe.7935
Zhang JWang QYi QCui H(2019)Automating the Exchangeability of Shared Data AbstractionsLanguages and Compilers for Parallel Computing10.1007/978-3-030-34627-0_14(185-192)Online publication date: 13-Nov-2019
https://doi.org/10.1007/978-3-030-34627-0_14
Zhang YYu YCao HChen JZhang Q(2017)CHAUS: Scalable VM-Based Channels for Unbounded StreamingJournal of Computer Science and Technology10.1007/s11390-017-1801-432:6(1288-1304)Online publication date: 8-Dec-2017
https://doi.org/10.1007/s11390-017-1801-4
Show More Cited By

Index Terms

Effective use of non-blocking data structures in a deduplication application
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Parallel programming languages

Recommendations

Lock-free and scalable multi-version software transactional memory
PPoPP '11

Software Transactional Memory (STM) was initially proposed as a lock-free mechanism for concurrency control. Early implementations had efficiency limitations, and soon obstruction-free proposals appeared, to tackle this problem, often simplifying STM ...
Pragmatic primitives for non-blocking data structures
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems. The new operations operate on a set of Data-records, each of which contains multiple fields. The ...
Lock-free and scalable multi-version software transactional memory
PPoPP '11: Proceedings of the 16th ACM symposium on Principles and practice of parallel programming

Software Transactional Memory (STM) was initially proposed as a lock-free mechanism for concurrency control. Early implementations had efficiency limitations, and soon obstruction-free proposals appeared, to tackle this problem, often simplifying STM ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPLASH '13: Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity

October 2013

192 pages

ISBN:9781450319959

DOI:10.1145/2508075

Co-chair:
Antony Hosking
Purdue University, USA
,
General Chair:
Patrick Eugster
Purdue University, USA

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part 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 bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 October 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPLASH '13

Sponsor:

SIGPLAN

SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity

October 26 - 31, 2013

Indiana, Indianapolis, USA

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
159
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang JYi QPeterson CDechev D(2023)Compiler‐driven approach for automating nonblocking synchronization in concurrent data abstractionsConcurrency and Computation: Practice and Experience10.1002/cpe.793536:5Online publication date: 24-Oct-2023
https://doi.org/10.1002/cpe.7935
Zhang JWang QYi QCui H(2019)Automating the Exchangeability of Shared Data AbstractionsLanguages and Compilers for Parallel Computing10.1007/978-3-030-34627-0_14(185-192)Online publication date: 13-Nov-2019
https://doi.org/10.1007/978-3-030-34627-0_14
Zhang YYu YCao HChen JZhang Q(2017)CHAUS: Scalable VM-Based Channels for Unbounded StreamingJournal of Computer Science and Technology10.1007/s11390-017-1801-432:6(1288-1304)Online publication date: 8-Dec-2017
https://doi.org/10.1007/s11390-017-1801-4
Feldman SLaBorde PDechev D(2015)Tervel: A unification of descriptor-based techniques for non-blocking programming2015 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS)10.1109/SAMOS.2015.7363668(131-140)Online publication date: Jul-2015
https://doi.org/10.1109/SAMOS.2015.7363668

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents