Rank order filters and priority queues

Authors:
Anne Kaldewaij;Jan Tijmen Udding
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands and Department of Computer Science, Washington University, ...;Department of Computer Science, Washington University, Campus Box 1045, St Louis, MO
Venue:
Distributed Computing
Year:
1992

Citing 4
Cited 0

Communicating sequential processes

Communicating sequential processes
VLSI array processors

VLSI array processors
The derivation of systolic computations

Science of Computer Programming
Trace Theory and Systolic Computations

Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures PARLE

Quantified Score

Hi-index	0.00

Visualization

Abstract

A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency.