1 / 26

Wavenets

Wavenets. John Chapin MIT. x. x. x. x. x. x. y. z. y. z. y. z. y. y. y. z. z. z. z. x. x. x. A. 1. 2. 1:z + 2:s  3:t. B. 3. A. 1. 2. 1:z + 2:s  3:t. 3. A. z. B. A. s. 1. 2. 1:z + 2:s  3:t. B. 3. A. 1. 2. 1:z + 2:s  3:t. B. 3. A. 1. 2.

bland
Télécharger la présentation

Wavenets

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. Wavenets John ChapinMIT

  2. x x x x x x y z y z

  3. y z y y y z z z z x x x

  4. A

  5. 1 2 1:z + 2:s  3:t B 3 A

  6. 1 2 1:z + 2:s  3:t 3 A z B

  7. A s 1 2 1:z + 2:s 3:t B 3

  8. A 1 2 1:z + 2:s  3:t B 3

  9. A 1 2 1:z + 2:s  3:t B 3 t

  10. x (empty) y z y z z 1 2 1:z + 2:s  3:t y y 3 x x A B

  11. x x x s s y z y z s s s A 1 2 1:z + 2:s  3:t B 3

  12. 1 2 1:z + 2:s  3:t 3 A y z s B

  13. y y y y s 1 2 1:z + 2:s  3:t y y 3 t t t t t t t A B

  14. x s t A 1 2 1:z + 2:s  3:t B 3

  15. x x (empty) y A 1 2 1:z + 2:s  3:t B 3

  16. x A s 1 2 1:z + 2:s  3:t B 3

  17. x A s z 1 2 1:z + 2:s  3:t B 3 t

  18. s x A 1 2 1:z + 2:s  3:t B 3

  19. Wavenet = Synchronous circuit + Superposition + Wave function collapse + Conservation of energy

  20. A simple primitive that provides: Global concurrency control Automatic resource management Wavenet =

  21. Dining philosophers solution (from philosopher) (to philosopher) p p p:think => left:fork + right:fork p:hungry + left:fork + right:fork => p:eat p:hungry --> p:tryagain right right left left right right table right:fork => table:fork left:fork => table:fork table:fork => right:fork table:fork => left:fork table:fork --> table:fork As manyphilosophers andforks as desired left fork table left

  22. Dining philosophers solution (from philosopher) (to philosopher) p p p:think => left:fork + right:fork p:hungry + left:fork + right:fork => p:eat p:hungry --> p:tryagain right right left left right right table right:fork => table:fork left:fork => table:fork table:fork => right:fork table:fork => left:fork table:fork --> table:fork As manyphilosophers andforks as desired left fork table left

  23. The challenge Computing the latching is NP-complete Conservation of energy = A powerful primitive that solves many different problems Efficient implementation? Offline analysis Hardware support

  24. Batch programs Parallel servers Input Processing Output Halt Run forever Maintain invariants Respond to multiple inputs in parallel Wavenets Calculus? Prog. abstraction? Why? Take off the Turing blindfold! Turing machinesLambda calculus Procedures

  25. http://sdg.lcs.mit.edu/wavenets

More Related