Sciweavers

1294 search results - page 136 / 259
» FFT Compiler Techniques
Sort
View
UML
2001
Springer
14 years 1 months ago
Representing Embedded System Sequence Diagrams as a Formal Language
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
Elizabeth Latronico, Philip Koopman
IEEEPACT
2000
IEEE
14 years 1 months ago
Global Register Partitioning
Modern computers have taken advantage of the instruction-level parallelism (ILP) available in programs with advances in both architecture and compiler design. Unfortunately, large...
Jason Hiser, Steve Carr, Philip H. Sweany
PLDI
2000
ACM
14 years 1 months ago
Exploiting superword level parallelism with multimedia instruction sets
Increasing focus on multimedia applications has prompted the addition of multimedia extensions to most existing general purpose microprocessors. This added functionality comes pri...
Samuel Larsen, Saman P. Amarasinghe
PLDI
2000
ACM
14 years 1 months ago
Optimal instruction scheduling using integer programming
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
Kent D. Wilken, Jack Liu, Mark Heffernan
ICFP
1999
ACM
14 years 1 months ago
Representing Java Classes in a Typed Intermediate Language
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
Christopher League, Zhong Shao, Valery Trifonov