Jain, Kamal Kumar ; Rajaraman, V. (1994) Parallelism measures of task graphs for multiprocessors Microprocessing & Microprogramming, 40 (4). pp. 249-259. ISSN 0165-6074
Full text not available from this repository.
Official URL: http://linkinghub.elsevier.com/retrieve/pii/016560...
Related URL: http://dx.doi.org/10.1016/0165-6074(94)90133-3
Abstract
Many parallel algorithms can be modelled as directed acyclic task graphs. Recently, Degree of Simultaneousness (DS) and Degree of Connection (DC) have been defined as the two measures of parallelism in algorithms represented by task graphs. However, those definitions are not appropriate measures of parallelism when task graphs are to be executed on a multiprocessor system with N processors. In this paper, we give new definitions of DS and DC using a new parameter we call Uniformity Factor (UF). These new definitions are more meaningful when an acyclic task graph is to be executed on a multiprocessor system with N processors.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Directed Acyclic Task Graphs; Parallelism Measures |
| ID Code: | 38362 |
| Deposited On: | 29 Apr 2011 08:05 |
| Last Modified: | 29 Apr 2011 08:05 |
Repository Staff Only: item control page
