Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Teleport Messaging for Distributed Stream Programs William Thies, Michal Karczmarek, Janis Sermulins, Rodric Rabbah, and Saman Amarasinghe
 

Summary: Teleport Messaging for Distributed Stream Programs
William Thies, Michal Karczmarek, Janis Sermulins, Rodric Rabbah, and Saman Amarasinghe
{thies, karczma, janiss, rabbah, saman}@csail.mit.edu
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology
ABSTRACT
In this paper, we develop a new language construct to ad-
dress one of the pitfalls of parallel programming: precise
handling of events across parallel components. The con-
struct, termed teleport messaging, uses data dependences
between components to provide a common notion of time
in a parallel system. Our work is done in the context of
the Synchronous Dataflow (SDF) model, in which compu-
tation is expressed as a graph of independent components
(or actors) that communicate in regular patterns over data
channels. We leverage the static properties of SDF to com-
pute a stream dependence function, sdep, that compactly
describes the ordering constraints between actor executions.
Teleport messaging utilizes sdep to provide powerful and
precise event handling. For example, an actor A can specify

  

Source: Amarasinghe, Saman - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collections: Computer Technologies and Information Sciences