dc.creator | Lampsas, P. | en |
dc.creator | Loukopoulos, T. | en |
dc.creator | Dimopoulos, F. | en |
dc.creator | Athanasiou, M. | en |
dc.date.accessioned | 2015-11-23T10:37:27Z | |
dc.date.available | 2015-11-23T10:37:27Z | |
dc.date.issued | 2006 | |
dc.identifier | 10.1109/PDCAT.2006.95 | |
dc.identifier.isbn | 9780769527369 | |
dc.identifier.isbn | 769527361 | |
dc.identifier.uri | http://hdl.handle.net/11615/30181 | |
dc.description.abstract | With 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.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-38949139070&partnerID=40&md5=ddd78210b56b4f6f9dff7b4bed3f93df | |
dc.subject | Computational methods | en |
dc.subject | Constraint theory | en |
dc.subject | Data transfer | en |
dc.subject | Heuristic methods | en |
dc.subject | Optimization | en |
dc.subject | Scheduling | en |
dc.subject | Scheduling independent tasks | en |
dc.subject | Task scheduling | en |
dc.subject | Grid computing | en |
dc.title | Scheduling independent tasks in heterogeneous environments under communication constraints | en |
dc.type | conferenceItem | en |