Procedural Abstraction with Reverse Prefix Trees

For memory constrained environments like embedded systems, optimization for size is often as important as, if not more important than, optimization for execution speed. A common technique for compacting code is procedural abstraction. Equivalent code fragments are identified and abstracted into a pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Code Generation and Optimization, Proceedings S. 243 - 253
Hauptverfasser: Schaeckeler, Stefan, Shang, Weijia
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Washington, DC, USA IEEE Computer Society 22.03.2009
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
Assembly
code compaction
code size reduction
Code standards
Compaction
Constraint optimization
Costs
Embedded computing
Embedded system
embedded systems
Personal digital assistants
post-pass optimization
procedural abstraction
program visualization
Random access memory
reverse prefix tree
Software and its engineering > Software notations and tools > Compilers
Software and its engineering > Software notations and tools > General programming languages > Language features > Procedures, functions and subroutines
suffix tree
Visualization
code compaction
reverse prefix tree
embedded systems
suffix tree
post-pass optimization
program visualization
code size reduction
procedural abstraction
ISBN:9780769535760, 0769535763
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For memory constrained environments like embedded systems, optimization for size is often as important as, if not more important than, optimization for execution speed. A common technique for compacting code is procedural abstraction. Equivalent code fragments are identified and abstracted into a procedure. The standard algorithm for identifying these fragments is based on suffix trees. We propose in this paper the calculation of suffix trees over the program text not in the common top-down fashion, but reversed, i.e. bottom-up. With this simple modification, not only equivalent fragments can be identified, but also fragments equivalent to (possibly often differently long) suffixes of the longest fragments. A longest fragment is then abstracted, and all fragments are replaced by procedure calls to their corresponding start instruction somewhere in the abstracted procedure. This allows us to harvest more and longer fragments than with standard suffix trees, improving code size reductions on average by 8.277% over standard suffix trees.
ISBN:9780769535760
0769535763
DOI:10.1109/CGO.2009.25