Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3856
Título: Assigning real-time tasks on heterogeneous multiprocessors with two types of processors
Autor: Andersson, Björn
Bletsas, Konstantinos
Data: 2009
Editora: IPP-Hurray Group
Resumo: Consider the problem of scheduling a set of implicitdeadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a timecomplexity of O(n·m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a low-complexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3856
Versão do Editor: http://www.cister.isep.ipp.pt/docs/
Aparece nas colecções:ISEP – CISTER – Relatórios

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
REL_Bjorn Andersson_2009_CISTER.pdf212,43 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.