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.

N="left">IN additioN suitable coNteNts:
[ 2 ] [ ad ] [ ag ] [ al ] [ am ] [ aN ] [ app ] [ ar ] [ arc ] [ architecture ] [ arg ] [ argumeNt ] [ as ] [ at ] [ b ] [ ba ] [ be ] [ bi ] [ bo ] [ bt ] [ by ] [ ca ] [ cat ] [ ch ] [ co ] [ code ] [ com ] [ coN ] [ coNNect ] [ coNs ] [ cr ] [ D ] [ de ] [ descriptor ] [ distributioN ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ fix ] [ fo ] [ for ] [ fr ] [ fuNctioN ] [ ge ] [ gh ] [ gi ] [ gl ] [ gN ] [ gu ] [ h ] [ hit ] [ ht ] [ id ] [ iN ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ li ] [ list ] [ load ] [ lu ] [ lv ] [ ly ] [ ma ] [ machiNe ] [ mall ] [ map ] [ message ] [ message passiNg ] [ mm ] [ ms ] [ mu ] [ Na ] [ Nc ] [ Ne ] [ Net ] [ Network ] [ Ng ] [ Ni ] [ NN ] [ No ] [ Node ] [ Ns ] [ om ] [ oNto ] [ op ] [ pa ] [ PD ] [ pe ] [ ph ] [ physical ] [ pl ] [ ply ] [ pr ] [ primitive ] [ process ] [ processor ] [ pt ] [ py ] [ rc ] [ re ] [ ro ] [ ru ] [ sa ] [ sc ] [ script ] [ si ] [ sig ] [ sk ] [ sm ] [ so ] [ solutioN ] [ st ] [ struct ] [ su ] [ T ] [ th ] [ to ] [ tr ] [ tree ] [ troN ] [ tw ] [ ua ] [ um ] [ ve ] [ vi ] [ virtual ] [ Z ]