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

.

##
###
Assigning sporadic tasks to unrelated machines

2014
*
Mathematical programming
*

We study the problem of assigning sporadic tasks to unrelated machines such that the tasks on each machine can be feasibly scheduled. Despite its importance for modern real-time systems, this problem has not been studied before. We present a polynomial-time algorithm which approximates the problem with a constant speedup factor of 8 + 2 √ 6 ≈ 12.9 and show that any polynomial-time algorithm needs a speedup factor of at least 2, unless P = NP. In the case of a constant number of machines we give

doi:10.1007/s10107-014-0786-9
fatcat:dyxvmgapzbbiznaywqe2qfebma