A comparison of asymptotically scalable superscalar processors

DOI10.1007/S00224-001-1029-ZzbMATH Open1005.68889OpenAlexW1967544822MaRDI QIDQ1601749FDOQ1601749

Authors: D. S. Henry, Bradley C. Kuszmaul, Gabriel H. Loh 

Publication date: 27 June 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1029-z

Recommendations

• scientific article; zbMATH DE number 1330906
• An exploration of instruction fetch requirement in out-of-order superscalar processors
• HIGH SPEED SYNCHRONIZATION FOR A STATICALLY SCHEDULED SUPERSCALAR PROCESSOR
• A performance and cost analysis of applying superscalar method to mainframe computers
• scientific article; zbMATH DE number 2090678

zbMATH Keywords

scalable processor architecturessuperscalar processorsVLSI complexities

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Cited In (5)

• A performance and cost analysis of applying superscalar method to mainframe computers
• An exploration of instruction fetch requirement in out-of-order superscalar processors
• Title not available (Why is that?)
• Handling 16 instructions per cycle in a superscalar processor
• Title not available (Why is that?)

This page was built for publication: A comparison of asymptotically scalable superscalar processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601749)