This Article 
 Bibliographic References 
 Add to: 
A Distributed Management Scheme for Partitionable Parallel Computers
January 1990 (vol. 1 no. 1)
pp. 120-126

A distributed scheme for dynamic partitioning is investigated. Distributed procedures to split a subsystem and to combine subsystems are presented. The correctness of each of these two procedures is shown, and the complexity is analyzed. The procedures are applicable to parallel computers that use interconnection networks, such as hypercube, omega, multistage cube, and extra-stage cube networks.

[1] G. B. Adams, III, and H. J. Siegal, "The extra stage cube: A fault-tolerant interconnection network for supersystems,"IEEE Trans. Comput., vol. C-31, pp. 443-454, May 1982.
[2] C. H. Chu, E. J. Delp, L. H. Jamieson, H. J. Siegel, F. J. Weil, and A. B. Whinston, "A model for an intelligent operating system for executing image understanding task on a reconfigurable parallel architecture,"J. Parallel Distributed Computing, pp. 598-622, June 1989.
[3] M.-S. Chen and K. G. Shin, "Processor allocation in anN-cube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C-36, no. 12, pp. 1396-1407, Dec. 1987.
[4] W. Crowther, J. Goodhue, E. Starr, R. Thomas, W. Milliken, and T. Blackadar, "Performance measurements on a 128-node butterfly parallel processor," in1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 531-540.
[5] M. Dubois, C. Scheurich, and F. A. Briggs, "Synchronization, coherence, and event ordering in multiprocessors,"Computer, vol. 21, pp. 9-21, Feb. 1988.
[6] J. P. Fishburn and R. A. Finkel, "Quotient networks,"IEEE Trans. Comput., vol. C-31, pp. 288-295, Apr. 1982.
[7] J. L. Gersting,Mathematical Structures for Computer Science. New York: Freeman, 1987, 2nd ed.
[8] A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, "The NYU ultracomputer-Designing an MIMD shared memory parallel computer,"IEEE Trans Comput., vol. C-32, pp. 175-189, Feb. 1983.
[9] J. P. Hayeset al., "A microprocessor-based hypercube supercomputer,"IEEE Micro, vol. 6, pp. 6-17, Oct. 1986.
[10] M. Jeng and H. J. Siegel, "Dynamic partitioning in a class of parallel systems," in8th Int. Conf. Distributed Computing Syst., June 1988, pp. 33-40.
[11] M. Jeng and H. J. Siegel, "Design and analysis of dynamic redundancy networks,"IEEE Trans. Comput., vol. 37, pp. 1019-1029, Sept. 1988.
[12] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[13] W. Lin and C.-L. Wu, "An object-based resource management for a high-performance distributed computing system-STAR," in8th Int. Comput. Software Appli. Conf., Nov. 1984, pp. 208-216.
[14] W. Lin and C. L. Wu, "Reconfiguration procedures for a polynomial partitionable multiprocessor,"IEEE Trans. Comput., vol. C-35, pp. 910-916, Oct. 1986.
[15] R. J. McMillen and H. J. Siegel, "Routing schemes for the augmented data manipulator network in an MIMD system,"IEEE Trans. Comput., vol. C-31, pp. 1202-1214, Dec. 1982.
[16] E. Opper and M. Malek, "Resource allocation for a class of problem structures in multistage interconnection network-based systems," in3rd Int. Conf. Distributed Computing Syst., Oct. 1982, pp. 106- 113.
[17] D. S. Parker and C. S. Raghavendra, "The gamma network,"IEEE Trans. Comput., vol. C-33, pp. 367-373, Apr. 1984.
[18] G. F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. Kleinfelder, K. P. McAuliffe, E. A. Melton, V. A. Norton, and J. Weiss, "The IBM research parallel processor prototype (RP3): Introduction and architecture," in1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 764-771.
[19] U. V. Premkumar and J. C. Browne, "Resource allocation in rectangular SW-banyans," inProc. 9th Annu. Symp. Comput. Architecture, Apr. 1982, pp. 326-333.
[20] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[21] H. J. Siegel, "The theory underlying the partitioning of permutation networks,"IEEE Trans. Comput., vol. C-29, pp. 791-801, Sept. 1980.
[22] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[23] H. J. Siegel, W. T.-Y. Hsu, and M. Jeng, "An introduction to the multistage cube family of interconnection networks,"The J. Supercomputing, vol. 1, pp. 13-42, 1987.
[24] H. J. Siegel, T. Schwederski, J. T. Kuehn, and N. J. Davis IV, "An overview of the PASM parallel processing system," inComputer Architecture, D. D. Gajski, V. M. Milutinovic, H. J. Siegel, and B. P. Furht, Eds. Washington, DC: IEEE Computer Society Press, 1987, pp. 387-407.
[25] L. W. Tucker and G. G. Robertson, "Architecture and applications of the Connection Machine,"Computer, vol. 21, pp. 26-38, Aug. 1988.
[26] A. Varma and C. S. Raghavendra, "On permutations passable by the Gamma network,"J. Parallel Distributed Comput., vol. 3. no. 1, pp. 72-91, Mar. 1986.
[27] S. Yalamanchili and J. K. Aggarwal, "Reconfiguration strategies for parallel architectures," Computer, vol. 18, pp. 44-61, Dec. 1985.

Index Terms:
Index TermsPASM; task allocation; parallel computation; distributed splitting process; speed-up oriented; resource fragments; distributed combining process; throughput oriented; distributed management scheme; partitionable parallel computers; dynamic partitioning; correctness; interconnection networks; hypercube; omega; multistage cube; extra-stage cube networks; computational complexity; multiprocessor interconnection networks; parallel architectures
M. Jeng, H.J. Siegel, "A Distributed Management Scheme for Partitionable Parallel Computers," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 1, pp. 120-126, Jan. 1990, doi:10.1109/71.80130
Usage of this product signifies your acceptance of the Terms of Use.