Skip to main content

Unified System Construction (USC)

  • Chapter
High-Level VLSI Synthesis

Abstract

When high-level synthesis research began, there were no VLSI chips. Design was assumed to be done with a fixed set of available modules [1]. In at least one case, these modules were assumed to be TTL chips [16]. Such chips and modules had a fixed cost, and wiring delays between chips were minimal compared to the processing delays on chip. Power consumption could easily be computed as the sum of the power consumptions of individual chips, and hot chips could be cooled with a heatsink. Partitioning onto multiple boards was performed manually, or at least handled separately from the high-level synthesis process. General-purpose multiprocessors were constructed only in research laboratories and special-purpose multiprocessors were expensive and constructed for only a few applications. Now, however, we are faced with a situation where high-level synthesis programs must design datapaths and controllers to fit on one or more VLSI chips and boards. For VLSI chips, a large portion of the chip area is consumed by wiring and wire delays can be significant. Partitioning must be performed to map problems onto multiple chips. There may be multiple processing elements, each with its own controller. Many problems are best implemented with multiprocessor architectures. Given this situation, high-level synthesis programs must take a number of factors into account that were by and large ignored in the early days of synthesis research.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Barbacci and D. Siewiorek. The cmu rt-cad system: An innovative approach to computer aided design. InAmerican Federation of Information Processing Societies Conference Proceedings Vol. 45, pages 643–655. Amer. Fed. of Information Processing Societies, June 1976.

    Google Scholar 

  2. J. Bhasker and S. Sahni. A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph. InProc. of 23th Design Automation ConferenceJune 1986.

    Google Scholar 

  3. W. C. Brantley.Automatically Decomposing Signal Processing Applications on Multiprocessors.PhD thesis, Carnegie-Mellon University, 1979.

    Google Scholar 

  4. F. D. Brewer and D. D. Gajski. A System for Constraint Driven Behavioral Synthesis.IEEE Transactions on Computer-Aided DesignCAD-9(7), July 1990.

    Google Scholar 

  5. M. Burstein and M. Youssef. Timing Influenced Layout Design. InProc. of 22nd Design Automation ConferenceJune 1985.

    Google Scholar 

  6. W. Chu, L. Hollaway, M. Lan, and K. Efe. Task Allocation in Distributed Data Processing.Computer13(11):57–69November1980.

    Article  Google Scholar 

  7. E. Dirkes. Architectural Partitioning for System Level Design. InProceedings 26th Design Automation Conference.ACM/IEEE, June 1989.

    Google Scholar 

  8. G. Estrin. A methodology for design of digital systems - supported by SARA at the age of one. In Proceedings of National Computer Conferencevolume 47, pages 313–324. NCC, 1978.

    Google Scholar 

  9. A. Dunlop et. al. Chip Layout Optimization Using Critical Path Weighting. InProc. of 21th Design Automation ConferenceJune 1984.

    Google Scholar 

  10. W. Donath et. al: Timing Driven Placement Using Complete Path Delays. InProc. of 27th Design Automation ConferenceJune 1990.

    Google Scholar 

  11. E. Girczyc.Automatic Generation of Microsequenced Data Paths to Realize ADA Circuit Descriptions. PhD thesis, Department of Electronics, Carleton University, July 1984.

    Google Scholar 

  12. J.J. Granacki and A.C. Parker. The effect of register-transfer design tradeoffs on chip area and performances. InProceedings of the 20th Design Automation ConferenceJune 1982.

    Google Scholar 

  13. Pravil Gupta. PLA and Wire Delay Analysis. Internal Report, in progress.

    Google Scholar 

  14. Rajesh Gupta and Giovanni De Micheli.Partitioning of Functional Models of Synchronous Digital Systems.InProceedings International Conference on Computer Aided Design.ACM/IEEE, November 1990.

    Google Scholar 

  15. E. K. Haddad. Optimal Load Allocation for Parallel and Distributed Processing. Technical Report TR 89–12, Department of Computer Science, Virginia Polytenic Institute and State University, April 1989.

    Google Scholar 

  16. L. Hafer and A. Parker.Automated synthesis of digital hardware.IEEE Transactions on Computers C-31(2):93–109, February 1981.

    Article  Google Scholar 

  17. L. Hafer and A. Parker.A Formal Method for the Specification, Analysis, and Design of Register-Transfer Level Digital Logic.IEEE Transactions on Computer-Aided DesignCAD-2(1), January 1983.

    Google Scholar 

  18. L. J. Hafer. Bringing up Bozo. Technical report, Department of Computing Science, Simon Fraser University, May 1990.

    Google Scholar 

  19. B. S. Haroun and M. I. Elmasry. Architectural synthesis for DSP silicon compilers. IEEE Trans. CAD., 8(4), April 1989.

    Google Scholar 

  20. S. Hayati.The Synthesis of Control-Dominated Application-Specific Integrated Circuits Using Goal-Based Design Management.PhD thesis, Department of Electrical Engineering, University of Southern California, December 1990.

    Google Scholar 

  21. C. E. Houstis. Module Allocation of Real-Time Applications to Distributed Systems.IEEE Transactions on Software Engineering16(7):699–709, July 1990.

    Article  Google Scholar 

  22. C. Hwang, Y. Hsu, and Y. Lin. Optimum and Heuristic Data Path Scheduling Under Resource Constraints. InProceedings 27th Design Automation Conferencepages 65–70. ACM/IEEE, June 1990.

    Google Scholar 

  23. T. Barnwell III and D. Schwarz. Optimal implementation of flow graphs on synchronous multiprocessors. InInt. Conf. on ASSP 8.41984.

    Google Scholar 

  24. B. Indurkhya, H. S. Stone, and L. Xi-Cheng. Optimal Partitioning of Randomly Generated Distributed Programs.IEEE Transactions on Software Engineering SE-12(3):483–495, March 1986.

    Article  Google Scholar 

  25. R. Jain, K. Kucukcakar, M. J. Mlinar, and A. C. Parker. Experience with the ADAM Synthesis System. InProceedings 26th Design Automation Conference.ACM/IEEE, June 1989.

    Google Scholar 

  26. R. Jain, M. J. Mlinar, and A. C. Parker. Area-Time Model for Synthesis of Non-Pipelined Designs. InProceedings International Conference on Computer Aided Design.ACM/IEEE, November 1988.

    Google Scholar 

  27. R. Jain, A. C. Parker, and N. Park. Predicting Area-Time Tradeoffs for Pipelined Designs. InProceedings 24th Design Automation Conference.ACM/IEEE, June 1987.

    Google Scholar 

  28. B. W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs.Bell System Technical Journal49(1), January 1970.

    Google Scholar 

  29. D. Knapp. Feedback-Driven Datapath Optimization in Fasolt. InProc. of the ICCAD-90 ConferenceNovember 1990.

    Google Scholar 

  30. K. Kucukcakar and A. C. Parker. BAD: Behavioral Area-Delay Predictor. Technical Report CENG-90–31, Department of Electrical Engineering, University of Southern California, November 1990.

    Google Scholar 

  31. K. Kucukcakar and A. C. Parker. CHOP: A Constraint-Driven System-Level Partitioner. Technical Report CENG-90–26, Department of Electrical Engineering, University of Southern California, November 1990.

    Google Scholar 

  32. F. J. Kurdahi and A. C. Parker. PLEST: A Program for Area Estimation of VLSI Integrated Circuits. InProceedings 23rd Design Automation Conference.ACM/IEEE, June 1986.

    Google Scholar 

  33. Y. Lai and S. Leinwand. Algorithms for Floorplan Design Via Rectangular Dualization.IEEE Trans. on Computer-Aided DesignDec 1988.

    Google Scholar 

  34. Richard I. Levin and Charles A. Kirkpatrick.Planning and Control with PERT/CPM.McGraw Hill, 1966.

    Google Scholar 

  35. A. Parker M. McFarland and R. Camposano.Tutorial on High-Level Synthesis. InProc. of the 25th Design Automation ConferenceJuly 1988.

    Google Scholar 

  36. M. C. McFarland. Using Bottom-Up Design Techniques in the Synthesis of Digital Hardware from Abstract Behavioral Descriptions. In Proceedings 23rd Design Automation Conference.ACM/IEEE, June 1986.

    Google Scholar 

  37. R. Mehrotra and S. Talukdar. Task Scheduling on Multiprocessors. Technical Report DRC-18–55–82, Department of Electrical Engineering, Carnegie-Mellon University, December 1982.

    Google Scholar 

  38. Mitch J. Mlinar.System Level Tradeoffs in VLSI Design.PhD thesis, Department of Electrical Engineering, University of Southern California, 1991. In progress.

    Google Scholar 

  39. R. Nair and et. al. Generation of Performance Constraints for Layout.IEEE Trans. on Computer-Aided DesignAugust 1989.

    Google Scholar 

  40. N. Park and A. Parker. Sehwa: A Software Package for Synthesis of Pipelines from Behavioral Specifications. IEEE Trans. on Computer-Aided Design Mar 1988.

    Google Scholar 

  41. A. Parker, J. Pizarro, and M. Mlinar. MAHA: A Program for Datapath Synthesis. In Proc. of the 23th Design Automation ConferenceJuly 1986.

    Google Scholar 

  42. P. Paulin and J. Knight. Algorithms for High-Level Synthesis. IEEE Design & Test of ComputersDec 1989.

    Google Scholar 

  43. Thomas S. Payne and W. M. vanCleemput. Automated Partitioning of Hierarchically Specified Digital Systems. In Proceedings 19th Design Automation Conference.ACM/IEEE, June 1982.

    Google Scholar 

  44. S. Prakash and A. C. Parker. Synthesis of Application-Specific Multiprocessor Architectures. Technical Report 90–25, Department of Electrical Engineering, University of Southern California, November 1990.

    Google Scholar 

  45. Jan Rabaey and Hugo De Man. Computer aided design of digital signal processing systems. In Proc. ICCD 1987.

    Google Scholar 

  46. Martin L. Resnick. SPARTA: A System Partitioning Aid. IEEE Transactions on Computer-Aided Design CAD-5(4) October 1986.

    Google Scholar 

  47. Brian Schmult. Partitioning Strategies for Multi-chip VLSI Microprocessors. Technical Report CMUCAD-84–26, Department of Electrical and Computer Engineering, Carnegie-Mellon University, February 1984.

    Google Scholar 

  48. H. S. Stone. Critical Load Factors in Two-processor Distributed Systems. IEEE Transactions on Software Engineering SE-4:254–258, May 1978.

    Google Scholar 

  49. P. Suaris and G. Kedem. A Quadrisection-Based Combined Place and Route Scheme for Standard Cells. IEEE Trans. on Computer-Aided Design Mar 1989.

    Google Scholar 

  50. T. Wang and D. Wong. An Optimal Algorithm for Floorplan Area Optimization. Proc. of 27th Design Automation Conference June 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Parker, A.C., Küçükçakar, K., Prakash, S., Weng, JP. (1991). Unified System Construction (USC). In: Camposano, R., Wolf, W. (eds) High-Level VLSI Synthesis. The Springer International Series in Engineering and Computer Science, vol 136. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3966-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3966-7_14

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6771-0

  • Online ISBN: 978-1-4615-3966-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics