Skip to main content
SpringerLink
Log in

Synthesis of application-specific multiprocessor systems including memory components

  • Published:
Journal of VLSI signal processing systems for signal, image and video technology Aims and scope Submit manuscript

Abstract

Heterogeneous systems have the potential to achieve enhanced performance as well as cost-effectiveness over homogeneous systems when the application domain is known since they can match the problem structure more closely. A formal design method, SOS, has been developed which can be used to synthesize optimal heterogeneous systems for given applications. The method involves creation of a Mixed Integer-Linear Programming (MILP) model and solution of the model. In this paper, first we show how to apply the method to application-specific systems with bus-style interconnection between the processors. We further demonstrate how to extend the method to deal with memory costs explicitly. Several experiments were performed with the original as well as the extended MILP models. These results indicate that it is important to include memory costs explicitly at design time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. “CAD for system design: Is it practical?”SIGDA Newsletter, vol. 19, pp. 40–49, September 1989.

  2. E.A. Lee and J.C. Bier, “Architectures for Statically Scheduled Dataflow,”Journal of Parallel and Distributed Computing, vol. 10 pp. 333–348, 1990.

    Article  Google Scholar 

  3. H.J. Siegel, T. Schwederski, J.T. Kuehn, and N.J. Davis, IV, “An overview of the PASM parallel processing system,” D.D. Gajski, V.M. Milutinovic, H.J. Siegel and B.P. Furht, editors,Computer Architecture, pp. 387–407. IEEE Computer Society Press, Washington, D.C., 1987.

    Google Scholar 

  4. R. Freund and D. Conwell, “Superconcurrency: A Form of Distributed Heterogeneous Supercomputing,”Supercomputing Review, October 1990.

  5. G. Amdahl, “The Validity of the Single-Processor Approach to Achieving Large-Scale Computing Capabilities,”AFIPS Conference Proceedings, pp. 483–485, 1967.

  6. S. Prakash and A.C. Parker, “Synthesis of Application-Specific Multiprocessor Architectures,”Proceedings 28th Design Automation Conference, pp. 8–13. ACM/IEEE, June 1991.

  7. S. Prakash and A.C. Parker, “A Design Method for Optimal Synthesis of Application-Specific Heterogeneous Multiprocessor Systems,”Proceedings IPPS '92—Workshop on Heterogeneous Processing. ACM/IEEE, March 1992.

  8. S. Prakash and A.C. Parker, “SOS: Synthesis of Application-Specific Heterogeneous Multiprocessor Systems,”Journal of Parallel and Distributed Computing, vol. 16, pp. 338–351, 1992.

    Article  MATH  Google Scholar 

  9. S. Prakash,Synthesis of Application-Specific Multiprocessor Systems, Ph.D. Thesis, Dept. of Electrical Engineering, University of Southern California, Los Angeles, CA, January 1993.

    Google Scholar 

  10. E.B. Fernandez and B. Bussell, “Bounds on the number of processors and time for multiprocessor optimal schedules,”IEEE Transactions on Computers, vol. C-22, pp. 745–751, 1973.

    Article  MathSciNet  Google Scholar 

  11. T.L. Adam, K.M. Chandy, and J.R. Dickson, “A comparison of list schedules for parallel processing systems,”Communications of the ACM, vol. 17, pp. 685–690, 1974.

    Article  MATH  Google Scholar 

  12. H. Kasahara and S. Narita, “Practical multiprocessor scheduling algorithms for efficient parallel processing,”IEEE Transactions on Computers, vol. C-33, pp. 1023–1029, 1984.

    Article  Google Scholar 

  13. Jing-Jang Hwang, Yuan-Chieh Chow, Frank D. Anger, and Chung-Yee Lee, “Scheduling precedence graphs in systems with interprocessor communication times,”SIAM J. Comput., vol. 18, pp. 244–257, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  14. H. El-Rewini and T.G. Lewis, “Scheduling parallel program tasks onto arbitrary target machines,”Journal of Parallel and Distributed Computing, vol. 9 pp. 138–153, 1990.

    Article  Google Scholar 

  15. M.A. Al-Mouhamed, “Lower bound on the number of processors and time for scheduling precedence graphs with communication costs,”IEEE Transactions on Software Engineering, vol. 16, pp. 1390–1401, 1990.

    Article  MathSciNet  Google Scholar 

  16. H.S. Stone, “Multiprocessor scheduling with the aid of network flow algorithms,”IEEE Transactions on Software Engineering, vol. SE-3, pp. 85–93, 1977.

    Article  Google Scholar 

  17. S.H. Bokhari, “A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,”IEEE Transactions on Software Engineering, vol. SE-7, pp. 583–589, 1981.

    Article  Google Scholar 

  18. S.H. Bokhari, “Partitioning problems in parallel, pipe-lined, and distributed computing,”IEEE Transactions on Computers, vol. 37, pp. 48–57, 1988.

    Article  MathSciNet  Google Scholar 

  19. Chien-Chung Shen and Wen-Hsiang Tsai, “A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion,”IEEE Transactions on Computers, vol. C-34, pp. 197–203, 1985.

    Article  Google Scholar 

  20. B. Indurkhya, H. S. Stone and L. Xi-Cheng, “Optimal partitioning of randomly generated distributed programs,”IEEE Transactions on Software Engineering, vol. SE-12, pp. 483–495, 1986.

    Article  Google Scholar 

  21. W.W. Chu and L.M.-T. Lan, “Task allocation and precedence relations for distributed real-time systems,”IEEE Transactions on Computers, vol. C-36, pp. 667–679, 1987.

    Article  Google Scholar 

  22. C.E. Houstis, “Module allocation of real-time applications to distributed systems,”IEEE Transactions on Software Engineering, vol. 16, pp. 699–709, 1990.

    Article  Google Scholar 

  23. W.W. Chu, L.J. Hollaway, M.-T. Lan, and K. Efe, “Task allocation in distributed data processing,”Computer, vol. 13, pp. 57–69, Nov. 1980.

    Article  Google Scholar 

  24. E.K. Haddad, “Partitioned load allocation for minimum parallel processing time,”Proceedings 1989 International Conference on Parallel Processing. IEEE Computer Society, Aug. 1989.

  25. R. Mehrotra and S.N. Talukdar, “Task scheduling on multiprocessors,” Tech. Rep. DRC-18-55-82, Department of Electrical Engineering, Carnegie-Mellon University, Pittsburgh, PA, Dec. 1982.

    Google Scholar 

  26. L.J. Hafer and A.C. Parker, “A formal method for the specification, analysis, and design of register-transfer level digital logic,”IEEE Transactions on Computer-Aided Design, vol. CAD-2, pp. 4–17, 1983.

    Article  Google Scholar 

  27. J.A.B. Fortes and D.I. Moldovan, “Parallelism detection and transformation techniques useful for VLSI algorithms,”Journal of Parallel and Distributed Computing, vol. 2, pp. 277–301, 1985.

    Article  Google Scholar 

  28. L.J. Hafer and E. Hutchings, “Bringing up Bozo,” Tech. Rep. CMPT TR 90-2, School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Mar. 1990.

    Google Scholar 

  29. R. Jain, K. Kuçükçakar, M. Mlinar, and A. Parker, “Experience with the ADAM Synthesis System,”Proceedings 26th Design Automation Conference, pp. 56–61. ACM/IEEE, June 1989.

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering-Systems, University of Southern California, 90089-2562, Los Angeles, CA

    Shiv Prakash & Alice C. Parker

Authors
  1. Shiv Prakash
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alice C. Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prakash, S., Parker, A.C. Synthesis of application-specific multiprocessor systems including memory components. Journal of VLSI Signal Processing 8, 97–116 (1994). https://doi.org/10.1007/BF02109379

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02109379

Keywords

Search

Navigation