Sciweavers

206 search results - page 25 / 42
» Optimally Profiling and Tracing Programs
Sort
View
ICFP
2007
ACM
16 years 1 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
ICDE
1993
IEEE
120views Database» more  ICDE 1993»
15 years 5 months ago
Adaptable Pointer Swizzling Strategies in Object Bases
In this article, different techniques for 'pointer swizzling" are classified and evaluated for optimizing the access to main-memory resident persistent objects. To speed ...
Alfons Kemper, Donald Kossmann
PPL
2008
97views more  PPL 2008»
15 years 1 months ago
The Impact of Dynamic Channels on Functional Topology Skeletons
Parallel functional programs with implicit communication often generate purely hierarchical communication topologies during execution: communication only happens between parent an...
Jost Berthold, Rita Loogen
ASPLOS
2011
ACM
14 years 5 months ago
Improving the performance of trace-based systems by false loop filtering
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mau...
IEEECIT
2010
IEEE
14 years 12 months ago
Superblock-Based Source Code Optimizations for WCET Reduction
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
Paul Lokuciejewski, Timon Kelter, Peter Marwedel