Results 1 to 10 of about 238,753 (197)

On the use of non-concurrent controls in platform trials: A scoping review [PDF]

Trials 2023, 2022
Platform trials gained popularity during the last few years as they increase flexibility compared to multi-arm trials by allowing new experimental arms entering when the trial already started. Using a shared control group in platform trials increases the trial efficiency compared to separate trials.
arxiv   +1 more source

Use of Non-concurrent Common Control in Master Protocols in Oncology Trials: Report of an American Statistical Association Biopharmaceutical Section Open Forum Discussion [PDF]

Statistics in Biopharmaceutical Research 14.3 (2022): 353-357, 2022
This article summarizes the discussions from the American Statistical Association (ASA) Biopharmaceutical (BIOP) Section Open Forum that took place on December 10, 2020 and was organized by the ASA BIOP Statistical Methods in Oncology Scientific Working Group, in coordination with the US FDA Oncology Center of Excellence. Diverse stakeholders including
arxiv   +1 more source

The Canonical Amoebot Model: Algorithms and Concurrency Control [PDF]

, 2021
The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coordination and movement. Since its introduction at SPAA 2014, a growing body of literature has adapted its assumptions for a variety of problems; however, without a standardized
arxiv   +1 more source

CRIL: A Concurrent Reversible Intermediate Language [PDF]

EPTCS 387, 2023, pp. 149-167, 2023
We present a reversible intermediate language with concurrency for translating a high-level concurrent programming language to another lower-level concurrent programming language, keeping reversibility. Intermediate languages are commonly used in compiling a source program to an object code program closer to the machine code, where an intermediate ...
arxiv   +1 more source

Specifying Transaction Control to Serialize Concurrent Program Executions [PDF]

LNCS, vol. 8477, Springer 2014, pp. 142-157, 2017
We define a programming language independent transaction controller and an operator which when applied to concurrent programs with shared locations turns their behavior with respect to some abstract termination criterion into a transactional behavior.
arxiv   +1 more source

O$|$R$|$P$|$E -- A Data Semantics Driven Concurrency Control [PDF]

International Journal On Advances in Software, volume 9, numbers 1 and 2, 2016, 2023
This paper presents a concurrency control mechanism that does not follow a 'one concurrency control mechanism fits all needs' strategy. With the presented mechanism a transaction runs under several concurrency control mechanisms and the appropriate one is chosen based on the accessed data.
arxiv  

Shirakami: A Hybrid Concurrency Control Protocol for Tsurugi Relational Database System [PDF]

arXiv, 2023
Modern real-world transactional workloads such as bills of materials or telecommunication billing need to process both short transactions and long transactions. Recent concurrency control protocols do not cope with such workloads since they assume only classical workloads (i.e., YCSB and TPC-C) that have relatively short transactions.
arxiv  

Logical Concurrency Control from Sequential Proofs [PDF]

Logical Methods in Computer Science, Volume 7, Issue 3 (September 2, 2011) lmcs:986, 2011
We are interested in identifying and enforcing the isolation requirements of a concurrent program, i.e., concurrency control that ensures that the program meets its specification. The thesis of this paper is that this can be done systematically starting from a sequential proof, i.e., a proof of correctness of the program in the absence of concurrent ...
arxiv   +1 more source

C5: Cloned Concurrency Control that Always Keeps Up [PDF]

arXiv, 2022
Asynchronously replicated primary-backup databases are commonly deployed to improve availability and offload read-only transactions. To both apply replicated writes from the primary and serve read-only transactions, the backups implement a cloned concurrency control protocol. The protocol ensures read-only transactions always return a snapshot of state
arxiv  

CRDTs: Consistency without concurrency control [PDF]

arXiv, 2009
A CRDT is a data type whose operations commute when they are concurrent. Replicas of a CRDT eventually converge without any complex concurrency control. As an existence proof, we exhibit a non-trivial CRDT: a shared edit buffer called Treedoc. We outline the design, implementation and performance of Treedoc.
arxiv