Abstract
A program development tool that automatically performs scheduling and synchronization insertion for hypercube systems is presented in this paper. We use a programming methodology in which a program is written as a set of procedures called from the main program. This program is converted into a macro dataflow graph which is used by the tool to generate executable code for hypercube machines. The program restructured by our tool outperformed the manually developed code, while increasing the program development productivity at the same time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adam, T. L., Chandy, K. M., and Dickson, J. R. 1974. A comparison of list scheduling for parallel processing systems. Comm. ACM, 17 (12): 685–690.
Allan, R., Baumgartner, D., Kennedy, K., and Porterfield, A. 1986. PTOOL: A semi-automatic parallel programming assistant. Proc. 1986 Internat. Conf. on Parallel Processing, pp. 164–170.
Ametek Computer Research Division. 1986. Ametek System 14 User's Guide: C Edition. Arcadia, Calif.
Appelbe, W. F., and McDowell, C. 1985. Anomaly detection in parallel Fortran programs. Proc. Workshop on Parallel Processing Using the HEP.
Bianchini, R. P., and Shen, J. P. 1987. Interprocessor traffic scheduling algorithm for multiple-processor networks. IEEE Trans. Computers, C-36 (4): 396–409.
Bussell, B., Fernandez, E., and Levy, O. 1974. Optimal scheduling for homogeneous multiprocessors. Proc. IFIP Congress 74, North-Holland, Amsterdam; American Elsevier, New York, pp. 286–290.
Colley S., and Palmer, J. 1986. Architecture of a hypercube supercomputer. Proc. Internat. Conf. on Parallel Processing, pp.653–660.
Fujimoto, R. MP. 1983. SIMON: A simulator of multicomputer networks. Report No. UCB/USD 83/140, University of California, Berkeley.
Gajski, D. D., and Peir, J. K. 1985. The essential issues in multiprocessor systems. IEEE Computer, 18(6): 9–27.
Gustafson, H. L., Hawkinson, S., and Scott, K. 1986. The architecture of a homeogeneous vector supercomputer. Proc. Internat. Conf. on Parallel Processing, pp. 649–652.
Hanan, M., and Kurtzberg, J. M. 1972. A review of the placement and quadratic assignment problems. SIAM Rev., 14: 324–342.
Hayes, J. P., Mudge, T., Stout, Q. F., Colley, S., et al. 1986. A microprocessor-based hypercube supercomputer. IEEE Micro, 6(5): 6–17.
Helminen, B. K., and Poplawski, D. A. 1987. A performance characterization of the FPS T-series hypercube. Computer Science Technical Report CS-TR87–6, Michigan Technological University, Houghton, Mich.
Hu, T. C. 1961. Parallel sequencing and assembly line problems. Operations Research, 9(6): 841–848.
Kohler, W. H. 1975. A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems. IEEE Trans. Computers, C-24: 1235–1238.
Kruatrachue, B., and Lewis, T. 1988. Grain size determination for parallel processing. IEEE Software, Jan.: 23–32.
Landskov, D., Davidson, S., Shriver, B., and Mallett, P. W. 1980. Local microcode compaction techniques. Computing Surveys, 12(3): 261–294.
Lee, S. Y., and Aggarwal, J. K. 1987. A mapping strategy for parallel processing. IEEE Trans. Computers, C-36 (4): 433–442.
Padua, D. A., Kuck, D. J., and Lawrie, D. L. 1980. High speed multiprocessor and compilation techniques. IEEE Trans. Computers, Vol. C-29(9): 763–776.
Peir, J. K., and Gajski, D. D. 1986. CAMP: A programming aide for multiprocessors. Proc. Internat. Conf. on Parallel Processing, pp. 475–482.
Peir, J. K., Gajski, D. D., and Wu, M. Y. 1987. Programming environments for multiprocessors. Proceeding of International Seminar on Scientific Supercomputers, pp.47–68.
Peterson, J. C., Tuazon, J. O., Lieberman, D., and Pniel, M. 1985. The Mark III Hypercube Ensemble Concurrent Computer. Proc. Internat. Conf. on Parallel Processing, pp. 71–73.
Ramamoorthy, C. V., Chandy, K. M., and Gonzales, M. J. 1972. Optimal scheduling strategies in a multiprocessor system. IEEE Trans. Computers, C-21: 137–146.
Rattner, J. 1985. Concurrent processing: A new direction in scientific computing. Proc. National Computer Conf., vol. 54, pp. 157–166.
Seitz, C. L. 1985. The COSMIC cube. Communications of the ACM, 28: 22–33.
Sethi, R. 1976. Algorithms for minimal-length schedules. In Computer and Job-Shop Scheduling Theory, Wiley, New York, Chapter 2.
Tuazon, J., Peterson, J., Pniel, M., and Liberman, D. 1985. Caltech/JPL Mark II Hypercube Concurrent Processor. Proc. Internat. Conf. on Parallel Processing, pp.666–673.
Wu, M. Y., and Gajski, D. D. 1987. A programming aid for message-passing systems. Proc. Third SIAM Conf. on Parallel Processing for Scientific Computing.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, MY., Gajski, D.D. A programming aid for hypercube architectures. J Supercomput 2, 349–372 (1988). https://doi.org/10.1007/BF00129784
Issue Date:
DOI: https://doi.org/10.1007/BF00129784