Rank order filters and priority queues

A. Kaldewaij; J.T. Udding

doi:10.1007/BF02252681

Rank order filters and priority queues

A. Kaldewaij, J.T. Udding

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	99-105
Journal	Distributed Computing
Volume	6
Issue number	2
DOIs	https://doi.org/10.1007/BF02252681
Publication status	Published - 1992

Access to Document

10.1007/BF02252681

Cite this

@article{0c9cc124ba5e4d41a3fc61c0073fdf48,

title = "Rank order filters and priority queues",

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.",

author = "A. Kaldewaij and J.T. Udding",

year = "1992",

doi = "10.1007/BF02252681",

language = "English",

volume = "6",

pages = "99--105",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - Rank order filters and priority queues

AU - Kaldewaij, A.

AU - Udding, J.T.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

U2 - 10.1007/BF02252681

DO - 10.1007/BF02252681

M3 - Article

SN - 0178-2770

VL - 6

SP - 99

EP - 105

JO - Distributed Computing

JF - Distributed Computing

IS - 2

ER -

Rank order filters and priority queues

Abstract

Access to Document

Fingerprint

Cite this