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 | |
Publication status | Published - 1992 |