In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

This paper tries to generate an appropriate concurrency control program by using genetic programming (GP). Although two variables have been introduced for generating concurrency control programs, these made program generation difficult because of the explosion of combination. By limiting the usage of variables to one of two variables, an appropriate program could be generated. This method, howe...

Event-driven programs are prone to concurrency bugs due their inherent nature of handling asynchronous events. Asynchronous events introduce logical concurrency into these programs making them hard to be thoroughly tested and debugged. However, understanding the root causes and characteristics of concurrency bugs can ease the debugging process and help developers to avoid introducing them. Unfo...

In this paper we show that true concurrency is not the same as interleaving concur rency for systems that allow read access More precisely whenever two actions are interleavingly concurrent they are also truly concurrent but the converse is not al ways true due to a phenomena that we call weak con ict that allows the possibility of one writer to act in parallel with one or many readers

BACKGROUND The current debate about the role of concurrent sexual partnerships in the spread of HIV is influenced by limited or weak empirical data on concurrency. There is still uncertainty about the most basic statistics and little is known about how concurrency is changing. METHODS Longitudinal data (n=2958) with repeated concurrency measures were employed to examine the prevalence of indi...