Scheduling in and Out Forests in the Presence of Communication Delays

Varvarigou, T; Roychowdhury, V; Kailath, T

dc.contributor.author	Varvarigou, T	en
dc.contributor.author	Roychowdhury, V	en
dc.contributor.author	Kailath, T	en
dc.date.accessioned	2014-03-01T02:48:10Z
dc.date.available	2014-03-01T02:48:10Z
dc.date.issued	1993	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33597
dc.subject	Communication Delay	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 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	conferenceItem	en
heal.identifier.primary	10.1109/IPPS.1993.262886	en
heal.identifier.secondary	http://dx.doi.org/10.1109/IPPS.1993.262886	en
heal.publicationDate	1993	en
heal.abstract	The authors 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 computation time) are minimized. Several cases of the scheduling problem have	en
heal.journalName	International Parallel and Distributed Processing Symposium/International Parallel Processing Symposium	en
dc.identifier.doi	10.1109/IPPS.1993.262886	en