Sciweavers

47 search results - page 1 / 10
» Combining Global Code and Data Compaction
Sort
View
LCTRTS
2001
Springer
13 years 9 months ago
Combining Global Code and Data Compaction
Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of pro...
Bjorn De Sutter, Bruno De Bus, Koenraad De Bossche...
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
13 years 10 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
LCTRTS
2005
Springer
13 years 10 months ago
System-wide compaction and specialization of the linux kernel
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
Dominique Chanet, Bjorn De Sutter, Bruno De Bus, L...
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
13 years 9 months ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith
CORR
2004
Springer
125views Education» more  CORR 2004»
13 years 5 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl