This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eliminating Memory for Fragmentation Within Partitionable SIMD/SPMD Machines
July 1991 (vol. 2 no. 3)
pp. 290-303

Efficient data layout is an important aspect of the compilation process. A model for the creation of perfect memory maps for large-scale parallel machines capable ofuser-controlled partitionable single-instruction-multiple data/single-program-multiple data (SIMD/SPMD) operation is developed. The term perfect implies that no memory fragmentation occurs and ensures that the memory map size is kept to a minimum. A major constraint on solving this problem is based on the single program nature of both the SIMD and SPMD modes of parallelism. It is assumed that all processors within the same submachine used identical addresses to access corresponding data items in each of their local memories. Necessary and sufficient conditions are derived for being able to create perfect memory maps, and results are applied to several partitionable interconnection networks.

[1] A. Aho, J. Hopcroft, and J. Ullman,Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
[2] M. Auguin and F. Boeri, "The OPSILA computer," inParallel Languages and Architectures, M. Consard, Ed. Amsterdam, The Netherlands, Elsevier Science, 1986, pp. 143-153.
[3] M. Auguin, F. Boeri, J. P. Dalban, and A. Vincent-Carrefour, "Experience using a SIMD/SPMD multiprocessor architecture,"Microprocessing Microprogramming, vol. 21, pp. 171-177, Aug. 1987.
[4] G. H. Barnes, R. Brown, M. Kato, D. J. Kuck, D. L. Slotnick, and R. A. Stokes, "The Illiac IV computer,"IEEE Trans. Comput., vol. C-17, pp. 746-757, Aug. 1968.
[5] Berg, T.B., and H.J. Siegel, "Instruction Execution Trade-offs for SIMD versus MIMD versus Mixed-Mode Parallelism,"Proc. Fifth Int'l Parallel Processing Symp., IEEE CS Press, Los Alamitos, Calif., Order No. 2167, 1991, pp. 301-308.
[6] E. C. Bronson, T. L. Casavant, and L. H. Jamieson, "Experimental application-driven architecture analysis of an SIMD/MIMD parallel processing system,"IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 195-205, Apr. 1990.
[7] 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.
[8] W. Crowther, J. Goodhue, R. Thomas, W. Milliken, and T. Blackadar, "Performance measurements on a 128-node butterfly parallel processor," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 531-540.
[9] F. Darema-Rodgers, D. A. George, V. A. Norton, and G. F. Pfister, "Environment and system interface for VM/EPEX," Res. Rep. RC11381 (#51260), IBM T. J. Watson Research Center, 1985.
[10] F. Darema-Rodgers, D. A. George, V. A. Norton, and G. F. Pfister, "A single-program-multiple-data computational model for EPEX/FORTRAN,"Parallel Comput., vol. 7, pp. 11-24, Apr. 1988.
[11] P. Duclos et al., "Image Processing on a SIMD/SPMD Architecture: Opsila,"Proc. Ninth Int'l Conf. Pattern Recognition, IEEE CS Press, Los Alamitos, Calif., Order No. 878, 1988, pp. 430-433.
[12] T. Feng, "Data manipulating functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C-23, pp. 309-318, Mar. 1974.
[13] S.A. Fineberg, T.L. Casavant, and H.J. Siegel, "Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting,"J. Parallel and Distributed Computing, Vol. 11, No. 3, Mar. 1991, pp. 239-251.
[14] M. J. Flynn, "Very high-speed computing systems,"Proc. IEEE, vol. 54, pp. 1901-1909, Dec. 1966.
[15] J. L. Gersting,Mathematical Structures for Computer Science. New York: Freeman, 1987, 2nd ed.
[16] J.P. Hayes and T.N. Mudge, "Hypercube Supercomputers,"Proc. IEEE, Vol. 77, No. 12, Dec. 1989, pp. 1,829-1,841.
[17] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[18] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[19] G.J. Lipovski and M. Malek,Parallel Computing: Theory and Comparisons, John Wiley&Sons, New York, 1987.
[20] 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.
[21] R. J. McMillen and H. J. Siegel, "Evaluation of cube and data manipulator networks,"J. Parallel Distributed Comput., vol. 2, pp. 79-107, Feb. 1985.
[22] M. A. Nichols, H. J. Siegel, and H. G. Dietz, "Data management and control-flow constructs in a SIMD/SPMD parallel language/compiler," inProc. 3rd Symp. Frontiers Massively Parallel Computation, Oct. 1990, pp. 397-406.
[23] M. A. Nichols, H. J. Siegel, and H. G. Dietz, "Data management and control-flow aspects of an SIMD/SPMD parallel language,"IEEE Trans. Parallel Distributed Syst., to be published.
[24] S. F. Nugent, "The iPSC/2 Direct-Connect communications technology," inProc. Third Conf. Hypercube Comput. Appl., Pasadena, CA, Jan. 1988, pp. 56-60.
[25] G. J. Nutt, "Multiprocessor implementation of a parallel processor," inProc. Fourth Annu. Symp. Comput. Architecture, 1977, pp. 147-152.
[26] D. S. Parker and C. S. Raghavendra, "The gamma network,"IEEE Trans. Comput., vol. C-33, pp. 367-373, Apr. 1984.
[27] M. C. Pease III, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[28] 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," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 764-771.
[29] M. D. Rice, S. B. Seidman, and P. Y. Wang, "A formal model for SIMD computation," inProc. 2nd Symp. Frontiers Massively Parallel Computation, Oct. 1988, pp. 601-607.
[30] H. J. Siegel, "Analysis techniques for SIMD machine interconnection networks and the effects of processor address masks,"IEEE Trans. Comput., vol. C-26, pp. 153-161, Feb. 1977.
[31] H. J. Siegel, "The theory underlying the partitioning of permutation networks,"IEEE Trans. Comput., vol. C-29, pp. 791-801, Sept. 1980.
[32] H. J. Siegel,Interconnectron Networks for Large-Scale Parallel Processing: Theory and Case Studies, second ed. New York: McGraw-Hill, 1990.
[33] H. J. Siegel, W. G. Nation, C. P. Kruskal, and L. M. Napolitano, "Using the multistage cube topology in parallel supercomputers,"Proc. IEEE, vol. 77, pp. 1932-1953, 1989.
[34] H. J. Siegel, L. J. Siegel, F. C. Kemmerer, P. T. Mueller, Jr., H. E. Smalley, Jr., and S. D. Smith, "PASM: A partitionable SIMD/MIMD system for image processing and pattern recognition,"IEEE Trans. Comput., vol. C-30, pp. 934-947, Dec. 1981.
[35] 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.
[36] D. F. Stanat and D. F. McAllister,Discrete Mathematics in Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1977.
[37] S. Thanawastien and V. P. Nelson, "Interference analysis of shuffle/exchange networks,"IEEE Trans. Comput., vol. C-30, pp. 545-556, Aug. 1981.
[38] L. W. Tucker and G. G. Robertson, "Architecture and applications of the Connection Machine,"IEEE Comput. Mag., vol. 21, pp. 26-38, Aug. 1988.
[39] C.-L. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.

Index Terms:
Index Termspartitionable SIMD/SPMD machines; compilation process; perfect memory maps;large-scale parallel machines; user-controlled partitionable single-instruction-multipledata/single-program-multiple data; memory fragmentation; memory map size; singleprogram nature; parallelism; partitionable interconnection networks; multiprocessorinterconnection networks; parallel machines; parallel programming; program compilers;storage management
Citation:
M.A. Nichols, H.J. Siegel, H.G. Dietz, R.W. Quong, W.G. Nation, "Eliminating Memory for Fragmentation Within Partitionable SIMD/SPMD Machines," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 3, pp. 290-303, July 1991, doi:10.1109/71.86105
Usage of this product signifies your acceptance of the Terms of Use.