English
Related papers

Related papers: NWR: Rethinking Thomas Write Rule for Omittable Wr…

200 papers

Optimistic concurrency control (OCC) can exploit the strengths of parallel hardware to provide excellent performance for uncontended transactions, and is popular in high-performance in-memory databases and transactional systems. But at high…

Databases · Computer Science 2018-11-14 Yihe Huang , Hao Bai , Eddie Kohler , Barbara Liskov , Liuba Shrira

The Total Store Order (TSO) is arguably the most widely used relaxed memory model in multiprocessor architectures, widely implemented, for example in Intel's x86 and x64 platforms. It allows processes to delay the visibility of writes…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-18 Raïssa Nataf , Yoram Moses

Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful in permissionless blockchain environments. However,…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-08 Francesco D'Amato , Giuliano Losa , Luca Zanolini

We propose a topology-aware distributed Reader-Writer lock that accelerates irregular workloads for supercomputers and data centers. The core idea behind the lock is a modular design that is an interplay of three distributed data…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-26 Patrick Schmid , Maciej Besta , Torsten Hoefler

This paper proposes important and useful results relating to the minimization of the sum of the flow-time and the tardiness of tasks or jobs with unequal release dates (occurrence date), with application to maintenance planning and…

Performance · Computer Science 2020-12-16 K. Adjallah , K. Adzakpa

This paper deals with throughput scaling laws for random ad-hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio, $\rho(n)$ of achievable network sum capacity to the sum of the point-to-point…

Information Theory · Computer Science 2007-07-13 Shuchin Aeron , Venkatesh Saligrama

Task parallelism is designed to simplify the task of parallel programming. When executing a task parallel program on modern NUMA architectures, it can fail to scale due to the phenomenon called work inflation, where the overall processing…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-01-08 Justin Deters , Jiaye Wu , Yifan Xu , I-Ting Angelina Lee

This paper presents yet another concurrency control analysis platform, CCBench. CCBench supports seven protocols (Silo, TicToc, MOCC, Cicada, SI, SI with latch-free SSN, 2PL) and seven versatile optimization methods and enables the…

Databases · Computer Science 2021-08-19 Takayuki Tanabe , Takashi Hoshino , Hideyuki Kawashima , Jun Nemoto , Masahiro Tanaka , Osamu Tatebe

We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-09-08 Alessia Milani , Miguel A. Mosteiro

We study the formal semantics of non-volatile memory in the x86-TSO architecture. We show that while the explicit persist operations in the recent model of Raad et al. from POPL'20 only enforce order between writes to the non-volatile…

Programming Languages · Computer Science 2020-10-28 Artem Khyzha , Ori Lahav

Transactional memory (TM) is a convenient synchronization tool that allows concurrent threads to declare sequences of instructions on shared data as speculative \emph{transactions} with "all-or-nothing" semantics. It is known that dynamic…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-08-18 Petr Kuznetsov , Srivatsan Ravi

Current architectures for main-memory online transaction processing (OLTP) database management systems (DBMS) typically use random scheduling to assign transactions to threads. This approach achieves uniform load across threads but it…

Databases · Computer Science 2024-09-04 Tieying Zhang , Anthony Tomasic , Andrew Pavlo

In recent years, due to the spread of multi-level non-volatile memories (NVM), $q$-ary write-once memories (WOM) codes have been extensively studied. By using WOM codes, it is possible to rewrite NVMs $t$ times before erasing the cells. The…

Information Theory · Computer Science 2016-05-18 Evyatar Hemo , Yuval Cassuto

Strictly serializable datastores greatly simplify the development of correct applications by providing strong consistency guarantees. However, existing techniques pay unnecessary costs for naturally consistent transactions, which arrive at…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-26 Haonan Lu , Shuai Mu , Siddhartha Sen , Wyatt Lloyd

Large-scale distributed computing systems face two major bottlenecks that limit their scalability: straggler delay caused by the variability of computation times at different worker nodes and communication bottlenecks caused by shuffling…

Information Theory · Computer Science 2017-07-04 Amirhossein Reisizadeh , Ramtin Pedarsani

When a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution. This cost can be from the expensive task of saving the memory's state and loading data into and out of memory. It…

Data Structures and Algorithms · Computer Science 2018-03-01 Giorgio Lucarelli , Benjamin Moseley , Nguyen Kim Thang , Abhinav Srivastav , Denis Trystram

Computing-in-Memory architectures based on non-volatile emerging memories have demonstrated great potential for deep neural network (DNN) acceleration thanks to their high energy efficiency. However, these emerging devices can suffer from…

Machine Learning · Computer Science 2022-10-10 Zheyu Yan , Xiaobo Sharon Hu , Yiyu Shi

Emerging real-time applications have driven the transition to multicore embedded systems, where tasks must share resources due to functional demands and limited availability. These resources, whether local or global, are protected within…

Operating Systems · Computer Science 2025-12-29 Nan Chen , Xiaotian Dai , Tong Cheng , Alan Burns , Iain Bate , Shuai Zhao

Emerging non-volatile main memory (NVRAM) technologies provide byte-addressability, low idle power, and improved memory-density, and are likely to be a key component in the future memory hierarchy. However, a critical challenge in achieving…

Data Structures and Algorithms · Computer Science 2019-08-22 Guy E. Blleloch , Yan Gu

Transaction processing is of growing importance for mobile and web applications. Booking tickets, flight reservation, e-Banking, e-Payment, and booking holiday arrangements are just a few examples. Due to temporarily disconnected situations…

Databases · Computer Science 2023-08-21 Fritz Laux , Martti Laiho
‹ Prev 1 3 4 5 6 7 10 Next ›