Randomized Priority Queues for Fast Parallel Access
نویسنده
چکیده
We present simple randomized algorithms for parallel priority queues on distributed memory machines. Inserting O(n) elements or deleting the O(n) out of m smallest elements using n pocessors requires O (
منابع مشابه
Fast Priority Queues for Parallel Branch-and-Bound
Currently used parallel best rst branch-and-bound algorithms either suuer from contention at a centralized priority queue or can only approximate the best rst strategy. Bottleneck free algorithms for parallel priority queues are known but they cannot be implemented very eeciently on contemporary machines. We present quite simple randomized algorithms for parallel priority queues on distributed ...
متن کاملFast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent priority queues are based on mutual exclusion. However, mutual exclusion causes blocking which has several drawbacks and degrades the overall perform...
متن کاملWorst Case Efficient Data Structures
We study the design of efficient data structures. In particular we focus on the design of data structures where each operation has a worst case efficient implementations. The concrete problems we consider are partial persistence, implementation of priority queues, and implementation of dictionaries. The first problem we consider is how to make bounded in-degree and out-degree data structures pa...
متن کاملPriority Queues on Parallel Machines
We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one proces-and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O(n= log n) processors and k elements can be inserted into a priority queue in time O(log k) with O((log n + k)= log k) processors. With a slowdown of O(log log n) in...
متن کاملChapter 5 Fast and Lock - Free Concurrent Priority Queues for Multi - Thread Systems 1
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multiprocessor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent priority queues are based on mutual exclusion. However, mutual exclusion causes blocking which has several drawbacks and degrades the system’s overall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 49 شماره
صفحات -
تاریخ انتشار 1998