Formal Methods for Scheduling of Latency-Insensitive Designs

Julien Boucaron 1, * Robert de Simone 1 Jean-Vivien Millo 1
* Corresponding author
1 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Latency-insensitive design (LID) theory was invented to deal with SoC timing closure issues, by allowing arbitrary fixed integer latencies on long global wires. Latencies are coped with using a resynchronization protocol that performs dynamic scheduling of data transportation. Functional behavior is preserved. This dynamic scheduling is implemented using specific synchronous hardware elements: relay-stations (RS) and shell-wrappers (SW). Our first goal is to provide a formal modeling of RS and SW, that can be then formally verified. As turns out, resulting behavior is k-periodic, thus amenable to static scheduling. Our second goal is to provide formal hardware modeling here also. It initially performs throughput equalization, adding integer latencies wherever possible; residual cases require introduction of fractional registers (FRs) at specific locations. Benchmark results are presented, run on our Kpassa tool implementation.
Document type :
Journal articles
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00784464
Contributor : Ed. Bmc <>
Submitted on : Monday, February 4, 2013 - 1:13:17 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Monday, June 17, 2013 - 6:46:42 PM

Identifiers

Collections

Citation

Julien Boucaron, Robert de Simone, Jean-Vivien Millo. Formal Methods for Scheduling of Latency-Insensitive Designs. EURASIP Journal on Embedded Systems, SpringerOpen, 2007, 2007 (1), pp.039161. ⟨10.1155/2007/39161⟩. ⟨hal-00784464⟩

Share

Metrics

Record views

284

Files downloads

248