Dimension-exchange algorithms for token distribution on tree-connected architectures

Houle, ME; Symvonis, A; Wood, DR

dc.contributor.author	Houle, ME	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Wood, DR	en
dc.date.accessioned	2014-03-01T01:20:16Z
dc.date.available	2014-03-01T01:20:16Z
dc.date.issued	2004	en
dc.identifier.issn	0743-7315	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15868
dc.subject	Dimension-exchange	en
dc.subject	Load balancing	en
dc.subject	Token distribution	en
dc.subject	Tree	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Computer architecture	en
dc.subject.other	Computer simulation	en
dc.subject.other	Convergence of numerical methods	en
dc.subject.other	Interconnection networks	en
dc.subject.other	Mathematical models	en
dc.subject.other	Problem solving	en
dc.subject.other	Trees (mathematics)	en
dc.subject.other	Dimension-exchange	en
dc.subject.other	Load balancing	en
dc.subject.other	Token distribution	en
dc.subject.other	Distributed computer systems	en
dc.title	Dimension-exchange algorithms for token distribution on tree-connected architectures	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.jpdc.2004.03.011	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.jpdc.2004.03.011	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	Load balancing on a multi-processor system involves redistributing tasks among processors so that each processor has roughly the same amount of work to perform. The token-distribution problem is a static variant of the load balancing problem for the case in which the workloads in the system cannot be divided arbitrarily; that is, where each token represents an atomic element of work. A scalable method for distributing tokens over a parallel architecture is the so-called dimension-exchange approach. Our results include improved analysis of two existing dimension-exchange algorithms for token distribution on arbitrary graphs and oil arbitrary trees, respectively. In particular, we establish a logarithmic upper bound on the discrepancy of the resulting distribution when the second algorithm is applied to an arbitrary initial distribution on a tree. We then present a new dimension-exchange algorithm for token distribution on trees, which assuming each node knows the number of nodes in the tree, determines a 'perfectly balanced' distribution. Furthermore, the rate of convergence is worst-case optimal for trees of bounded degree. Note that an algorithm for token-distribution on trees is applicable to arbitrary architectures, since the algorithm can be applied on a spanning tree of any given connected graph. (C) 2004 Elsevier Inc. All rights reserved.	en
heal.publisher	ACADEMIC PRESS INC ELSEVIER SCIENCE	en
heal.journalName	Journal of Parallel and Distributed Computing	en
dc.identifier.doi	10.1016/j.jpdc.2004.03.011	en
dc.identifier.isi	ISI:000222188000003	en
dc.identifier.volume	64	en
dc.identifier.issue	5	en
dc.identifier.spage	591	en
dc.identifier.epage	605	en