go-v.orgdoi

Reducing the branch penalty by rearranging instructions in a double-width memory

Manolis G. H. Katevenis, Nestoras Tzartzanis · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · 1991

  • DOI 10.1145/106972.106977
  • Publisher Association for Computing Machinery
  • Type conference-paper
  • Issued 1991

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · Association for Computing Machinery · conference-paper · 1991

Abstract

Article Free Access Share on Reducing the branch penalty by rearranging instructions in a double-width memory Authors: Manolis Katevenis View Profile , Nestoras Tzartzanis View Profile Authors Info & Claims ASPLOS IV: Proceedings of the fourth international conference on Architectural support for programming languages and operating systemsApril 1991 Pages 15–27https://doi.org/10.1145/106972.106977Published:01 April 1991Publication History 5citation533DownloadsMetricsTotal Citations5Total Downloads533Last 12 Months125Last 6 weeks20 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Open the resolved locator · 10.1145/106972.106977

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 15:11 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.1145/106972.106977
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.