A Comparison of Fast and Low Overhead Distributed Priority Locks
نویسندگان
چکیده
Distributed synchronization is necessary to coordinate the diverse activities of a distributed system. Priority synchronization is needed for real time systems, or to improve the performance of critical tasks. Practical synchronization techniques require fast response and low overhead. In this paper, we present three priority synchronization algorithms that send O(log n) messages per critical section request, and use O(logn) bits of storage per processor. Two of the algorithms are based on Li and Hudak's path compression techniques, and the third algorithm uses Raymond's xed-tree structure. Since each of the algorithms have the same theoretical complexity, we make a performance comparison to determine which of the algorithms is best under diierent loads and diierent request priority distributions. We nd that when the request priority distribution is stationary, the path-compression algorithm that uses a singly-linked list is best overall, but the the xed-tree algorithm requires fewer messages when the number of processors is small and the load is high (100% or greater). When the request priority distribution is non-stationary, the xed-tree algorithm is requires the fewest messages when the load is 100% or greater. The double-link algorithm is better when the load is low (less than 100%), or if minimizing execution time overhead is more important than minimizing message overhead.
منابع مشابه
Transient Analysis of the Single-Conductor Overhead Lines Connected to Grid-Grounded Arrester under Direct Lightning by Means of GA
In this paper, genetic algorithm-based approach for transient analysis of single transmission line connected to arrester is proposed. In this approach, the lightning channel striking the overhead line is first represented by a current source and this source is truncated by a finite set of frequency harmonies in time domain. Norton equivalent circuit viewed across arrester is then computed by me...
متن کاملApplication of Intelligent Water Drops in Transient Analysis of Single Conductor Overhead Lines Terminated to Grid-Grounded Arrester under Direct Lightning Strikes
In this paper, Intelligent water drop algorithm (IWD) is used to analyze single overhead line connected to grid-grounded arrester. In this approach, at first Norton’s equivalent circuit of the overhead line over lossy soil is computed by method of moments (MoM) and then for the problem under consideration, a nonlinear equivalent circuit in the frequency domain is proposed. Finally applying inte...
متن کاملA Fast and Low Overhead Distributed Priority Lock
Distributed synchronization is necessary to coordinate the diverse activities of a distributed system. Priority synchronization is needed for real time systems, or to improve the performance of critical tasks. We present a distributed priority lock that uses Li and Hudak's path compression methods to achieve a theoretical O(log n) messages per critical section request, where n is the number of ...
متن کاملSimple and Fast Biased Locks
Locks are typically used to ensure exclusive access to shared memory locations. Unfortunately, lock operations are expensive, so much work has been done on optimizing their performance for common access patterns. One such pattern found for e.g., is in networking applications, where there is a single thread dominating lock accesses. An important trivial case of this occurs when a single-threaded...
متن کاملUser-Space Solutions to Thread Switching Overhead
Writing communication software, which spends a significant amount of time on handling incoming messages, is difficult: Active Messages are fast, but awkward to use; traditional popup threads are easy to use, but expensive. Therefore, we have implemented a portable, hybrid upcall mechanism that is easier to use than Active Messages, yet avoids unnecessary thread switching. We allow upcalls to bl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 32 شماره
صفحات -
تاریخ انتشار 1996