NDLI: N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Please wait, while we are loading the content...

Why dependent types matter

The next 700 data description languages

A hierarchical model of data locality

Simplifying reductions

Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations

Decidability and proof systems for language-based noninterference relations

On flow-sensitive security types

A logic for information flow in object-oriented programs

Polymorphic regular tree types and patterns

Verifying properties of well-founded linked lists

Environment analysis via ΔCFA

Small bisimulations for reasoning about higher-order imperative programs

A fixpoint calculus for local and global program flows

The Scala experiment: can we provide better language support for component systems?

Adventures in time and space

N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Compiler-directed channel allocation for saving power in on-chip networks

Fast and loose reasoning is morally correct

Modular set-based analysis from contracts

Stratified type inference for generalized algebraic data types

Hybrid type checking

A polymorphic modal type system for lisp-like multi-staged languages

The next mainstream programming language: a game developer's perspective

A virtual class calculus

Interruptible iterators

Specifying C++ concepts

Frame rules from answer types for code pointers

Certified assembly programming with embedded code pointers

Associating synchronization constraints with data in an object-oriented language

Autolocker: synchronization inference for atomic sections

Protecting representation with effect encapsulation

The essence of command injection attacks in web applications

Harmless advice

A verifiable SSA program representation for aggressive compiler optimization

Staged allocation: a compositional technique for specifying and implementing procedure calling conventions

N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Content Provider	ACM Digital Library
Author	Pagetti, Claire Plateau, Florence Duranton, Marc Eisenbeis, Christine Pouzet, Marc Cohen, Albert
Abstract	The design of high-performance stream-processing systems is a fast growing domain, driven by markets such like high-end TV, gaming, 3D animation and medical imaging. It is also a surprisingly demanding task, with respect to the algorithmic and conceptual simplicity of streaming applications. It needs the close cooperation between numerical analysts, parallel programming experts, real-time control experts and computer architects, and incurs a very high level of quality insurance and optimization.In search for improved productivity, we propose a programming model and language dedicated to high-performance stream processing. This language builds on the synchronous programming model and on domain knowledge -- the periodic evolution of streams -- to allow correct-by-construction properties to be proven by the compiler. These properties include resource requirements and delays between input and output streams. Automating this task avoids tedious and error-prone engineering, due to the combinatorics of the composition of filters with multiple data rates and formats. Correctness of the implementation is also difficult to assess with traditional (asynchronous, simulation-based) approaches. This language is thus provided with a relaxed notion of synchronous composition, called n-synchrony: two processes are n-synchronous if they can communicate in the ordinary (0-)synchronous model with a FIFO buffer of size n.Technically, we extend a core synchronous data-flow language with a notion of periodic clocks, and design a relaxed clock calculus (a type system for clocks) to allow non strictly synchronous processes to be composed or correlated. This relaxation is associated with two sub-typing rules in the clock calculus. Delay, buffer insertion and control code for these buffers are automatically inferred from the clock types through a systematic transformation into a standard synchronous program. We formally define the semantics of the language and prove the soundness and completeness of its clock calculus and synchronization transformation. Finally, the language is compared with existing formalisms.
Starting Page	180
Ending Page	193
Page Count	14
File Format	PDF
ISBN	1595930272
DOI	10.1145/1111037.1111054
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-01-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Resource constraints Synchronous languages Correctness by construction Streaming applications Subtyping
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

N-synchronous Kahn networks:a relaxed model of synchrony for real-time systems

N-Synchr onous Kahn Networks A Relaxed Model of Synchrony for Real-Time Systems

N-Synchronous Kahn Networks - A Relaxed Model of Synchrony for Real-Time Systems (2006)

N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems (2006)

Synchronizing Periodic Clocks in Kahn Networks

Synchronizing Periodic Clocks in Kahn Networks

The Polychronous Model of Computation and Kahn Process Networks

Lucy-n: a n-Synchronous Extension of Lustre

Lucy-n: a n-Synchronous Extension of Lustre ⋆

N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Similar Documents

N-synchronous Kahn networks:a relaxed model of synchrony for real-time systems

N-Synchr onous Kahn Networks A Relaxed Model of Synchrony for Real-Time Systems

N-Synchronous Kahn Networks - A Relaxed Model of Synchrony for Real-Time Systems (2006)

N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems (2006)

Synchronizing Periodic Clocks in Kahn Networks

Synchronizing Periodic Clocks in Kahn Networks

The Polychronous Model of Computation and Kahn Process Networks

Lucy-n: a n-Synchronous Extension of Lustre

Lucy-n: a n-Synchronous Extension of Lustre ⋆

N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems