ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Parallelism measures of task graphs for multiprocessors

Jain, Kamal Kumar and Rajaraman, V (1994) Parallelism measures of task graphs for multiprocessors. In: Microprocessing & Microprogramming, 40 (4). pp. 249-259.

[img] PDF
Restricted to Registered users only

Download (698kB) | Request a copy


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: Journal Article
Publication: Microprocessing & Microprogramming
Publisher: Elsevier
Additional Information: The copyright of this article belongs to Elsevier.
Keywords: Directed acyclic task graphs;Parallelism measures
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 16 Oct 2006
Last Modified: 19 Sep 2010 04:30
URI: http://eprints.iisc.ac.in/id/eprint/8215

Actions (login required)

View Item View Item