Výsledky vyhledávání - "concurrent algorithms"

Auto-active verification of distributed systems and specification refinements with Why3-do Autor Belo Lourenço, Cláudio, Sousa Pinto, Jorge

“…In this paper, we introduce a novel approach for rigorously verifying safety properties of state machine specifications. Our method leverages an auto-active…”
Získat plný text

RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures Autor Arovi, Md Amit Hasan, Nikolaev, Ruslan

“…Traditionally, most concurrent algorithms rely on safe memory reclamation (SMR) schemes for manual memory management. SMR schemes such as epoch-based…”
Získat plný text

Tasks in modular proofs of concurrent algorithms Autor Castañeda, Armando, Hurault, Aurélie, Quéinnec, Philippe, Roy, Matthieu

“…Proving the correctness of distributed or concurrent algorithms is a complex process. Errors in the reasoning are hard to find, calling for computer-checked…”
Získat plný text

Concurrent Immediate Reference Counting Autor Jung, Jaehwang, Kim, Jeonghyeon, Parkinson, Matthew J., Kang, Jeehoon

“…Memory management for optimistic concurrency in unmanaged programming languages is challenging. Safe memory reclamation (SMR) algorithms help address this, but…”
Získat plný text

A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation Autor Nikolaev, Ruslan, Ravindran, Binoy

“…Historically, memory management based on lock-free reference counting was very inefficient, especially for read-dominated workloads. Thus, approaches such as…”
Získat plný text

A Concurrent Approach to String Transformation Synthesis Autor Ding, Yuantian, Qiu, Xiaokang

“…Program synthesis aims at the automatic generation of programs based on given specifications. Despite significant progress, the inherent complexity of…”
Získat plný text

Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic Autor Jung, Jaehwang, Lee, Janggun, Choi, Jaemin, Kim, Jaewoo, Park, Sunho, Kang, Jeehoon

“…Formal verification is an effective method to address the challenge of designing correct and efficient concurrent data structures. But verification efforts…”
Získat plný text

Fast and Portable Concurrent FIFO Queues With Deterministic Memory Reclamation Autor Giersch, Oliver, Nolte, Jorg

“…In this article we present an algorithm for a high performance, unbounded, portable, multi-producer/multi-consumer, lock-free FIFO (first-in first-out) queue…”
Získat plný text

HADES: Hardware-Assisted Distributed Transactions in the Age of Fast Networks and SmartNICs Autor Kokolis, Apostolos, Psistakis, Antonis, Reidys, Benjamin, Huang, Jian, Torrellas, Josep

“…Transactional-based distributed storage applications such as key-value stores and databases are widely used in the cloud. Recently, the hardware on which these…”
Získat plný text

Concurrent Data Structures Made Easy Autor Le, Callista, Gopinathan, Kiran, Lee, Koon Wen, Gilbert, Seth, Sergey, Ilya

“…Design of an efficient thread-safe concurrent data structure is a balancing act between its implementation complexity and performance. Lock-based concurrent…”
Získat plný text

Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals Autor Lee, Janggun, Kim, Jeonghyeon, Kang, Jeehoon

“…Hazard pointers (HP) is one of the earliest manual memory reclamation algorithms for concurrent data structures. It is widely used for its robustness: memory…”
Získat plný text

A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability Autor Jayanti, Prasad, Jayanti, Siddhartha, Yavuz, Ugur Y., Hernandez, Lizzie

“…We introduce simple, universal, sound, and complete proof methods for producing machine-verifiable proofs of linearizability and strong linearizability…”
Získat plný text

Separating Mechanism from Policy in STM Autor Sheng, Yaodong, Hassan, Ahmed, Spear, Michael

“…When designing concurrent data structures (CDSs), it can feel like programmers must choose between performance and convenience. On one hand, Software…”
Získat plný text

Hardware Support for Durable Atomic Instructions for Persistent Parallel Programming Autor Hadi, Khan Shaikhul, Ul Mustafa, Naveed, Heinrich, Mark, Solihin, Yan

“…Persistent memory is emerging as an attractive main memory fabric capable of hosting persistent data. However, its programmability is hampered by the lack of…”
Získat plný text

DRPTM: A Decoupled Read-efficient High-scalable Persistent Transactional Memory Autor Liang, Wenkai, Hu, Hao, Zou, Xiangyu, Xia, Wen, Pan, Yanqi

“…Persistent transactional memory (PTM) exploits transactions to provide an easy crash-consistent interface for persistent memory (PM). However, because of the…”
Získat plný text

Scenario-Based Proofs for Concurrent Objects Autor Enea, Constantin, Koskinen, Eric

“…Concurrent objects form the foundation of many applications that exploit multicore architectures and their importance has lead to informal correctness…”
Získat plný text

Proving highly-concurrent traversals correct Autor Feldman, Yotam M. Y., Khyzha, Artem, Enea, Constantin, Morrison, Adam, Nanevski, Aleksandar, Rinetzky, Noam, Shoham, Sharon

“…Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data…”
Získat plný text

Concurrent size Autor Sela, Gal, Petrank, Erez

“…The size of a data structure (i.e., the number of elements in it) is a widely used property of a data set. However, for concurrent programs, obtaining a…”
Získat plný text

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom Autor Glabbeek, Rob van, Hofner, Peter, Horne, Ross

“…We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix…”
Získat plný text

Concurrent use of write-once memory Autor Aspnes, James, Censor-Hillel, Keren, Yaakobi, Eitan

“…We consider the problem of implementing general shared-memory objects on top of write-once bits, which can be changed from 0 to 1 but not back again. In a…”
Získat plný text