Filters








85,928 Hits in 5.9 sec

Real-time computing with lock-free shared objects

James H. Anderson, Srikanth Ramamurthy, Kevin Jeffay
1997 ACM Transactions on Computer Systems  
This article considers the use of lock-free shared objects within hard real-time systems.  ...  This work pertains to periodic, hard real-time tasks that share lock-free objects on a uniprocessor.  ...  We also thank Dave Bennett, Don Stone, and Terry Talley for helping with the experimental work described in Section 6. We also thank the anonymous referees for their helpful comments.  ... 
doi:10.1145/253145.253159 fatcat:b3w2nswrnndv7jkdbcqtgmzme4

Real-time computing with lock-free shared objects

J.H. Anderson, S. Ramamurthy, K. Jeffay
Proceedings 16th IEEE Real-Time Systems Symposium  
This paper considers the use of lock-free s h a r ed objects within hard r eal-time systems. As the name suggests, lock-free shared objects are distinguished by the fact that they are not locked.  ...  This work pertains to periodic, hard r eal-time tasks that share l o ck-free objects on a uniprocessor.  ...  We also thank Dave Bennett, Don Stone, and Terry Talley for help-ing with the experimental work described in Section 6.  ... 
doi:10.1109/real.1995.495193 dblp:conf/rtss/AndersonRJ95 fatcat:upmwlyxco5bihjjb6h67agb26e

Lock-free synchronization for dynamic embedded real-time systems

Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
2010 ACM Transactions on Embedded Computing Systems  
We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals.  ...  with lock-free.  ...  by J i ; and t acc is the maximum computation time for any object access-i.e., r for lock-based objects and s for lock-free objects.  ... 
doi:10.1145/1698772.1698781 fatcat:zk6uuxkk5ffirgulzpi7wdsmua

Lock-Free Synchronization for Dynamic Embedded Real-Time Systems

Hyeonjoong Cho, B. Ravindran, E.D. Jensen
2006 Proceedings of the Design Automation & Test in Europe Conference  
We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals.  ...  with lock-free.  ...  by J i ; and t acc is the maximum computation time for any object access-i.e., r for lock-based objects and s for lock-free objects.  ... 
doi:10.1109/date.2006.243800 dblp:conf/date/ChoRJ06 fatcat:vc3h42o7azblvdr524wralyubi

Lock-Free Synchronization for Dynamic Embedded Real-Time Systems [chapter]

Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
2008 Design, Automation, and Test in Europe  
We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals.  ...  with lock-free.  ...  by J i ; and t acc is the maximum computation time for any object access-i.e., r for lock-based objects and s for lock-free objects.  ... 
doi:10.1007/978-1-4020-6488-3_6 fatcat:l6rwbisg6nbtbcodp2rsqvyc7e

Using lock-free objects in hard real-time applications

James H. Anderson, Srikanth Ramamurthy
1995 Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95  
In 1], we propose using lock-free objects as an alternative for object sharing in real-time systems. Lock-free objects are usually implemented using \retry loops".  ...  The scheduling conditions we derive show that for hard real-time applications on a uniprocessor, lock-free objects often incur less overhead than either wait-free objects or lock-based objects implemented  ...  In 1], we propose using lock-free objects as an alternative for object sharing in real-time systems. Lock-free objects are usually implemented using \retry loops".  ... 
doi:10.1145/224964.225010 dblp:conf/podc/AndersonR95 fatcat:n3altflpljbepja23fcqm6hv5e

On utility accrual processor scheduling with wait-free synchronization for embedded real-time software

Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
2006 Proceedings of the 2006 ACM symposium on Applied computing - SAC '06  
the tradeoffs between wait-free and lock-based object sharing for UA scheduling.  ...  We present the first wait-free utility accrual (UA) real-time scheduling algorithms for embedded real-time systems.  ...  and tacc is the maximum computation time for any object access-i.e., r for lock-based objects and w for wait-free objects.  ... 
doi:10.1145/1141277.1141490 dblp:conf/sac/ChoRJ06 fatcat:mneedifiinduvk6pcg3xvbxjoy

An Optimal Real-Time Scheduling Algorithm for Multiprocessors

Hyeonjoong Cho, Binoy Ravindran, E. Jensen
2006 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)  
We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on multiprocessors.  ...  the lock-free retry, blocking time under lock-based.  ...  These drawbacks have motivated research on wait-free and lock-free object sharing in real-time systems.  ... 
doi:10.1109/rtss.2006.10 dblp:conf/rtss/ChoRJ06 fatcat:xetcgphwsfdithfzywtq7nl4yy

