Article thumbnail

Rank Order Filters and Priority Queues

By Anne Kaldewaij and Jan Tijmen Udding

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

Publisher: Washington University Open Scholarship
Year: 1991
OAI identifier: oai:openscholarship.wustl.edu:cse_research-1638

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles