*Given an infinite number of cores, the time to process a set of dataflow
functions is equivalent to the the time that the longest function took to
do its processing.*
It sounds like you've just discovered Amdahls Law :-D
https://en.wikipedia.org/wiki/Amdahl%27s_law
As for the articles, the
Here's some resources to get you started learning about dataflow as a
paradigm. From this you should be able to figure out how Pedestal's
dataflow system fits in.
A list of existing dataflow languages and systems:
Thank you. I only read the last two articles so far; some notes.
http://my.opera.com/Vorlath/blog/2008/01/06/simple-example-of-the-difference-between-imperative-functional-and-data-flow
I realized that I really wasn't getting what dataflow was about. I was
viewing dataflow paths as a sort of
One thing that I am seeing on a re-read is that I conflated the notion of
the data flow function and the paths. I was sort of thinking that the data
flow functions sit at a particular path location. Similar to how a value
sits in a location in memory. It is more appropriate to say that the data
Just a quick thought I had as I was walking home.
Given an infinite number of cores, the time to process a set of dataflow
functions is equivalent to the the time that the longest function took to
do its processing. The efficiency is the (sum of time that all the dataflow
functions took) / (
Cross posted from pedestal-users group, as many people who are not using
pedestal may still know about dataflow, terms like effect are used in the
context of pedestal
Pedestal seems strongly based on dataflow based programming. The gigantic
tutorial just sort of jumps in on it.
Based on my
