HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY.

Wen-Mei W Hwu, Yale N. Patt

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

Abstract

Recent work in microarchitecture has identified a new model of execution, restricted data flow, in which data-flow techniques are used to coordinate out-of-order execution of sequential instruction streams. It is believed that the restricted-data-flow model has great potential for implementing high-performance computing engines. A minimal functionality variant of the model, called HPSm, is defined. The instruction set, data path, timing and control of HPSm are described. A simulator of HPSm has been written, and some of the Berkeley RISC benchmarks have been executed on the simulator. Measurements obtained from these benchmarks, along with measurements obtained for the Berkeley RISC II, are reported.

Original languageEnglish (US)
Title of host publicationConference Proceedings - Annual Symposium on Computer Architecture
PublisherIEEE
Pages297-306
Number of pages10
ISBN (Print)081860719X
StatePublished - 1986
Externally publishedYes

Fingerprint

Reduced instruction set computing
Simulators
Engines

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hwu, W-M. W., & Patt, Y. N. (1986). HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY. In Conference Proceedings - Annual Symposium on Computer Architecture (pp. 297-306). IEEE.

HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY. / Hwu, Wen-Mei W; Patt, Yale N.

Conference Proceedings - Annual Symposium on Computer Architecture. IEEE, 1986. p. 297-306.

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

Hwu, W-MW & Patt, YN 1986, HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY. in Conference Proceedings - Annual Symposium on Computer Architecture. IEEE, pp. 297-306.
Hwu W-MW, Patt YN. HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY. In Conference Proceedings - Annual Symposium on Computer Architecture. IEEE. 1986. p. 297-306
Hwu, Wen-Mei W ; Patt, Yale N. / HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY. Conference Proceedings - Annual Symposium on Computer Architecture. IEEE, 1986. pp. 297-306
@inproceedings{a75b3995051d445cace91c7cb482bf32,
title = "HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY.",
abstract = "Recent work in microarchitecture has identified a new model of execution, restricted data flow, in which data-flow techniques are used to coordinate out-of-order execution of sequential instruction streams. It is believed that the restricted-data-flow model has great potential for implementing high-performance computing engines. A minimal functionality variant of the model, called HPSm, is defined. The instruction set, data path, timing and control of HPSm are described. A simulator of HPSm has been written, and some of the Berkeley RISC benchmarks have been executed on the simulator. Measurements obtained from these benchmarks, along with measurements obtained for the Berkeley RISC II, are reported.",
author = "Hwu, {Wen-Mei W} and Patt, {Yale N.}",
year = "1986",
language = "English (US)",
isbn = "081860719X",
pages = "297--306",
booktitle = "Conference Proceedings - Annual Symposium on Computer Architecture",
publisher = "IEEE",

}

TY - GEN

T1 - HPSM, A HIGH PERFORMANCE RESTRICTED DATA FLOW ARCHITECTURE HAVING MINIMAL FUNCTIONALITY.

AU - Hwu, Wen-Mei W

AU - Patt, Yale N.

PY - 1986

Y1 - 1986

N2 - Recent work in microarchitecture has identified a new model of execution, restricted data flow, in which data-flow techniques are used to coordinate out-of-order execution of sequential instruction streams. It is believed that the restricted-data-flow model has great potential for implementing high-performance computing engines. A minimal functionality variant of the model, called HPSm, is defined. The instruction set, data path, timing and control of HPSm are described. A simulator of HPSm has been written, and some of the Berkeley RISC benchmarks have been executed on the simulator. Measurements obtained from these benchmarks, along with measurements obtained for the Berkeley RISC II, are reported.

AB - Recent work in microarchitecture has identified a new model of execution, restricted data flow, in which data-flow techniques are used to coordinate out-of-order execution of sequential instruction streams. It is believed that the restricted-data-flow model has great potential for implementing high-performance computing engines. A minimal functionality variant of the model, called HPSm, is defined. The instruction set, data path, timing and control of HPSm are described. A simulator of HPSm has been written, and some of the Berkeley RISC benchmarks have been executed on the simulator. Measurements obtained from these benchmarks, along with measurements obtained for the Berkeley RISC II, are reported.

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

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

M3 - Conference contribution

AN - SCOPUS:0022584031

SN - 081860719X

SP - 297

EP - 306

BT - Conference Proceedings - Annual Symposium on Computer Architecture

PB - IEEE

ER -