Victor Bushkov

Learn More
Transactional memory (TM) [11, 15] allows concurrent processes to execute operations on data items within atomic blocks of instructions, called transactions. A transaction may either commit in which case all its updates become visible to other transactions, or abort in which case all its updates are discarded. The paradigm is appealing for its simplicity(More)
We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condition, called weak adaptive consistency, introduced here and which is weaker than snapshot isolation,(More)
The celebrated distributed computing approach for building systems and services using multiple machines continues to expand to new domains. Computation devices nowadays have additional sensing and communication capabilities, while becoming, at the same time, cheaper, faster and more pervasive. Consequently, areas like industrial control, smart grids and(More)
The present paper reports the results of the application of measurements of cadaveric tissue pressure (CTP) in forensic medical thanatology for the determination of the initial position of the corpse and the identification of the visually undetectable bleeding sites on the scalp during examination at the place of its discovery. Moreover, the study of the(More)
In this paper we consider the supervisory control problem through language equation solving. The equation solving approach allows to deal with more general topologies and to find a largest supervisor which can be used as a reservoir for deriving an optimal controller. We introduce the notions of solutions under partial controllability and partial(More)
Transactional memory (TM) [9, 8] is an alternative to fine-grained and coarse-grained locking that provides users with an abstraction called a transaction. Transactions are atomic pieces of code that appear as if they are executed at some point in time. They can be aborted or committed. If a transaction is committed, then all changes made by operations(More)
The recent proliferation of multi-core processors has moved concurrent programming into mainstream by forcing increasingly more programmers to write parallel code. Using traditional concurrency techniques, such as locking, is notoriously difficult and has been considered the domain of a few experts for a long time. This discrepancy between the established(More)
  • 1