A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors

2010
*
2010 31st IEEE Real-Time Systems Symposium
*

Consider the problem of partitioned scheduling of an implicit-deadline sporadic task set on heterogeneous multiprocessors to meet all deadlines. Each processor is either of type-1 or type-2. We present a new algorithm, FF-3C, for this problem. FF-3C offers low time-complexity and provably good performance. Specifically, FF-3C offers (i) a time-complexity of O(n · max(m, log n) + m · log m), where n is the number of tasks and m is the number of processors and (ii) the guarantee that if a task

doi:10.1109/rtss.2010.32
dblp:conf/rtss/AnderssonRB10
fatcat:7hpw3ghaxvdt5iwhnl2rlvzefi