Afficher la notice abrégée

dc.creatorLampsas, P.en
dc.creatorLoukopoulos, T.en
dc.creatorDimopoulos, F.en
dc.creatorAthanasiou, M.en
dc.date.accessioned2015-11-23T10:37:27Z
dc.date.available2015-11-23T10:37:27Z
dc.date.issued2006
dc.identifier10.1109/PDCAT.2006.95
dc.identifier.isbn9780769527369
dc.identifier.isbn769527361
dc.identifier.urihttp://hdl.handle.net/11615/30181
dc.description.abstractWith the advent of the Grid, task scheduling in heterogeneous environments becomes more and more important. Of particular interest is the fact that especially in scientific experiments a non negligible amount of data must be transferred to the processing node before a task can commence execution. Given bandwidth constraints, scheduling both computations and data transfers is required. In this paper we first develop a suitable model that captures heterogeneity in the processing nodes while imposing communication constraints. We proceed by proposing scheduling heuristics with the aim of minimizing the total makespan of a set of independent tasks. Through a series of experiments we illustrate the potential of a particular heuristic that is based on backfilling. © 2006 IEEE.en
dc.source.urihttp://www.scopus.com/inward/record.url?eid=2-s2.0-38949139070&partnerID=40&md5=ddd78210b56b4f6f9dff7b4bed3f93df
dc.subjectComputational methodsen
dc.subjectConstraint theoryen
dc.subjectData transferen
dc.subjectHeuristic methodsen
dc.subjectOptimizationen
dc.subjectSchedulingen
dc.subjectScheduling independent tasksen
dc.subjectTask schedulingen
dc.subjectGrid computingen
dc.titleScheduling independent tasks in heterogeneous environments under communication constraintsen
dc.typeconferenceItemen


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée