The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper we consider the problem of scheduling precedence task graphs in parallel processing where there can be disturbances in computation and communication times. Such a phenomenon often occurs in practice, due to our inability to exactly predict the time because of system intrusion like cache miss and packet transmission time in mediums like ethernet etc. We propose a method based on the addition of some extra edges to protect the initial scheduling from performing badly due to such changes...
In this paper we consider the problem of scheduling precedence task graphs in
parallel processing where there can be disturbances in computation and
communication times. Such a phenomenon often occurs in practice, due to our
inability to exactly
predict the time because of system intrusion like cache miss
and packet transmission time in mediums like ethernet etc.
We propose a method based on the addition of some extra edges to protect the
initial scheduling from performing badly
due to such...
Download Results (CSV)