Lock-Free Transactions for Real-Time Systems [chapter]

James H. Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay
1997 Real-Time Database Systems  
We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-time systems can be extended to support real-time transactions on memory-resident data.  ...  We end the paper with concluding remarks in Section 4. Lock-Free Objects We begin this section by reviewing previous work on scheduling hard real-time tasks that share lock-free objects.  ...  From a real-time perspective, lock-free object implementations are of interest because they avoid priority i n versions with no kernel support.  ... 
doi:10.1007/978-1-4615-6161-3_13 fatcat:gizjcwgf3nfpvec72q6gpwg5um

Supporting lock-free synchronization in Pfair-scheduled real-time systems

Philip Holman, James H. Anderson
2006 Journal of Parallel and Distributed Computing  
We consider the use of lock-free techniques for implementing shared objects in real-time Pfair-scheduled multiprocessor systems.  ...  However, the use of such objects on real-time multiprocessors is generally considered impractical due to the need for analytical realtime guarantees.  ...  In this paper, we explain how to incorporate lock-free objects into such a system.  ... 
doi:10.1016/j.jpdc.2005.06.011 fatcat:4xuexyks4ve27nilgq2mobxt5q

Allocating Memory in a Lock-Free Manner [chapter]

Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas
2005 Lecture Notes in Computer Science  
applications How to make lock-free composite objects from "smaller" lock-free objects • Find an item in a set • Move an item between sets atomically 2005 Anders Gidenstam, Distributed Computing and  ...  synchronization Memory allocators NBmalloc Architecture Data structures Experiments Conclusions Synchronization on a shared object Lock-free and wait-free synchronization Concurrent operations  ... 
doi:10.1007/11561071_31 fatcat:jkseo22bbva47huerhjz63wtcm

Energy-Efficient Scheduling of Writers/Readers Problem with Lock-Free Objects

JING LI
2017 DEStech Transactions on Computer Science and Engineering  
To reduce energy consumption of embedded real-time system with dependent tasks caused by resource sharing, an algorithm called Writer Reader Aware Speed Assignment (WRAS) was proposed to divide tasks into  ...  The difference from prior work is the using of lock-free and wait-free protocol for synchronization, most prior researches were based on the lock-based protocol.  ...  It means that every task is released at time 0 and the relative deadline is equal to the period. The shared lock-free objects are expressed as = { 1 , 2 , … , }.  ... 
doi:10.12783/dtcse/cii2017/17265 fatcat:gtivo3dxajd5bjvh4hr43kj77a

The Non-blocking Programming Paradigm in Large Scale Scientific Computations [chapter]

Philippas Tsigas, Yi Zhang
2004 Lecture Notes in Computer Science  
Non-blocking implementations allow multiple tasks to access a shared object at the same time, but without enforcing mutual exclusion to accomplish this.  ...  Since, in non-blocking implementations of shared data objects, one process is not allowed to block another process, non-blocking shared data objects have the following significant advantages over lock-based  ...  The time spend in lock-free computing and the real computation keep the speedup nicely up to 28 processors.  ... 
doi:10.1007/978-3-540-24669-5_144 fatcat:q5yazlwvongxldthamm6ssastq

Fast Asynchronous Parallel Stochastic Gradient Descent: A Lock-Free Approach with Convergence Guarantee

Shen-Yi Zhao, Wu-Jun Li
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
AsySVRG adopts a lock-free strategy which is more efficient than other strategies with locks. Furthermore, we theoretically prove that AsySVRG is convergent with a linear convergence rate.  ...  in terms of convergence rate and computation cost.  ...  An Equivalent Synthetic Process In the lock-free case, we do not use any lock whenever one thread reads u from the shared memory or updates (writes) u in the shared memory.  ... 
doi:10.1609/aaai.v30i1.10305 fatcat:u2sa2zqyyjbuffeuhxwlx6ibwa

Integrating non-blocking synchronisation in parallel applications

Philippas Tsigas, Yi Zhang
2002 Proceedings of the third international workshop on Software and performance - WOSP '02  
Protect shared objects without using mutual exclusion. Evaluation: Micro-benchmarks shows better performance than mutual exclusion in real or simulated multiprocessor systems.  ...  Synchronisation contributes a significant part in the computation time of parallel applications.  ... 
doi:10.1145/584374.584378 fatcat:pi6w6dep6rbkjaofmbx5cmetyu
« Previous Showing results 1 — 15 out of 85,928 results