Efficient Low-Contention Parallel Algorithms
نویسندگان
چکیده
منابع مشابه
Efficient Low-Contention Parallel Algorithms
The queue-read queue-write asyn-chronous PRAM model. Parallel algorithms for shared-memory machines. The design and analysis of a new hybrid sorting algorithm. A new universal class of hash functions and dynamic hashing in real time. NYU Ultracomputer { designing an MIMD shared memory parallel computer. In this paper we have presented highly parallel work-optimal algorithms for several fundamen...
متن کاملE cient Low Contention Parallel Algorithms
The queue read queue write qrqw parallel random access machine pram model permits concurrent reading and writing to shared memory locations but at a cost propor tional to the number of readers writers to any one memory location in a given step The qrqw pram model re#ects the contention properties of most commercially available par allel machines more accurately than either the well studied crcw...
متن کاملDelay Analysis of Multichannel Parallel Contention Tree Algorithms (MP-CTA)
Contention tree algorithm is initially invented as a solution to improve the stable throughput problem of Slotted ALOHA in multiple access schemes. Even though the throughput is stabilized in tree algorithms, the delay of requests may grow to infinity with respect to the arrival rate of the system. Delay depends heavily on the exploration of the tree structure, i.e., breadth search, or depth se...
متن کاملWork efficient parallel scheduling algorithms
Scheduling the execution of parallel algorithms on parallel computers is a main issue in current research. Parallel computers can be used to solve scheduling problems very fast and we might be able to tackle new applications, where schedules must be obtained very quickly. Although the importance of parallel scheduling algorithms has been widely recognized, only few results have been obtained so...
متن کاملEfficient Parallel Convex Hull Algorithms
A bstract-In this paper, we present parallel algorithms to identifv (i.e., detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, EREW PRAM, and a modified AKS network. It is known that the problem of identifying the convex hull for a set of planar points given arbitrarily cannot be sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0079