An efficient algorithm for solving the token distribution problem on k-ary d-cube networks

Author

Diderich, Claude G. ; Gengler, Marc ; Ubéda, Stéphane

Author_Institution

Comput. Sci. Theory Lab., Swiss Federal Inst. of Technol., Lausanne, Switzerland

fYear

1994

fDate

14-16 Dec 1994

Firstpage

175

Lastpage

182

Abstract

In parallel programs where the problem data is dynamically generated, it is very useful to be able to rely on an efficient load balancing algorithm. The token distribution problem (TDP) is a generalization of the static load balancing problem. The paper describes a novel algorithm for solving the TDP for k-ary d-cube topology networks. Compared to other algorithms, our method is more general and does not rely on every processor knowing the exact number of tokens associated to each processor. The correctness of the algorithm is proved and its complexity is informally studied

Keywords

multiprocessor interconnection networks; parallel programming; resource allocation; TDP; complexity; correctness; efficient algorithm; k-ary d-cube networks; load balancing algorithm; parallel programs; static load balancing problem; token distribution problem; Algorithm design and analysis; Computer science; Concurrent computing; Heuristic algorithms; Laboratories; Load management; Network topology; Parallel architectures; Polynomials; Signal generators;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Conference_Location

Kanazawa

Print_ISBN

0-8186-6507-6

Type

conf

DOI

10.1109/ISPAN.1994.367149

Filename

367149