1 / 7

Kahn's Computation Model: A Deep Dive into S-Net Processes and Deterministic Computation

This document explores Kahn's Computation Model, emphasizing the mechanisms of S-net processes. Nodes in this model enqueue items on output channels and read from input channels while performing deterministic computations with conceptually unbounded buffers. Includes detailed examples of processes f, g, and h, illustrating the flow of integers through interconnected nodes. These processes exemplify how Turing machines can function through one-way tapes, providing insight into the foundational theory of computation as applied in networked environments.

lev
Télécharger la présentation

Kahn's Computation Model: A Deep Dive into S-Net Processes and Deterministic Computation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Short Description on Kahn’s Process Underlying Computation Model for S-net

  2. Kahn’s Computation Model • Nodes enqueue items on the output channels • Read from an input channel (block) • Node performs a deterministic computation • Conceptually unbounded buffer

  3. Example integer channel X, Y, Z, T1, T2; Process f(integer in U, V; integer out W); Begin integer I; Logical B = true; Repeat Begin I := if B then wait(U) else wait(V); print(I); send I on W; B = neg(B) End; End;

  4. Example Contd. Process g(integer in U; integer out V, W); Begin integer I; Logical B = true; Repeat Begin I := wait(U); if B then send I on V else send I on W; B = neg(B) End; End;

  5. Example Contd. Process h(integer in U; integer INIT); Begin integer I; send INIT on V; Repeat Begin I := wait(U); send I on V; End; End; f(Y, Z, X) par g(X, T1, T2) par h(T1, Y, 0) par h(T2, Z, 1);

  6. Example Contd. • Underlying theory of computation • A set of Turing machines connected via one- way tapes Z Y f h0 h1 X g T1 T2

  7. Switch to S-net

More Related