Uniform tasks distributed uniformly or else assigned to one processor. Investigation in theory of scheduling yielded optimal scheme for allocation of tasks among digital data processors in hypercube ensemble. Applies to tasks that require equal time to execute, performed in any order, and between any two of which equal amounts of communication required. Reduces overall processing time for given set of computational tasks.
Optimal Allocation Of Tasks In Hypercube Computers
NASA Tech Briefs ; 14 , 4
1990-04-01
Miscellaneous
No indication
English
A Complete Processor Allocation Strategy for Hypercube Computers
British Library Online Contents | 1998
|The Mark III Hypercube-Ensemble Computers
NTRS | 1988
|Dynamic Transfers Of Tasks Among Computers
NTRS | 1989
|