Node assignment in heterogeneous computing
Sukhamoy Som, United States. National Aeronautics and Space Administration. Scientific and Technical Information Program
National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1993 - Network analysis (Planning) - 39 pages
What people are saying - Write a review
We haven't found any reviews in the usual places.
1 other sections not shown
algorithm marked graph AMG is executed AMG of Figure assigned to processor block of nodes block of processors completes the proof control edges cyclo cyclo-static assignment cyclo-static with processor data packet D-l data packet number dataflow dataflow architecture dynamic assignment execution of node fully-static assignment fully-static Node Hence heterogeneous architectures heterogeneous computing initial tokens injection of packet inter-iteration tokens interval of TBO intra-iteration Langley Research Center larger than TBO line j-1 modulo multiple data packets NASA node assignment schemes node execution lines node Nj nodes are assigned null set number of initial optimally-static assignment packet D+l packet is identical packet is injected partition period of TGP periodic execution precedence constraints processor assignment scheme processor displacement Processor Number processor requirements select a node sets S1 shown in Figure single graph play static node assignment steady-state SGP t+TBO TGP lines TGP segment three processors total graph play type of nodes