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.
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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.J. Atallah and S.R. Kosaraju, "A generalized dictionary machine for VLSI", IEEE Trans. on Computers 34:2, 1985, pp. 151–155.
J.L. Bentley, and H.T. Kung, "A tree machine for searching problems", Proc. 1979 Int. Conf. on Parallel Processing, 1979, May 1981, pp. 257–266.
J.H. Chang, O.H. Ibarra, M.J. Chung, and K.K. Rao, "Systolic tree implementation of data structures", IEEE Trans. on Computers 37:6, 1988, pp. 727–735.
F. Dehne, N. Santoro, "Optimal VLSI dictionary machines on meshes", Proc. Int. Conf. on Parallel Processing, 1987, pp. 832–840.
F. Dehne, N. Santoro, "An optimal VLSI dictionary machine for hypercube architectures", Parallel and Distributed Algorithms, M. Cosnard (ed.), North Holland, 1989, pp. 137–144.
A.L. Fisher, "Dictionary machines with small number of processors", Proc. Int. Symp. on Computer Architecture, June 1984, pp. 151–156.
C.P. Kruskal, L. Rudolph, M. Snir, "The power of parallel profix", Proc. Int. Conf. on Parallel Processing, 1985, pp.180–184.
C.E. Leiserson, "Systolic priority queues", Report CMU-CS-79-115, Carnegie-Mellon University, April 1979.
D. Nassimi, S. Sahni, "Brodcasting data in SIMD Computers", IEEE Trans. on Computers 30:2, 1981, pp 101–107.
A.R. Omondi, J. D. Brock, "Implementing a dictionary on hypercube machines", Proc. Int. Conf. on Parallel Processing, 1987, pp.707–709.
T.A. Ottman, A.L. Rosenberg, and L.J. Stockmeyer, "A dictionary machine for VLSI", IEEE Trans. on Computers 31:9, 1982, pp. 892–897.
A.K. Somani and V.K. Agarwal, "An efficient unsorted VLSI dictionary machine", IEEE Trans. on Computers 34:9, 1985, pp. 841–852.
A.M. Schwartz and M.C. Loui, "Dictionary machines on cube-class networks", IEEE Trans. on Computers 36:1, 1987, pp. 100–105.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dehne, F., Gastaldo, M. (1990). A note on the load balancing problem for coarse grained hypercube dictionary machines. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_120
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_120
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive