National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Dolní odhad pro omezené pravděpodobnostní online algoritmy pro rozvrhování
Tichý, Tomáš
This paper studies a restricted class of randomized on-line non-preemptive algorithms for scheduling in multiprocessor systems. In this class each task is specified by its processing time and scheduled to a processor with the smallest or $h$th biggest load for a fixed $h$. The competitive ratio is the maximum of the ratios of the expected makespan and the optimal makespan over all.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.