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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Code Generation and Optimization, Proceedings s. 243 - 253
Hlavní autoři:	Schaeckeler, Stefan, Shang, Weijia
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Washington, DC, USA IEEE Computer Society 22.03.2009 IEEE
Edice:	ACM Conferences
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!