SCHEDULING DAGS TO MINIMIZE TIME AND COMMUNICATION

AFRATI, F; PAPADIMITRIOU, CH; PAPAGEORGIOU, G

dc.contributor.author	AFRATI, F	en
dc.contributor.author	PAPADIMITRIOU, CH	en
dc.contributor.author	PAPAGEORGIOU, G	en
dc.date.accessioned	2014-03-01T01:07:15Z
dc.date.available	2014-03-01T01:07:15Z
dc.date.issued	1988	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9888
dc.subject	Multiprocessor Scheduling	en
dc.subject	Polynomial Algorithm	en
dc.subject	Precedence Constraint	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	SCHEDULING DAGS TO MINIMIZE TIME AND COMMUNICATION	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BFb0040381	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BFb0040381	en
heal.language	English	en
heal.publicationDate	1988	en
heal.abstract	We study the complexity of a generalization of the unit-execution-time multiprocessor scheduling problem under precedence constraints, in which the number of communication arcs is also minimized. Most versions of the problem are shown NP-complete, and two polynomial algorithms are presented for specialized cases.	en
heal.publisher	SPRINGER VERLAG	en
heal.journalName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/BFb0040381	en
dc.identifier.isi	ISI:A1988P956000009	en
dc.identifier.volume	319	en
dc.identifier.spage	134	en
dc.identifier.epage	138	en