Algebraic models for advanced microprocessors
In this thesis, algebraic methods are used to model advanced microprocessor organisations. Correctness is defined by modelling computer systems at two levels of abstraction: the abstract circuit level, and the programmer's model level. The abstract circuit corresponds with a microprocessor orga...
Main Author: | |
---|---|
Published: |
Swansea University
1999
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.637000 |
id |
ndltd-bl.uk-oai-ethos.bl.uk-637000 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-bl.uk-oai-ethos.bl.uk-6370002015-03-20T05:32:21ZAlgebraic models for advanced microprocessorsFox, A. C. J.1999In this thesis, algebraic methods are used to model advanced microprocessor organisations. Correctness is defined by modelling computer systems at two levels of abstraction: the abstract circuit level, and the programmer's model level. The abstract circuit corresponds with a microprocessor organisation, or micro-architecture; and the programmer's model corresponds with a computer architecture. Computer architectures provide stability at the interface between software and hardware; this is achieved by establishing a (relatively) constant target for program compilation, and for future processor development. For commercial viability most new processors must correctly implement an established architecture; in this way the processor guarantees the seamless support of an existing software base. This thesis formally defines the correctness of processors, including those of superscalar design. With the ever increasing need for computing power, superscalar designs are used in many personal computers, and even in embedded applications. Super-scalar designs use long instruction pipelines and multiple functional units to achieve high degrees of instruction-level parallelism; they can execute instructions simultaneously, or in some cases out-of-order. This thesis explores the nature of temporal abstraction for pipelined and super-scalar computer organisations. A superscalar case study is presented; this design provides for out-of-order instruction issue, and uses Thornton's algorithm. This thesis also provides a structured framework for processor verification. With the suitable use of initialisation functions, and temporal abstractions, it is shown that correctness can be verified without the explicit use of temporal induction. In addition to studying the control (temporal) aspects of processors, this thesis also addresses data issues and presents an (abbreviated) algebraic specification of the IEEE-754 floating-point standard.004.01Swansea University http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.637000Electronic Thesis or Dissertation |
collection |
NDLTD |
sources |
NDLTD |
topic |
004.01 |
spellingShingle |
004.01 Fox, A. C. J. Algebraic models for advanced microprocessors |
description |
In this thesis, algebraic methods are used to model advanced microprocessor organisations. Correctness is defined by modelling computer systems at two levels of abstraction: the abstract circuit level, and the programmer's model level. The abstract circuit corresponds with a microprocessor organisation, or micro-architecture; and the programmer's model corresponds with a computer architecture. Computer architectures provide stability at the interface between software and hardware; this is achieved by establishing a (relatively) constant target for program compilation, and for future processor development. For commercial viability most new processors must correctly implement an established architecture; in this way the processor guarantees the seamless support of an existing software base. This thesis formally defines the correctness of processors, including those of superscalar design. With the ever increasing need for computing power, superscalar designs are used in many personal computers, and even in embedded applications. Super-scalar designs use long instruction pipelines and multiple functional units to achieve high degrees of instruction-level parallelism; they can execute instructions simultaneously, or in some cases out-of-order. This thesis explores the nature of temporal abstraction for pipelined and super-scalar computer organisations. A superscalar case study is presented; this design provides for out-of-order instruction issue, and uses Thornton's algorithm. This thesis also provides a structured framework for processor verification. With the suitable use of initialisation functions, and temporal abstractions, it is shown that correctness can be verified without the explicit use of temporal induction. In addition to studying the control (temporal) aspects of processors, this thesis also addresses data issues and presents an (abbreviated) algebraic specification of the IEEE-754 floating-point standard. |
author |
Fox, A. C. J. |
author_facet |
Fox, A. C. J. |
author_sort |
Fox, A. C. J. |
title |
Algebraic models for advanced microprocessors |
title_short |
Algebraic models for advanced microprocessors |
title_full |
Algebraic models for advanced microprocessors |
title_fullStr |
Algebraic models for advanced microprocessors |
title_full_unstemmed |
Algebraic models for advanced microprocessors |
title_sort |
algebraic models for advanced microprocessors |
publisher |
Swansea University |
publishDate |
1999 |
url |
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.637000 |
work_keys_str_mv |
AT foxacj algebraicmodelsforadvancedmicroprocessors |
_version_ |
1716792421394677760 |