Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of...

ver descrição completa

Detalhes bibliográficos
Autor principal: Andersson, Björn (author)
Outros Autores: Raravi, Gurulingesh (author)
Formato: article
Idioma:eng
Publicado em: 2015
Assuntos:
Algorithms
Performance
Theory
Cutting planes
Heterogeneous multiprocessors
Linear programming
Real-time scheduling
Texto completo:http://hdl.handle.net/10400.22/5414
País:Portugal
Oai:oai:recipp.ipp.pt:10400.22/5414

Texto Completo

http://hdl.handle.net/10400.22/5414

Registos relacionados