The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems (Abstract)
Pages 25 - 26
Abstract
Traditionally, distributed and parallel transactional systems have been studied in isolation, as they targeted different applications and experienced different bottlenecks. However, modern fast networks have made the study of systems that are both distributed (i.e., employ multiple nodes) and parallel (i.e., employ multiple cores per node) necessary to truly make use of the available hardware. In this paper, we study the performance of these combined systems and show that there are inherent tradeoffs between a system's ability to have fast and robust distributed communication and its ability to scale to multiple cores.
References
[1]
REFERENCES [1] H. Attiya and P. Fatourou. Disjoint-access parallelism in software transactional memory. In Transactional Memory. Foundations, Algorithms, Tools, and Applications, pages 72--97. Springer, 2015.
[2]
H. Attiya and E. Hillel. The cost of privatization in software transactional memory. IEEE Transactions on Computers, 62(12):2531--2543, 2012.
[3]
T. Kraska, G. Pang, M. J. Franklin, S. Madden, and A. Fekete. MDCC: Multi-Data Center Consistency. In Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys '13, page 113--126, New York, NY, USA, 2013. Association for Computing Machinery.
[4]
S. Mu, L. Nelson, W. Lloyd, and J. Li. Consolidating concurrency control and consensus for commits under conflicts. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI'16, page 517--532, USA, 2016. USENIX Association.
[5]
S. Peluso, R. Palmieri, P. Romano, B. Ravindran, and F. Quaglia. Disjoint-access parallelism: Impossibility, possibility, and cost of transactional memory implementations. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pages 217--226, 2015.
[6]
A. Szekeres, M. Whittaker, J. Li, N. K. Sharma, A. Krishnamurthy, D. R. Ports, and I. Zhang. Meerkat: multicore-scalable replicated transactions following the zero-coordination principle. In Proceedings of the Fifteenth European Conference on Computer Systems, pages 1--14, 2020
Index Terms
- The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems (Abstract)
Recommendations
Software transactional memory for multicore embedded systems
LCTES '09Embedded systems, like general-purpose systems, can benefit from parallel execution on a symmetric multicore platform. Unfortunately, concurrency issues present in general-purpose programming also apply to embedded systems, protection from which is ...
On high performance distributed transactional data structures
MiddlewareDPT '13: Proceedings Demo & Poster Track of ACM/IFIP/USENIX International Middleware ConferenceWe present three protocols for developing high performance distributed transactional data structures. Our first protocol, QR-ON, incorporates the open nesting transactional model into QR, a quorum-based protocol for managing concurrency on distributed ...
Software transactional memory for multicore embedded systems
LCTES '09: Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systemsEmbedded systems, like general-purpose systems, can benefit from parallel execution on a symmetric multicore platform. Unfortunately, concurrency issues present in general-purpose programming also apply to embedded systems, protection from which is ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2024 Owner/Author.
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 bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 July 2024
Check for updates
Author Tags
Qualifiers
- Poster
Conference
SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures
June 17, 2024
Nantes, France
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 17Total Downloads
- Downloads (Last 12 months)17
- Downloads (Last 6 weeks)7
Reflects downloads up to 29 Sep 2024
Other Metrics
Citations
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.
Sign in