Elsevier

Parallel Computing

Volume 16, Issue 1, November 1990, Pages 75-79
Parallel Computing

Short communication
A note on the load balancing problem for coarse grained hypercube dictionary machines

https://doi.org/10.1016/0167-8191(90)90161-2Get rights and content

Abstract

The main problem for the design of dictionary machines on coarse grained hypercube multiprocessors, in comparison to the widely studied dictionary problem for fine grained hypercube multiprocessors, is that due to unequal distribution of the inserted and deleted records, the sizes of the sets stored at the individual processors may vary considerably. This problem, which is usually referred to as the load balancing problem, may lead to considerable degradation of the dictionary machine's performance. In this note we show that the load balancing problem for coarse grained hypercube dictionary machines can be solved with provable bounds on the sizes of the data sets, and with only little computational overhead.

References (13)

  • M.J. Atallah et al.

    A generalized dictionary machine for VLSI

    IEEE Trans. Comput.

    (1985)
  • J.L. Bentley et al.

    A tree machine for searching problems

  • J.H. Chang et al.

    Systolic tree implementation of data structures

    IEEE Trans. Comput.

    (1988)
  • F. Dehne et al.

    Optimal VLSI dictionary machines on meshes

  • F. Dehne et al.

    An optimal VLSI dictionary machine for hypercube architectures

  • A.L. Fisher

    Dictionary machines with small number of processors

There are more references available in the full text version of this article.

Cited by (6)

  • A scalable design for VLSI dictionary machines

    1995, Microprocessing and Microprogramming
  • Achieving good performance for dictionary machines; A scalable distributed data balancing technique

    1996, Proceedings of 4th Euromicro Workshop on Parallel and Distributed Processing, PDP 1996
  • Regular versus irregular problems and algorithms

    1995, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • MIMD dictionary machines: From theory to practice

    1992, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • A simple load balancing scheme for task allocation in parallel machines

    1991, Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991

The first author's research is partially supported by the Natural Sciences and Engineering Research Council of Canada (Grant A9173). The second author's research is partially supported by the Direction de la Recherche et des Etudes Techniques and the Programme de Recherche Coordonnees C3 (France).

View full text