Zero Assignment Parallel Processor. A virtual tree machine architecture in which a process tree is dynamically mapped onto a fixed, strongly connected network of processors communicating by message passing. The basic operation of each node is to apply a divide and conquer function which takes four arguments: (1) a function 'primitive' which takes a problem description (PD) and returns true if it can be solved without division, (2) a function 'solve' which takes a primitive PD and returns its solution, (3) a function 'divide' which takes a PD and returns a list of PDs of smaller problems and (4) a function 'combine' which returns the solution to a problem by combining a list of solutions of subproblems.
Each node has a copy of the code and one is given the initial problem description. Task distribution is by process stealing in which a process constructs a descriptor for each subtask and idle (lightly loaded) processors can steal a descriptor from a physically connected neighbour.
"Huh-huh," Golnik asserted weakly, and zapp grew purple with rage.
"I told you that silk was too good for them garments, Birsky," zapp cried.
zapp cried in alarm, "transfer back that five hundred dollars after what Feigenbaum tells us?"
zapp and me donate five hundred dollars to your rotten society!
Which of your operators do you consider is the strongest, Mr. zapp?
"Aber we are running our society on our own idees, Mr. Eschenbach," zapp said.
He rose to his feet and took off his hat and coat, preparatory to going over Birsky & zapp's sample line.
So, when them Roshoyim come in here, zapp, tell 'em to wait till I get back.
He swung his bat at a pebble that lay in his path and Birsky and zapp edged away.
"We ain't got no such idee in our head at all," zapp assured him almost tearfully.