Latest revision as of 10:24, 8 February 2021

Abstract

Pipelines are widely used to increase throughput in multi-core chips by parallelizing packet processing. Typically, each packet type is serviced by a dedicated pipeline. However, with the increase in the number of packet types and their number of required services, there are not enough cores for pipelines. In this paper, we study pipeline sharing, such that a single pipeline can be used to serve several packet types. Pipeline sharing decreases the needed total number of cores, but typically increases pipeline lengths and therefore packet delays. We consider the optimization problem of allocating cores between different packet types such that the average delay is minimized. We suggest a polynomial-time algorithm that finds the optimal solution when the packet types preserve a specific property. We also present a greedy algorithm for the general case. Last, we examine our solutions on synthetic examples, on packet-processing applications, and on real-life H.264 standard requirements.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1109/HOTI.2013.10

• http://www.hoti.org/hoti21/slides/Rottenstreich.pdf,

http://webee.technion.ac.il/~isaac/p/hoti13_pipelines.pdf,

https://ieeexplore.ieee.org/document/6627730,

https://dl.acm.org/citation.cfm?id=2548004,

https://dblp.uni-trier.de/db/conf/hoti/hoti2013.html#RottenstreichKRK13,

https://academic.microsoft.com/#/detail/2061455460

• http://xplorestaging.ieee.org/ielx7/6626675/6627714/06627730.pdf?arnumber=6627730,

http://dx.doi.org/10.1109/hoti.2013.10