Scheduling trees with large communication delays on two identical processors

Afrati, F; Bampis, E; Finta, L; Milis, I

dc.contributor.author	Afrati, F	en
dc.contributor.author	Bampis, E	en
dc.contributor.author	Finta, L	en
dc.contributor.author	Milis, I	en
dc.date.accessioned	2014-03-01T01:15:52Z
dc.date.available	2014-03-01T01:15:52Z
dc.date.issued	2000	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13785
dc.subject	Binary Tree	en
dc.subject	Communication Delay	en
dc.subject	Polynomial Time Algorithm	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	COMPLEXITY	en
dc.subject.other	GRAPHS	en
dc.title	Scheduling trees with large communication delays on two identical processors	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-44520-X_38	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-44520-X_38	en
heal.language	English	en
heal.publicationDate	2000	en
heal.abstract	We consider the problem of scheduling trees on two identical processors in order to minimize the makespan. We assume that tasks have unit execution times, and arcs are associated with large identical communication delays. We prove that the problem is NP-hard in the strong sense even when restricted to the class of binary trees, and we provide a polynomial-time algorithm for complete binary trees.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-44520-X_38	en
dc.identifier.isi	ISI:000189042500038	en
dc.identifier.volume	1900	en
dc.identifier.spage	288	en
dc.identifier.epage	295	en