Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128696268, #quickstatements; #temporary_batch_1723680031063
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Transactional contention management as a Non-clairvoyant scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum Multicoloring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts: Online and offline algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for scheduling conflicting jobs with minsum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of transactional contention managers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A still better performance guarantee for approximate graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring inductive graphs on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts on bipartite and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on contention management algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive analysis for balanced transactional memory workloads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Window-based greedy contention management for transactional memory: theory and practice / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128696268 / rank
 
Normal rank

Latest revision as of 01:02, 15 August 2024

scientific article
Language Label Description Also known as
English
Non-clairvoyant scheduling with conflicts for unit-size jobs
scientific article

    Statements

    Non-clairvoyant scheduling with conflicts for unit-size jobs (English)
    0 references
    0 references
    13 February 2019
    0 references
    competitive analysis
    0 references
    online algorithms
    0 references
    conflict graphs
    0 references
    non-clairvoyant scheduling
    0 references
    makespan minimization
    0 references

    Identifiers