Rank order filters and priority queues

A. Kaldewaij, J.T. Udding

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)


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.
Original languageEnglish
Pages (from-to)99-105
JournalDistributed Computing
Issue number2
Publication statusPublished - 1992


Dive into the research topics of 'Rank order filters and priority queues'. Together they form a unique fingerprint.

Cite this