Peelsched: a Simple and Parallel Scheduling Algorithm for Static Taskgraphs

dc.contributor.author	Keller, Jörg
dc.contributor.author	Gerhards, Rainer
dc.date.accessioned	2017-12-06T09:06:16Z
dc.date.available	2017-12-06T09:06:16Z
dc.date.issued	2011
dc.description.abstract	We present a new algorithm, which we call P EELSCHED, to schedule a set of tasks with precedence constraints and communication costs onto a parallel computer with homogeneous processing units. The algorithm is deterministic and simple, and can be parallelized itself. The new algorithm is based on the usage of structural graph properties, in particular series-parallel or N-free graphs, but can be used on any DAG. We provide an implementation and validate it against a benchmark suite of task graphs. We find that the algorithm's scheduling results are comparable to strictly sequential schedulers.	en
dc.identifier.doi	10.1007/BF03341989
dc.identifier.pissn	0177-0454
dc.identifier.uri	https://dl.gi.de/handle/20.500.12116/8558
dc.language.iso	en
dc.publisher	Gesellschaft für Informatik e.V.
dc.relation.ispartof	PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware: Vol. 28, No. 1
dc.relation.ispartofseries	PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware
dc.subject	Source Node
dc.subject	Schedule Algorithm
dc.subject	Optimal Schedule
dc.subject	Sink Node
dc.subject	Precedence Constraint
dc.title	Peelsched: a Simple and Parallel Scheduling Algorithm for Static Taskgraphs	en
dc.type	Text/Journal Article
gi.citation.endPage	109
gi.citation.startPage	100

Dateien

1 - 1 von 1