Nonclairvoyant scheduling (Q1331961): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)90151-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2912168264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / 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: Upper bounds for static resource allocation in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715388 / rank
 
Normal rank

Latest revision as of 16:31, 22 May 2024

scientific article
Language Label Description Also known as
English
Nonclairvoyant scheduling
scientific article

    Statements

    Nonclairvoyant scheduling (English)
    0 references
    0 references
    0 references
    0 references
    29 August 1994
    0 references
    preemptive, nonclairvoyant scheduling schemes
    0 references
    release time
    0 references
    execution time
    0 references
    preemption cost
    0 references
    inter-dependence between jobs
    0 references

    Identifiers