Sciweavers

227 search results - page 4 / 46
» Graph Rewriting for Hardware Dependent Program Optimizations
Sort
View
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
14 years 1 months ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
11 years 10 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
IWPC
2000
IEEE
13 years 12 months ago
Automated Quality Analysis of Component Software for Embedded Systems
The Java programming language has gained increasing importance for the development of embedded systems. To be cost efficient, such systems have to cope with significant hardware...
Jens H. Jahnke, Jörg Niere, Jörg P. Wads...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
ISCA
1992
IEEE
113views Hardware» more  ISCA 1992»
13 years 11 months ago
Dynamic Dependency Analysis of Ordinary Programs
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
Todd M. Austin, Gurindar S. Sohi