Provably good scheduling of sporadic tasks with resource sharing on a two-type ...

• Autor(es): Raravi, Gurulingesh ; Andersson, Björn ; Bletsas, Konstantinos
• Data: 2011
• Identificador Persistente: http://hdl.handle.net/10400.22/3748
• Origem: Repositório Científico do Instituto Politécnico do Porto
• Assunto(s): Heterogeneous multiprocessor systems; Real-time scheduling; Resource sharing
• Tipo de Documento: Relatório
• Idioma: Inglês

Descrição

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of R shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(R/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.