Add to ORKGAbstract. It is known that task scheduling problem of a complete kary intree with unit time tasks and general communication delays onto an unlimited number of processors is NP-complete. In this paper, we show that such a problem can be solved in linear time if we restrict communication delays within the range from (k − 1) to k unit times. We also show that naive scheduling is optimal if communication delays are constant and at most (k − 1) unit times.
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
In the last few years, scheduling jobs due to communication delays has received a great deal of atte...
It is known that task scheduling problem of a complete kary intree with unit time tasks and general...
AbstractThis paper considers the problem of scheduling a tree-structured task system in a distribute...
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length ta...
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length ta...
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length ta...
AbstractThis paper considers the problem of scheduling a tree-structured task system in a distribute...
AbstractWe consider the problem of scheduling outforests and inforests with non-uniform deadlines su...
International audienceIn this paper, we present an algorithm that builds optimal schedules for compl...
We consider the problem of scheduling trees on two identical processors in order to minimize the mak...
AbstractThe problem of scheduling task graphs on multiprocessor systems have received considerable a...
AbstractThe problem of scheduling task graphs on multiprocessor systems have received considerable a...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
In the last few years, scheduling jobs due to communication delays has received a great deal of atte...
It is known that task scheduling problem of a complete kary intree with unit time tasks and general...
AbstractThis paper considers the problem of scheduling a tree-structured task system in a distribute...
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length ta...
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length ta...
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length ta...
AbstractThis paper considers the problem of scheduling a tree-structured task system in a distribute...
AbstractWe consider the problem of scheduling outforests and inforests with non-uniform deadlines su...
International audienceIn this paper, we present an algorithm that builds optimal schedules for compl...
We consider the problem of scheduling trees on two identical processors in order to minimize the mak...
AbstractThe problem of scheduling task graphs on multiprocessor systems have received considerable a...
AbstractThe problem of scheduling task graphs on multiprocessor systems have received considerable a...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
A set of unit-time tasks has to be processed on an unrestricted number of processors subject to prec...
In the last few years, scheduling jobs due to communication delays has received a great deal of atte...