A low-complexity issue queue design with speculative pre-execution

Won Woo Ro, Jean Luc Gaudiot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-of-order execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circuit complexity. This paper proposes Speculative Pre-Execution Assisted by compileR (SPEAR), a low-complexity issue queue design. SPEAR is designed to manage the small issue queue more efficiently without increasing the queue size. To this end, we have first recognized that the long memory latency is one of the factors which demand a large queue, and we aim at achieving early execution of the miss-causing load instructions using another hierarchy of an issue queue. We speculatively pre-execute those miss-causing instructions as an additional prefetching thread.

Original languageEnglish
Title of host publicationHigh Performance Computing, HiPC 2005 - 12th International Conference, Proceedings
Pages353-362
Number of pages10
Publication statusPublished - 2005 Dec 1
Event12th International Conference on High Performance Computing, HiPC 2005 - Goa, India
Duration: 2005 Dec 182005 Dec 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3769 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on High Performance Computing, HiPC 2005
CountryIndia
CityGoa
Period05/12/1805/12/21

Fingerprint

Broadcasting
Low Complexity
Queue
Clocks
Data storage equipment
Networks (circuits)
Compiler
Superscalar
Circuit Complexity
Prefetching
Design
Long Memory
Thread
Latency

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ro, W. W., & Gaudiot, J. L. (2005). A low-complexity issue queue design with speculative pre-execution. In High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings (pp. 353-362). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).
Ro, Won Woo ; Gaudiot, Jean Luc. / A low-complexity issue queue design with speculative pre-execution. High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. 2005. pp. 353-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ba5f1072f3a64a55bd11f87093374065,
title = "A low-complexity issue queue design with speculative pre-execution",
abstract = "Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-of-order execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circuit complexity. This paper proposes Speculative Pre-Execution Assisted by compileR (SPEAR), a low-complexity issue queue design. SPEAR is designed to manage the small issue queue more efficiently without increasing the queue size. To this end, we have first recognized that the long memory latency is one of the factors which demand a large queue, and we aim at achieving early execution of the miss-causing load instructions using another hierarchy of an issue queue. We speculatively pre-execute those miss-causing instructions as an additional prefetching thread.",
author = "Ro, {Won Woo} and Gaudiot, {Jean Luc}",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "3540309365",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "353--362",
booktitle = "High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings",

}

Ro, WW & Gaudiot, JL 2005, A low-complexity issue queue design with speculative pre-execution. in High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3769 LNCS, pp. 353-362, 12th International Conference on High Performance Computing, HiPC 2005, Goa, India, 05/12/18.

A low-complexity issue queue design with speculative pre-execution. / Ro, Won Woo; Gaudiot, Jean Luc.

High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. 2005. p. 353-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3769 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A low-complexity issue queue design with speculative pre-execution

AU - Ro, Won Woo

AU - Gaudiot, Jean Luc

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-of-order execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circuit complexity. This paper proposes Speculative Pre-Execution Assisted by compileR (SPEAR), a low-complexity issue queue design. SPEAR is designed to manage the small issue queue more efficiently without increasing the queue size. To this end, we have first recognized that the long memory latency is one of the factors which demand a large queue, and we aim at achieving early execution of the miss-causing load instructions using another hierarchy of an issue queue. We speculatively pre-execute those miss-causing instructions as an additional prefetching thread.

AB - Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-of-order execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circuit complexity. This paper proposes Speculative Pre-Execution Assisted by compileR (SPEAR), a low-complexity issue queue design. SPEAR is designed to manage the small issue queue more efficiently without increasing the queue size. To this end, we have first recognized that the long memory latency is one of the factors which demand a large queue, and we aim at achieving early execution of the miss-causing load instructions using another hierarchy of an issue queue. We speculatively pre-execute those miss-causing instructions as an additional prefetching thread.

UR - http://www.scopus.com/inward/record.url?scp=33646739809&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646739809&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540309365

SN - 9783540309369

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 353

EP - 362

BT - High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings

ER -

Ro WW, Gaudiot JL. A low-complexity issue queue design with speculative pre-execution. In High Performance Computing, HiPC 2005 - 12th International Conference, Proceedings. 2005. p. 353-362. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).