We present an integrated framework for developing real-time systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work. The first is to enable functionality for object sharing in lock-free real-time systems that is comparable to that in lockbased systems. Our main contribution toward this objective is an efficient approach for implementing multi-object lock-free operations and transactions. A second key objective of our work is to improve upon previously proposed scheduling conditions for tasks that share lock-free objects. When developing such conditions, the key issue is to bound the cost of operation "interferences". We present a general approach for doing this, base...
We present wait-free and lock-free universal constructions that allow operations to access multiple ...
Lock-free data objects have been proven to have many advantages over their lock-based counter-parts ...
This paper presents a new and practical approach to lock-free locks based on helping, which allows t...
We present an integrated framework for developing realtime systems in which lock-free algorithms are...
This paper considers the use of lock-free shared objects within hard real-time systems. As the name ...
asses both static and dynamic priority schemes. The scheduling conditions we derive show that for ha...
We consider various techniques for implementing shared objects and for accounting for object-sharing...
Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared dat...
We consider shared memory systems in which asynchronous processes cooperate with each other by commu...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Abstract: "An important class of concurrent objects are those that are lock-free, that is, whose ope...
Concurrent real-time applications are complicated since both timing and consistency constraints must...
Lock-free data objects offer several advantages over their blocking counterparts, such as beingimmun...
Lock-free data objects offer several advantages over their blocking counterparts, such as being immu...
We present wait-free and lock-free universal constructions that allow operations to access multiple ...
Lock-free data objects have been proven to have many advantages over their lock-based counter-parts ...
This paper presents a new and practical approach to lock-free locks based on helping, which allows t...
We present an integrated framework for developing realtime systems in which lock-free algorithms are...
This paper considers the use of lock-free shared objects within hard real-time systems. As the name ...
asses both static and dynamic priority schemes. The scheduling conditions we derive show that for ha...
We consider various techniques for implementing shared objects and for accounting for object-sharing...
Highly concurrent and reliable data objects are vital for parallel programming. Lock-free shared dat...
We consider shared memory systems in which asynchronous processes cooperate with each other by commu...
Multicore platforms are becoming increasingly popular in real-time systems. One of the major challen...
Abstract: "An important class of concurrent objects are those that are lock-free, that is, whose ope...
Concurrent real-time applications are complicated since both timing and consistency constraints must...
Lock-free data objects offer several advantages over their blocking counterparts, such as beingimmun...
Lock-free data objects offer several advantages over their blocking counterparts, such as being immu...
We present wait-free and lock-free universal constructions that allow operations to access multiple ...
Lock-free data objects have been proven to have many advantages over their lock-based counter-parts ...
This paper presents a new and practical approach to lock-free locks based on helping, which allows t...