Skip to main content

Architectural Exploration

  • Chapter
Dynamic Binary Modification

Part of the book series: Synthesis Lectures on Computer Architecture ((SLCA))

  • 89 Accesses

Abstract

Computer architects have found great utility in dynamic binary modification systems as an enabling technology for fast exploratory studies of novel architectural algorithms or features. These exploratory applications have taken the form of simulation tools, instruction emulation features, and general design-space exploration. Furthermore, dynamic binary modification systems can be used for complete binary translation functionality, to enable a smooth transition from one instructionset architecture to another, otherwise incompatible architecture. In fact, several corporations have leveraged this precise technology to support industrial strength and widely circulated binary translation (Apple, Dehnert et al. [2003]). The wide variety of opportunities and applications within the computer architecture community will be discussed in this chapter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 27.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Nature Switzerland AG

About this chapter

Cite this chapter

Hazelwood, K. (2011). Architectural Exploration. In: Dynamic Binary Modification. Synthesis Lectures on Computer Architecture. Springer, Cham. https://doi.org/10.1007/978-3-031-01732-2_5

Download citation

Publish with us

Policies and ethics