This Article 
 Bibliographic References 
 Add to: 
Maximum Performance Pipelines With Switchable Reservation Tables
August 1995 (vol. 44 no. 8)
pp. 1066-1069

Abstract—We describe a new technique for achieving maximum performance in pipelines which allows task initiations to follow any arbitrary cycle provided that the average time between initiations is ≤M, where M is the maximum number of reservations of any stage. This is not possible with the existing methods. The idea behind the proposed scheme is to allow different initiations to follow different reservation tables. This contrasts existing methods which require all initiations in a cycle to follow the same reservation table. We describe an algorithm for systematic construction of the reservation tables for different initiations in any cycle whose performance does not exceed the theoretical upper bound on throughput. We formally prove that the algorithm is correct and that it will always succeed in constructing the tables.

[1] J.H. Patel and E.S. Davidson, "Improving the Throughput of a Pipeline by Insertion of Delays," Proc. ACM/IEEE Int'l Symp. Computer Architecture, 1976.
[2] P.M. Kogge,The Architecture of Pipelined Computers.New York: McGraw-Hill, 1981.
[3] H.S. Stone, High-Performance Computer Architecture.Reading, Mass.: Addison-Wesley, 1990.
[4] A. El-Amawy and Y.C. Tseng,“Theory and implementation of maximum performance pipelines with switchable reservation tables,” Tech. Report No. ECE-049-AE-YT, Dept. of Elect. and Comp. Eng., Lousiana State Univ., Baton Rouge, La., 1993.

Index Terms:
Pipeline, modified reservation table, maximum throughput, switchable reservation tables, dynamic pipeline schedules, multiple reservation tables.
Yi Chang Tseng, Ahmed El-Amawy, "Maximum Performance Pipelines With Switchable Reservation Tables," IEEE Transactions on Computers, vol. 44, no. 8, pp. 1066-1069, Aug. 1995, doi:10.1109/12.403726
Usage of this product signifies your acceptance of the Terms of Use.