The Aamodt and Kjus problem
Sammendrag
We conjecture that an interesting special case of the known NP-complete problem, Multiprocessor Scheduling (MPS), is well inside P. We present a number of results that supports the conjecture. We also give some empirical results that strengthen our beliefs concerning the conjecture.Downloads
Nedlastinger
Publisert
2016-11-22
Hvordan referere
[1]
S. Kittilsen, «The Aamodt and Kjus problem», NIKT, nov. 2016.
Utgave
Seksjon
Articles