Scheduling In and Out Forests in the Presence of Communication Delays

Varvarigou, T; Roychowdhury, V; Kailath, T; Lawler, E

dc.contributor.author	Varvarigou, T	en
dc.contributor.author	Roychowdhury, V	en
dc.contributor.author	Kailath, T	en
dc.contributor.author	Lawler, E	en
dc.date.accessioned	2014-03-01T01:44:30Z
dc.date.available	2014-03-01T01:44:30Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24392
dc.subject	Communication Delay	en
dc.subject	Correspondence Problem	en
dc.subject	Linear Time Algorithm	en
dc.subject	Message Passing	en
dc.subject	Multiprocessor Architecture	en
dc.subject	Multiprocessor Systems	en
dc.subject	Optimal Scheduling	en
dc.subject	Polynomial Time	en
dc.subject	Polynomial Time Algorithm	en
dc.subject	Precedence Constraint	en
dc.subject	Scheduling Problem	en
dc.subject	Time Complexity	en
dc.title	Scheduling In and Out Forests in the Presence of Communication Delays	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/71.539738	en
heal.identifier.secondary	http://dx.doi.org/10.1109/71.539738	en
heal.publicationDate	1996	en
heal.abstract	We consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the scheduling problem is to allocate the tasks to processors such that the pre-specified precedence constraints among the tasks are obeyed and certain cost-measures (such as the computation time) are minimized. Several cases of the scheduling problem have	en
heal.journalName	IEEE Transactions on Parallel and Distributed Systems	en
dc.identifier.doi	10.1109/71.539738	en