Using duplication for scheduling unitary tasks on m processors with unit communication delays (Q1391530): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Alix Munier / rank
Normal rank
 
Property / author
 
Property / author: Claire Hanen / rank
Normal rank
 
Property / author
 
Property / author: Alix Munier / rank
 
Normal rank
Property / author
 
Property / author: Claire Hanen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: C.P.M. Scheduling with Small Communication Delays and Task Duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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: Towards an Architecture-Independent Analysis of Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results on scheduling 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 12:17, 28 May 2024

scientific article
Language Label Description Also known as
English
Using duplication for scheduling unitary tasks on m processors with unit communication delays
scientific article

    Statements

    Using duplication for scheduling unitary tasks on m processors with unit communication delays (English)
    0 references
    22 July 1998
    0 references
    scheduling
    0 references
    makespan
    0 references
    communication delays
    0 references
    list scheduling algorithm
    0 references
    0 references
    0 references

    Identifiers