Maximum performance pipelines with switchable reservation tables

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 /spl les/M, where M is the maximum number of reservations of any stage. This is not possible with the existing...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1995-08, Vol.44 (8), p.1066-1069
Main Authors: El-Amawy, A., Yi Chang Tseng
Format: Article
Language:English
Subjects:
Applied sciences
Clocks
Computers, microcomputers
Delay
Dynamic scheduling
Electronics
Exact sciences and technology
Fasteners
Hardware
Pipelines
Steady-state
Throughput
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 /spl les/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.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.403726