A Streaming High-Throughput Linear Sorter System with Contention Buffering

<table>Sorter node interface. <svg height="11.175" id="M41" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 13.775 11.175" width="13.775" 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="M780 372q0 -191 -178 -297q-128 -75 -335 -75h-250l7 27q61 7 77 22t28 76l77 398q11 62 0 76.5t-77 22.5l6 28h292q164 0 258.5 -67.5t94.5 -210.5zM678 375q0 119 -73 180.5t-201 61.5q-62 0 -82 -13q-17 -7 -25 -53l-80 -427q-8 -47 -4 -62t26 -20q24 -6 80 -6
q166 0 262.5 95t96.5 244z" id="x1D437"></path></g>
</svg> = Data Width, <svg height="11.6125" id="M42" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 11.45 11.6125" width="11.45" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.55)"><path d="M649 676l-22 -187l-33 -2q3 56 -12 94q-8 20 -31.5 26.5t-86.5 6.5h-74l-90 -491q-4 -23 -6 -36.5t1 -25t7 -16.5t18 -9t27 -5t41 -3l-6 -28h-286l4 28q68 5 84 18.5t28 76.5l94 491h-55q-74 0 -100.5 -6t-41.5 -23q-24 -29 -54 -98l-32 1q32 98 53 188h22q7 -18 15 -22
t37 -4h417q23 0 33.5 5t25.5 21h23z" id="x1D447"></path></g>
</svg> = Tag Width.</table>

International Journal of Reconfigurable Computing

fig7

Figure 7

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