Premium
Helenos: A realistic benchmark for distributed transactional memory
Author(s) -
Kobyliński Paweł,
Siek Konrad,
Baranowski Jan,
Wojciechowski Paweł T.
Publication year - 2018
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.2548
Subject(s) - computer science , scalability , distributed computing , benchmark (surveying) , transactional memory , usable , suite , distributed memory , concurrency control , set (abstract data type) , key (lock) , simplicity , concurrency , parallel computing , shared memory , operating system , database transaction , programming language , world wide web , philosophy , geodesy , archaeology , epistemology , history , geography
Summary Transactional memory (TM) is an approach to concurrency control that aims to make writing parallel programs both effective and simple. The approach has been initially proposed for nondistributed multiprocessor systems, but it is gaining popularity in distributed systems to synchronize tasks at large scales. Efficiency and scalability are often the key issues in TM research; thus, performance benchmarks are an important part of it. However, while standard TM benchmarks like the Stanford Transactional Applications for Multi‐Processing suite and STMBench7 are available and widely accepted, they do not translate well into distributed systems. Hence, the set of benchmarks usable with distributed TM systems is very limited, and must be padded with microbenchmarks, whose simplicity and artificial nature often makes them uninformative or misleading. Therefore, this paper introduces Helenos, a realistic, complex, and comprehensive distributed TM benchmark based on the problem of the Facebook inbox, an application of the Cassandra distributed store.