Compiling Esterel into sequential code

Embedded real-time software systems often need fine-grained parallelism and precise control over time, things typical real-time operating systems do not provide. The Esterel language has both, but Existing compilers produce slow code for large programs. This paper presents the first Esterel compiler...

Full description

Saved in:
Bibliographic Details
Published in:37th Design Automation Conference, 2000 pp. 322 - 327
Main Author: Edwards, Stephen A.
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 01.01.2000
Series:ACM Conferences
Subjects:
Applied computing > Physical sciences and engineering > Engineering
Computer systems organization > Embedded and cyber-physical systems
Computer systems organization > Embedded and cyber-physical systems > Embedded systems
Computer systems organization > Real-time systems
Hardware > Electronic design automation > Methodologies for EDA
Hardware > Integrated circuits > Logic circuits > Arithmetic and datapath circuits
Hardware > Integrated circuits > Logic circuits > Design modules and hierarchy
Software and its engineering > Software notations and tools > Compilers
Software and its engineering > Software notations and tools > General programming languages > Language types
Software and its engineering > Software organization and properties > Software system structures > Embedded software
Software and its engineering > Software organization and properties > Software system structures > Real-time systems software
ISBN:9781581131871, 1581131879
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Embedded real-time software systems often need fine-grained parallelism and precise control over time, things typical real-time operating systems do not provide. The Esterel language has both, but Existing compilers produce slow code for large programs. This paper presents the first Esterel compiler able to produce small, fast code for large programs. It can produce code half the size and up to a hundred times faster than code from existing compilers. Esterel's semantics allow the compiler to statically schedule concurrency and synthesize code that efficiently and predictably simulates context switches. The main contribution is an algorithm that synthesizes an efficient sequential program from the concurrent control-flow graph used as an intermediate representation. These techniques could be applied to any language with fine-grained parallelism.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581131871
1581131879
DOI:10.1145/337292.337429