Opportunistic Merge Element

Mokhov, A; Khomenko, V; Sokolov, D; Yakovlev, A

doi:10.1109/ASYNC.2015.25

Opportunistic Merge Element

Lookup NU author(s): Dr Andrey Mokhov, Dr Victor Khomenko, Dr Danil Sokolov, Professor Alex Yakovlev ORCiD

Downloads

Accepted version [.pdf]

Licence

This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by IEEE Computing Society Press, 2015.

For re-use rights please refer to the publisher's terms and conditions.

Abstract

The paper introduces a new reusable asynchronous component, called Opportunistic Merge element, that merges two or more request-acknowledgement channels into one and is allowed to opportunistically bundle requests from different input channels if they arrive sufficiently close to each other. We present a speed-independent implementation of this component and verify some of its correctness properties. An important characteristic of the presented implementation is that the arbitration is removed from the critical path, thereby providing a fast response to the incoming requests.