Performance of critical path type algorithms for scheduling on parallel processors (Q5949904): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal scheduling for two-processor systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Tasks with Nonuniform Deadlines on Two Processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Scheduling Trees with Communication Delays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Concurrent Task Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: UET scheduling with unit interprocessor communication delays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4546239 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-complete scheduling problems / rank | |||
Normal rank |
Revision as of 21:35, 3 June 2024
scientific article; zbMATH DE number 1678857
Language | Label | Description | Also known as |
---|---|---|---|
English | Performance of critical path type algorithms for scheduling on parallel processors |
scientific article; zbMATH DE number 1678857 |
Statements
Performance of critical path type algorithms for scheduling on parallel processors (English)
0 references
5 December 2001
0 references
scheduling
0 references
0 references