This paper studies the performance of latency insensitive systems with limited queue size, in contrast with previous studies that assumed unlimited queue size. We obtain a tight theoretical performance upper bound of such systems. This paper also proposes an efficient implementation of latency insensitive systems. Experimental results show that our implementation can always reach the theoretical performance upper bound. The results also validate the claim that the upper bound acquired through our performance analysis is tight.

Date of this Version

March 2003