Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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 UET-UCT series-parallel graphs on two processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of Coffman-Graham schedules in the presence of unit communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Analysis of Two Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959420 / 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: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays / 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: Multiprocessor scheduling with communication delays / rank
 
Normal rank

Latest revision as of 11:47, 28 May 2024

scientific article
Language Label Description Also known as
English
Performance of Coffman-Graham schedules in the presence of unit communication delays
scientific article

    Statements