نتایج جستجو برای: lock

تعداد نتایج: 14013  

2004
Keir Fraser

Mutual-exclusion locks are currently the most popular mechanism for interpro-cess synchronisation, largely due to their apparent simplicity and ease of implementation. In the parallel-computing environments that are increasingly commonplace in high-performance applications, this simplicity is deceptive: mutual exclusion does not scale well with large numbers of locks and many concurrent threads...

2011
Patrick Garrity

An object is lock-free if it guarantees that in a system where multiple threads are manipulating the object, some thread will complete its operation on the object in a finite number of steps, no matter what happens to other threads. More practically, lock-free programming is a technique to achieve thread safety without the use of locks, which are the current standard. Lock-free objects (LFOs) h...

Journal: :CoRR 2017
Trevor Brown

Techniques for Constructing Efficient Lock-free Data Structures Trevor Brown Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2017 Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which processes can help one another to complete operations, offer ...

Journal: :Chemical communications 2013
Jinbo Zhu Xuan Yang Libing Zhang Lingling Zhang Baohua Lou Shaojun Dong Erkang Wang

A novel visible multi-digit DNA keypad lock system was fabricated based on split G-quadruplex DNAzyme and silver microspheres. The final result of the keypad lock can be easily recognized by the naked eye and the number of inputs for the keypad lock can be flexibly adjusted. This molecular platform showed excellent scalability and flexibility.

2009
Evangelos Bampas Leszek Gasieniec Nicolas Hanusse David Ilcinkas Ralf Klasing Adrian Kosowski

The rotor-router model, also called the Propp machine, was first considered as a deterministic alternative to the random walk. It is known that the route in an undirected graph G = (V,E), where |V | = n and |E| = m, adopted by an agent controlled by the rotor-router mechanism forms eventually an Euler tour based on arcs obtained via replacing each edge in G by two arcs with opposite direction. ...

A. Farhadi, M. Maghroory P. Naderi

To maintain the stability trajectory of vehicles under critical driving conditions, anti lock-anti skid controllers, consisting of four anti-lock sub-controllers for each wheel and two anti-skid sub-controllers for left and right pair wheels have been separately designed. Wheel and body systems have been simulated with seven degrees of freedom to evaluate the proper functioning of controllers. ...

2006
Anthony Discolo Timothy L. Harris Simon Marlow Simon L. Peyton Jones Satnam Singh

This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell’s implementation of software transactional memory. Experimental results are presented which show that for multi-processor systems the simpler lock free implementations offer superior performance when compared to their corresponding lock based implementa...

2013
Luca Padovani

A network of processes is lock free if every message produced in it is eventually consumed and if every process waiting for a message eventually receives one. We study a type system guaranteeing that well-typed process networks are lock free. Despite its minimality, our type system subsumes existing type-based approaches for lock freedom. In particular, we show that interactions whose lock free...

Journal: :Applied optics 2017
Kiwamu Izumi Koji Arai Daisuke Tatsumi Ryutaro Takahashi Osamu Miyakawa Masa-Katsu Fujimoto

Lock acquisition of a suspended optical cavity can be a highly stochastic process and is therefore nontrivial. Guided lock is a method to make lock acquisition less stochastic by decelerating the motion of the cavity length based on an extrapolation of the motion from an instantaneous velocity measurement. We propose an improved scheme that is less susceptible to seismic disturbances by incorpo...

2001
Dietmar Schütz

The Permit based Locking design pattern provides fast acquisition and release of locks without network communication even in distributed systems build around a central lock server. Instead of plain locks, the server manages "permits to lock", and passes them to those clients which probably need the lock next. If a client hosts a permit, the associated lock can be acquired immediately without se...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید