Scheduling in the dark (Q5918075): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Q4719334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using parallel program characteristics in dynamic processor allocation policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiprocessor system scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing flow time nonclairvoyantly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smart SMART Bounds for Weighted Response Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application scheduling and processor allocation in multiprogrammed parallel processing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335201 / rank
 
Normal rank

Latest revision as of 16:33, 29 May 2024

scientific article; zbMATH DE number 1454437
Language Label Description Also known as
English
Scheduling in the dark
scientific article; zbMATH DE number 1454437

    Statements

    Scheduling in the dark (English)
    0 references
    4 June 2000
    0 references
    0 references
    scheduling
    0 references
    competitive ratio
    0 references
    equal-partition
    0 references
    response
    0 references