Sciweavers

34 search results - page 5 / 7
» Compiling scheme to JVM bytecode: : a performance study
Sort
View
LCTRTS
2010
Springer
13 years 9 months ago
An efficient code update scheme for DSP applications in mobile embedded systems
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation. By carefully allocating variables in the memory, DSP compilers take advanta...
Weijia Li, Youtao Zhang
POPL
1992
ACM
13 years 11 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori
LISP
2008
104views more  LISP 2008»
13 years 7 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
PLDI
2004
ACM
14 years 24 days ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
DSD
2010
IEEE
153views Hardware» more  DSD 2010»
13 years 7 months ago
Simulation of High-Performance Memory Allocators
—Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern highperformance applications. To optimize metrics like performance, memory us...
José Luis Risco-Martín, José ...