Algebraic Models of Superscalar Microprocessor Implementations: A Case Study

  • Authors:
  • Anthony C. J. Fox;Neal A. Harman

  • Affiliations:
  • -;-

  • Venue:
  • Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend a set of algebraic tools for representing microprocessors to model superscalar microprocessor implementations, and apply them to a case study. We develop existing correctness models to accommodate the more advanced timing relationships of superscalar processors, and consider formal verication. We illustrate our tools and techniques with an in-depth treatment of an example superscalar implementation. We use clocks to divide time into (not necessarily equal) segments, defined by the natural timing of the computational process of a device. We formally relate clocks by surjective, monotonic maps called retimings. In the case of superscalar microprocessors, the normal relationship between 'architectural time' and 'implementation time' is complicated by the fact that events that are distinct in time at the architectural level can occur simultaneously at the implementation level.