Siegel, Howard Jay, authorMaciejewski, Anthony A., authorNation, Wayne G., authorIEEE, publisher2007-01-032007-01-031992Nation, Wayne G., Anthony A. Maciejewski, and Howard Jay Siegel, Exploiting Concurrency Among Tasks in Partitionable Parallel Processing Systems, Proceedings: the Sixth International Parallel Processing Symposium, March 23-26, 1992, Beverly Hills, California: 30-38.http://hdl.handle.net/10217/1207One benefit of partitionable parallel processing systems is their ability to execute multiple independent tasks simultaneously. Previous work has identified conditions such that, when there are k tasks to be processed, partitioning the system such that all k tasks are processed simultaneously results in a minimum overall execution time. An alternate condition is developed that provides additional insight into the effects of parallelism on execution time. This result, and previous results, however, assume that execution times are data independent. It will be shown that data-dependent tasks do not necessarily execute faster when processed simultaneously even if the condition is met. A model is developed that provides for the possible variability of a task's execution time and is used in a new framework to study the problem of finding an optimal mapping for identical, independent data-dependent execution time tasks onto partitionable systems. Extension of this framework to situations where the k tasks are non-identical is discussed.born digitalproceedings (reports)eng©1992 IEEE.Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.parallel architecturesparallel algorithmsconcurrency controlcomputational complexityText