2 ms·
This, like the C64 compute module [1] would be a good way to get a good understanding of where the problems are. A long time ago when I was looking at paralleli
by ChuckMcM 13y ago
This, like the C64 compute module [1] would be a good way to get a good understanding of where the problems are. A long time ago when I was looking at parallelization issues in storage, I came across some excellent work done by Garth Goodson at CMU in their "Active Disks" [2] project. The was connecting what were essentially RPi class devices together.
What emerges is a sort of calculus for describing parallel systems which takes the amount of compute per second a node can do, the amount of data that node can "consider" during its computation, and the time it takes for all of the nodes to "react." In this case a node considers a data structure when it evaluates its state (say the head node of a list, or the median element of an array) and is constrained from taking action by a threshold of assurance that the data it is considering it accurate. The reaction time is the time between making a change to the data and the time at which all elements in the cluster considering that data consider it true.
I used to describe that to people like those big mechanical train signs at stations with all the letters on a flip wheel. People look at the sign and consider it, it is stable and 'true', then a train leaves the station and all of the letters start flipping as the sign changes to show the new truth about what is happening. People with no knowledge are stuck waiting for the sign to settle down before they can go to their track, people with knowledge can be heading for their track but if the track used on their arriving train is changed they will be put in motion again. The length of time it takes to change the sign is equivalent to the time it takes for a cluster to react. And and train station cannot usefully serve trains faster than the passengers can figure out which train to be on, nor can a cluster usefully process structured data faster than the truth of the relationships in that data can be ascertained.
It all collapses down to Amdahl's law of course but along the way can help you figure out where the inefficiencies are going to crop up in the system.
[1] http://www.vintage.org/projects.php http://www.vintage.org/projects.php
[2] http://www.pdl.cmu.edu/Active/index.shtml http://www.pdl.cmu.edu/Active/index.shtml
- joshu 13y agoGarth Gibson.
- ChuckMcM 13y agoargh, and thanks. In my defense, I was reading this paper (https://www.usenix.org/legacy/event/osdi00/full_papers/strunk/strunk.pdf https://www.usenix.org/legacy/event/osdi00/full_papers/strun... -- Self securing storage systems) by Garth Goodson, also of the CMU Parallel Data Lab.