National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Multiprocessor Randomized On-line Scheduling
Tichý, Tomáš
This paper studies randomized on-line non-preemptive scheduling in multiprocessor systems. In this problem each task is specified by its processing time andscheduled on any of $m$ identical processors. The objective is to minimize theexpected mekespan. We prove lemmas and theorems describing $sigma_m$-competitive randomized algorithms on $m$ processors. The main result is an........

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