## Modeling and optimum time performance for concurrent processingNational Aeronautics and Space Administration, Scientific and Technical Information Division, 1988 - Computers - 45 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

achieves optimum algorithm decomposition algorithm marked graph ATAMM model components bounds for TBIO CMG corresponding computational marked graph computer architecture computing resources concurrent processing concurrent systems construction rules contains no token-free control flow data flow architecture data input source data output sink data token decomposed algorithms Definition diagram with TBO elementary firing vector envelope overlay diagram example algorithm graph global memory graph for Figure graph G Graph play graph properties hardware horizontal concurrency IEEE Transactions implement incidence matrix input data Langley Research Center lower bounds maximum vertical concurrency minimum number Modified algorithm graph multiprocessor node marked graph number of computing number of tokens Old Dominion University operating strategy optimum time performance performance measures Petri net marked play with TB0 primitive operations problem Resource envelope overlay resource utilization envelope RMax shown in Figure single task TBIO and TT Theorem throughput capacity throughput rate token-free directed circuits TTLB unlimited functional units