Guided linking: dynamic linking without the costs

Abstract

Dynamic linking is extremely common in modern software systems, thanks to the flexibility and space savings it offers. However, this flexibility comes at a cost: it’s impossible to perform interprocedural optimizations that involve calls to a dynamic library. The basic problem is that the run-time behavior of the dynamic linker can’t be predicted at compile time, so the compiler can make no assumptions about how such calls will behave.

Document Details

Document Type
Pub Defense Publication
Publication Date
Nov 13, 2020
Source ID
10.1145/3428213

Entities

People

  • Sean Bartell
  • Vikram Adve
  • Will Dietz

Organizations

  • National Science Foundation
  • Office of Naval Research
  • University of Illinois Urbana–Champaign

Tags

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design

Technology Areas

  • Space