Add to ORKGMany 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
Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertic...
Many parallel programming languages allow programmers to describe parallelism by using constructs su...
International audienceTechnology trends are making the cost of data movement increasingly dominant, ...
Many parallel algorithms can be modelled as directed acyclic task graphs. Recently, Degree of Simult...
A parallel program can be represented as a directed acyclic graph. An im-portant performance bound i...
When a parallel computation is represented in a formalism that imposes series-parallel structure on ...
We analyse the inherent performance of parallel software. For this end we use a task graph to model ...
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. I...
This dissertation describes selected software issues of mapping tasks onto parallel processing syste...
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted...
Abstract 1 In this paper, we survey algorithms that allocate a parallel program represented by an ed...
Large-scale multiprocessor computers have numerous communicating components, and therefore place gre...
Algorithms operating on a graph setting are known to be highly irregular and un- structured. This le...
Current multimedia and signal processing applications become more complex. This paper proposes a new...
Communicated by Editor’s name Today, large scale parallel systems are available at low cost. Many po...
Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertic...
Many parallel programming languages allow programmers to describe parallelism by using constructs su...
International audienceTechnology trends are making the cost of data movement increasingly dominant, ...
Many parallel algorithms can be modelled as directed acyclic task graphs. Recently, Degree of Simult...
A parallel program can be represented as a directed acyclic graph. An im-portant performance bound i...
When a parallel computation is represented in a formalism that imposes series-parallel structure on ...
We analyse the inherent performance of parallel software. For this end we use a task graph to model ...
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. I...
This dissertation describes selected software issues of mapping tasks onto parallel processing syste...
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted...
Abstract 1 In this paper, we survey algorithms that allocate a parallel program represented by an ed...
Large-scale multiprocessor computers have numerous communicating components, and therefore place gre...
Algorithms operating on a graph setting are known to be highly irregular and un- structured. This le...
Current multimedia and signal processing applications become more complex. This paper proposes a new...
Communicated by Editor’s name Today, large scale parallel systems are available at low cost. Many po...
Parallel programs are usually modeled by task graphs which are directed acyclic graphs. Their vertic...
Many parallel programming languages allow programmers to describe parallelism by using constructs su...
International audienceTechnology trends are making the cost of data movement increasingly dominant, ...