Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees

Barlas, GD

dc.contributor.author	Barlas, GD	en
dc.date.accessioned	2014-03-01T01:13:38Z
dc.date.available	2014-03-01T01:13:38Z
dc.date.issued	1998	en
dc.identifier.issn	1045-9219	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12622
dc.subject	Arbitrary processor trees	en
dc.subject	Collection-aware load distribution	en
dc.subject	Data-parallel applications	en
dc.subject	Optimum distribution and collection sequencing	en
dc.subject	Optimum load distribution	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	Computational complexity	en
dc.subject.other	Data reduction	en
dc.subject.other	Parallel algorithms	en
dc.subject.other	Problem solving	en
dc.subject.other	Set theory	en
dc.subject.other	Trees (mathematics)	en
dc.subject.other	Arbitrary processor trees	en
dc.subject.other	Collection aware load distributions	en
dc.subject.other	Optimum load distributions	en
dc.subject.other	Parallel processing systems	en
dc.title	Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/71.679214	en
heal.identifier.secondary	http://dx.doi.org/10.1109/71.679214	en
heal.language	English	en
heal.publicationDate	1998	en
heal.abstract	The problem of optimally distributing a divisible load to the nodes of an arbitrary processor tree is tackled in this paper. The rigorous mathematical foundation presented allows the derivation of the sequence of operations that is necessary to obtain the minimum processing time, along with closed-form expressions that yield the solution in time O(NP), where P is the number of tree nodes and N their maximum degree. The main contributions of this work are: (1) both load distribution and result collection overheads are considered, thus providing better resource utilization, and (2) arbitrary processor trees are examined in contrast with previous approaches that examined either complete homogeneous trees, or single level trees. Additionally, approximate algorithms for solving the problem of specifying the optimum subset of active processors for a given load, are presented and evaluated. © 1998 IEEE.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Transactions on Parallel and Distributed Systems	en
dc.identifier.doi	10.1109/71.679214	en
dc.identifier.isi	ISI:000073846000002	en
dc.identifier.volume	9	en
dc.identifier.issue	5	en
dc.identifier.spage	429	en
dc.identifier.epage	441	en