Please use this identifier to cite or link to this item: https://app.uff.br/riuff/handle/1/17110
Title: Escalonamento estático de tarefas em ambientes computacionais heterogêneos sob o modelo logP
Keywords: Processamento paralelo (Computadores);  Escalonamento de tarefas;  Heurística;  Modelo LogP;  O problema do escalonamento de tarefas (PET);  Processadores heterogêneos;  Tempo de execução paralelo;  Modelo logP;  Grades computacionais;  Parallel processing;  The task scheduling problem;  Heterogeneous processors;  Heuristics;  Makespan;  LogP model;  Clusters;  Grids computing
Issue Date: 20-Nov-2004
Abstract: Numerous applications require more performance than event state-of-the- art sequencial computers can provide in order to be executed in acceptable time frames. With high costs of acquisition and maintenance of supercomputers, cheaper parallel computing alternatives such as Computing Clusters, and more recently Computational Grids, are now becoming the computing systems of choice within research centers, companies and universities. On these platforms, the efficient scheduling of the tasks of a parallel application is crucial to obtaining good performance. This work studies the problem of scheduling tasks in systems of distributed heterogeneous resources which communicative via message passing. The processing costs to send and to receive messages (traditional ignored by scheduling algorithms) can dramatically influence the execution time of parallel applications. In this dissertation three new strategies are proposed to enable list scheduling heuristics to handle these overhead costs appropriately in order to generate efficient schedules of environments such as Clusters and Computational Grids. Based on the logP model, results show that two of the proposed strategies provide significant improvements over the only existing approach known in the literature.
URI: https://app.uff.br/riuff/handle/1/17110
Appears in Collections:TEDE com arquivos

Files in This Item:
File SizeFormat 
Deolinda Cardoso-dissert.pdf6.51 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.