Back to search

University of Victoria (Canada)

Compacting object code via parameterized procedural abstraction

Abstract

dc:description.abstract

Current compiler optimization research focuses on program transformations that increase code speed. Decreasing object file size is sometimes a goal since less code often means faster code. In this thesis we examine parameterized procedural abstraction. This is an extension of an optimization whose sole purpose is to reduce code size. Previously pub­lished implementations of procedural abstraction have produced space savings where instruction sequences are exact matches (i.e. instruction operations and operands are the same between code sequences). Researchers felt that parameterizing differences had too high a cost, but no investigations have been made into the potential space savings from exploiting inexact matches. We show that permanent space savings (compaction) are pos­sible when (1) covering matches with more than one procedure and (2) carefully choosing which inexact match instances are covered by each procedure. Our heuristic algorithms choose a mix of parameterized and unparameterized procedures that yield substantially better space savings in comparison to unparameterized procedures only.

Degree

thesis:*
Level thesis:degree_level
Master of Science M.Sc.
Department thesis:degree_department
Department of Computer Science
Year dc:date.issued
1995

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zastre, Michael M. J. (Michael Marcus Joseph)

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1828/20263

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Zastre, Michael M. J. (Michael Marcus Joseph). Compacting object code via parameterized procedural abstraction. Master of Science M.Sc. thesis, 1995. https://hdl.handle.net/1828/20263