Sciweavers

125 search results - page 18 / 25
» Transforming Normal Programs by Replacement
Sort
View
LCTRTS
2009
Springer
14 years 2 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
ASPLOS
1996
ACM
13 years 11 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
FOSSACS
2006
Springer
13 years 11 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...

Book
5690views
15 years 5 months ago
The OpenGL Reference Manual - The Bluebook
"This manual is designed to be used as the companion reference volume to the OpenGL Programming Guide by Jackie Neider, Tom Davis, and Mason Woo (Reading, MA: Addison-Wesley P...
Dave Shreiner
ESOP
2003
Springer
14 years 18 days ago
A Tail-Recursive Semantics for Stack Inspections
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
John Clements, Matthias Felleisen