*banner
 

A Type System for the Automatic Distribution of Higher-order Synchronous Dataflow Programs
Girault Alain

Citation
Girault Alain. "A Type System for the Automatic Distribution of Higher-order Synchronous Dataflow Programs". Talk or presentation, 10, June, 2008.

Abstract
We address the design of distributed systems with synchronous dataflow programming languages. As modular design entails handling both architectural and functional modularity, our first contribution is to extend an existing synchronous dataflow programming language with primitives allowing the description of a distributed architecture and the localization of some expressions onto some processors. We also present a distributed semantics to formalize the distributed execution of synchronous programs. Our second contribution is to provide a type system, in order to infer the localization of non-annotated values by means of type inference and to ensure, at compilation time, the consistency of the distribution. Our third contribution is to provide a type-directed projection operation to obtain automatically, from a centralized typed program, the local program to be executed by each computing resource. The type system as well as the automatic distribution mechanism has been fully implemented in the compiler of an existing synchronous dataflow programming language (namely Lucid Synchrone).

Electronic downloads

Citation formats  
  • HTML
    Girault Alain. <a
    href="http://chess.eecs.berkeley.edu/pubs/432.html"
    ><i>A Type System for the Automatic Distribution of
    Higher-order Synchronous Dataflow
    Programs</i></a>, Talk or presentation,  10,
    June, 2008.
  • Plain text
    Girault Alain. "A Type System for the Automatic
    Distribution of Higher-order Synchronous Dataflow
    Programs". Talk or presentation,  10, June, 2008.
  • BibTeX
    @presentation{Alain08_TypeSystemForAutomaticDistributionOfHigherorderSynchronous,
        author = {Girault Alain},
        title = {A Type System for the Automatic Distribution of
                  Higher-order Synchronous Dataflow Programs},
        day = {10},
        month = {June},
        year = {2008},
        abstract = {We address the design of distributed systems with
                  synchronous dataflow programming languages. As
                  modular design entails handling both architectural
                  and functional modularity, our first contribution
                  is to extend an existing synchronous dataflow
                  programming language with primitives allowing the
                  description of a distributed architecture and the
                  localization of some expressions onto some
                  processors. We also present a distributed
                  semantics to formalize the distributed execution
                  of synchronous programs. Our second contribution
                  is to provide a type system, in order to infer the
                  localization of non-annotated values by means of
                  type inference and to ensure, at compilation time,
                  the consistency of the distribution. Our third
                  contribution is to provide a type-directed
                  projection operation to obtain automatically, from
                  a centralized typed program, the local program to
                  be executed by each computing resource. The type
                  system as well as the automatic distribution
                  mechanism has been fully implemented in the
                  compiler of an existing synchronous dataflow
                  programming language (namely Lucid Synchrone). },
        URL = {http://chess.eecs.berkeley.edu/pubs/432.html}
    }
    

Posted by Hiren Patel on 10 Jun 2008.
Groups: chess
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

You are not logged in 
©2002-2014 Chess