Short communicationA note on the load balancing problem for coarse grained hypercube dictionary machines☆
References (13)
- et al.
A generalized dictionary machine for VLSI
IEEE Trans. Comput.
(1985) - et al.
A tree machine for searching problems
- et al.
Systolic tree implementation of data structures
IEEE Trans. Comput.
(1988) - et al.
Optimal VLSI dictionary machines on meshes
- et al.
An optimal VLSI dictionary machine for hypercube architectures
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 MicroprogrammingExact dynamic load balancing of MIMD architectures with linear programming algorithms
1992, Parallel ComputingAchieving good performance for dictionary machines; A scalable distributed data balancing technique
1996, Proceedings of 4th Euromicro Workshop on Parallel and Distributed Processing, PDP 1996Regular 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).
Copyright © 1990 Published by Elsevier B.V.