A Streaming High-Throughput Linear Sorter System with Contention Buffering

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="963539.fig.001a" src="https://static.hindawi.com/articles/ijrc/volume-2011/963539/figures/963539.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Bubble</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="963539.fig.001b" src="https://static.hindawi.com/articles/ijrc/volume-2011/963539/figures/963539.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Insertion</td></tr></table></td></tr></table>

<table>Sorting networks of size <svg height="11.3125" id="M12" style="vertical-align:-0.1092pt" version="1.1" viewbox="0 0 14.9875 11.3125" width="14.9875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M857 650l-6 -28q-44 -4 -61.5 -16.5t-29.5 -48.5q-11 -32 -37 -166l-78 -399h-29l-351 537h-4l-56 -276q-24 -120 -24 -164q0 -35 17.5 -46t75.5 -15l-6 -28h-245l7 28q41 2 62 14t31 44q10 30 41 171l53 245q8 44 6.5 60.5t-14.5 33.5q-10 15 -27 19.5t-64 6.5l6 28h153
l350 -516h5l48 257q25 131 25 171q0 34 -17.5 45t-77.5 15l7 28h240z" id="x1D441"></path></g>
</svg>.</table>

International Journal of Reconfigurable Computing

fig1

Figure 1

Figure 1: A Streaming High-Throughput Linear Sorter System with Contention Buffering 