نتایج جستجو برای: lock in
تعداد نتایج: 16977860 فیلتر نتایج به سال:
a new method for increasing ldr in deep drawing is application of anti-lock braking system (abs) on blank holder. in this method, instead of applying a constant force on blank and control the metal flow, the abs system holds and releases the blank several times (20 to 50 times) which results increasing ldr. this study investigates the effect of different parameters of abs on improving the condi...
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...
Synchronization overhead may limit the number of applications that can take advantage of a shared-memory abstraction on top of emerging network of workstation organizations. While the programmer could spend additional efforts into getting rid of such overhead by restructuring the computation, this paper focuses on a simpler approach where the overhead of lock operations is hidden through lock p...
Recent developments in the area of smart structures indicate that variable geometry / stiffness truss network is of fundamental importance in designing smart transformable structures and systems for space applications. This paper presents the conceptual design and dynamic modeling of a cooperative re-configurabel dual-arm robotic structure called Dual-Arm Cam-Lock Manipulator. The Manipulator i...
Locks are often used in parallel applications to ensure correct behavior, but frequently induce performance bottlenecks caused by contention at frequently accessed locks. There are state-of-the-art locking algorithms, whose performance under high contention is superior to that of the most commonly used ones. However, some of these have a different interface, and adopting them incurs a reimpleme...
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...
NUMA multicore machines are pervasive and many multithreaded applications are suffering from lock contention. To mitigate this issue, application and library developers can choose from the plethora of optimized mutex lock algorithms that have been designed over the past 25 years. Unfortunately, there is currently no broad study of the behavior of these optimized lock algorithms on realistic app...
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 ...
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. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید