Extending IC-scheduling via the sweep algorithm (Q666039): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A computational economy for grid computing and its implementation in the Nimrod-G resource broker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending IC-scheduling via the sweep algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward maximizing the quality of results of dependent tasks computed unreliably / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding a Minimal Equivalent Graph of a Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking and comparison of the task graph scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994933 / rank
 
Normal rank

Latest revision as of 00:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Extending IC-scheduling via the sweep algorithm
scientific article

    Statements

    Extending IC-scheduling via the sweep algorithm (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    IC-scheduling
    0 references
    IC-scheduling theory
    0 references
    internet-based computing
    0 references
    grid computing
    0 references
    global computing
    0 references
    scheduling dags
    0 references
    0 references