Sciweavers

1294 search results - page 175 / 259
» FFT Compiler Techniques
Sort
View
FMCAD
2007
Springer
14 years 4 months ago
Global Optimization of Compositional Systems
—Embedded systems typically consist of a composition of a set of hardware and software IP modules. Each module is heavily optimized by itself. However, when these modules are com...
Fadi A. Zaraket, John Pape, Adnan Aziz, Margarida ...
RTSS
2005
IEEE
14 years 3 months ago
WCET Centric Data Allocation to Scratchpad Memory
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to p...
Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, T...
LCPC
2005
Springer
14 years 3 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
IEEEAMS
2003
IEEE
14 years 3 months ago
Service Morphing: Integrated System- and Application-Level Service
Service morphing is a set of techniques used to continuously meet an application’s Quality of Service (QoS) needs, in the presence of run-time variations in service locations, p...
Christian Poellabauer, Karsten Schwan, Sandip Agar...
ICSE
2010
IEEE-ACM
14 years 2 months ago
Is operator-based mutant selection superior to random mutant selection?
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...