Scheduling complete intrees on two uniform processors with communication delays
From MaRDI portal
(Redirected from Publication:1349970)
Recommendations
- Scheduling trees with large communication delays on two identical processors
- scientific article; zbMATH DE number 2086776
- Scheduling UET Trees with Communication Delays on two Processors
- The Complexity of Scheduling Trees with Communication Delays
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
Cites work
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- scientific article; zbMATH DE number 108110 (Why is no real title available?)
- Multiprocessor scheduling with communication delays
- The complexity of facets (and some facets of complexity)
- The complexity of scheduling problems with communication delays for trees
Cited in
(7)- Tree scheduling with communication delays
- Scheduling trees with large communication delays on two identical processors
- Scheduling on Two Unbounded Resources with Communication Costs
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Scheduling UET Trees with Communication Delays on two Processors
- scientific article; zbMATH DE number 2086776 (Why is no real title available?)
This page was built for publication: Scheduling complete intrees on two uniform processors with communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349970)
