Skip to main content
SpringerLink
Log in
Book cover

VLSI Engineering pp 228–255Cite as

Top-down VLSI design experiments on a picture database computer

  • Chapter 5 Application Oriented VLSI
  • Chapter
  • First Online:

  • 142 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 163))

Abstract

In this paper, the VLSI implementation of a large system is investigated. Even in the case of VLSI implementation, many chips are required in a large system such as a database system. The interconnection architecture among a large number of VLSI chips and the chip architecture have to be designed to support the logical specification of the system. A sample logical design of such a system is based on our logic PICCOLO (PICture COmputer LOgic) for a picture database computer. If the modularity of our architecture design is good, the interconnection architecture of chips can be decided practically independently of the internal architecture of the chips. In order to support the design, we present a graph based interconnection description diagram and a PASCAL-like programming language. The diagram and language are used to support an extended relational calculus adopted by PICCOLO for describing data operations. An algorithm to decompose the extended relational calculus into the interconnection diagram and the PASCAL-like programming language is also shown. By this decomposition, the performance of the system can be estimated roughly based on an assumption about the properties of the interconnection and the chip before an internal architecture decision.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. M. Ahmed, J. M. Demosme, and M. Morf, “Highly Concurrent Computing Structures for Matrix Arithmetic and Signal Processing,” IEEE Computer, Jan., 1982, pp. 66–82.

    Google Scholar 

  2. N. Alexandridis, and A. Klinger, “Picture Decomposition Tree Data-structures, and Identifying Directional Symmetries as Node Combinations,” Computer Graphics and Image Processing, 8, 1978, pp. 43–77.

    Google Scholar 

  3. M. Andrew, “Principle of Firmware Engineering in Microprogramming Control,” Computer Science Press, 1980.

    Google Scholar 

  4. R. Bayer, and E. M. McCreight, “Organization and Maintenance of Large Ordered Indexes,” Acta Informatica, 1, 1972, pp. 173–189.

    Google Scholar 

  5. E. Carlson and P. Manty, Tech. Reports from IBM San Jose Research Laboratory.

    Google Scholar 

  6. S. K. Chang, J. Reuss, and B. H. McCormick, “An Integrated Relational Database System for Pictures,” Proc. IEEE Workshop on Picture Data Description and Management (PDDM), IEEE Computer Society, 1977, pp. 49–60.

    Google Scholar 

  7. E. F. Codd, “A Relational Model of Data for Large Shared Data Banks,” Comm. ACM 13, 1970, pp. 377–387.

    Google Scholar 

  8. E. F. Codd, “Relational Completeness of Data Base Sublanguages,” in Data Base Systems, ed. R. Rustin, 1972, Prentice-Hall, pp. 65–98.

    Google Scholar 

  9. N. S. Chang and K. S. Fu, “Query-by-Pictorial-Example,” Proc. COMPSAC 79, Chicago, November, 1979, pp. 325–330.

    Google Scholar 

  10. A. Guzman, “A Heterarchical Multi-Microprocessor Lisp Machine,” Proc. of IEEE Workshop on Computer Architecture for Pattern Analysis and Image Data Management (CAPAIDM), Hot Spring, Virginia, 1981, pp. 309–317.

    Google Scholar 

  11. P. B. Hansen, “Concurrent PASCAL,” IEEE Trans. Software Eng., SE-1, 1975, pp. 199–207.

    Google Scholar 

  12. L. S. Haynes, R. L. Siewiorek, D. P. Siewiorek, and D. W. Mizell, “A Survey of Highly Parallel Computing,” IEEE computer, Jan., 1982, pp. 9–24.

    Google Scholar 

  13. J. E. Hopcroft, and J. D. Ullman, “Introduction to Automata Theory, Language, and Computations,” Addison-Wesley, 1979.

    Google Scholar 

  14. K. Jensen, and N. Wirth, “PASCAL User Manual and Report,” second edition, Spring-Verlag, 1975.

    Google Scholar 

  15. K. Kanasaki, K. Yamaguchi, and T. L. Kunii, “A Software Development System Supported by a Database of Structures and Operations“, COMPSAC 82, Nov., 1982, pp. 343–350.

    Google Scholar 

  16. J. T. Kenneth, and A. F. Havey, “Tutorial: Local Computer Networks,” second edition, IEEE computer society press, 1981.

    Google Scholar 

  17. J. B. Kruscal, “On the shortest Spanning Subtree of a Graph and the Travelling Salesman Problem,” Proc. Amer. Math. Soc., 7, 1956, pp. 48–50.

    Google Scholar 

  18. T. L. Kunii, T. Amano, H. Arisawa, and S. Okada, “An Interactive Fashion Design System INFADS,” Proc. of Conference on Computer Graphics and Interactive Techniques, 1974.

    Google Scholar 

  19. T. L. Kunii, S. Weyl, and J. M. Tenenbaum, “A Relational Data Base Schema for Describing Complex Picture with Color and Texture,” Proc. of Second International Joint Conference on Pattern Recognition, IEEE Computer Society, Aug., 1975, pp. 310–316; reprinted in Policy Anal. Info. 1, No.2, 1978, pp. 127–142.

    Google Scholar 

  20. N. Ohbo, K. Shimizu, and T. L. Kunii, “A Graph-theoretical approach to region detection,” Proc. IEEE Computer Society's Third International Computer Software & Applications Conference, Chicago, Nov., 1979, pp. 751–756.

    Google Scholar 

  21. D. A. Patterson, E. S. Fehr, and A. H. Sequin, “Design Consideration for the VLSI processor of X-Tree,” Proc. Ann. Symp. Computer Architecture, 1979, pp. 90–100.

    Google Scholar 

  22. C. V. Ramamoorthy, and H. H. So, “Software Requirements and Specifications: Status and Perspective,” Appendix A to Requirements Engineering Research Recommendations, Aug., 1977.

    Google Scholar 

  23. C. V. Ramamoorthy, and Y. W. Ma, “Impact of VLSI on Computer Architecture,” VLSI Electronics 3 ed. by Norman G. Einspruch, Academic press, 1982, pp. 1–23.

    Google Scholar 

  24. C. Rieger, et al., “ZMOB: A Highly Parallel Multiprocessor,” Proc. of Picture Data Description and Management (PDDM), Aug., 1980, pp. 298–304.

    Google Scholar 

  25. R. P. Roesser, “Two-Dimensional Microprocessor Pipelines for Image Processing,” IEEE Transactions on Computers, Vol. C-27, No. 2, Feb., 1978, pp. 144–156.

    Google Scholar 

  26. H. J. Siegel et al., “An SIMD/MIMD Multiprocessor System for Image Processing and Pattern Recognition,” Proc. of 1979 Conference on Pattern Recognition and Image Processing, Aug., 1979, pp. 214–220.

    Google Scholar 

  27. K. Yamaguchi, N. Ohbo, T. L. Kunii, H. Kitagawa, and M. Harada, “ELF: Extended relational model for Large, Flexible picture databases,” Proc. IEEE Workshop on Picture Data Description and Management (PDDM), Asilmar, California, Aug., 1980, pp. 95–100.

    Google Scholar 

  28. K. Yamaguchi and T. L. Kunii, “Logical Framework of a Picture Database Computer,” Proc. of IEEE Workshop on Computer Architecture for Pattern Analysis and Image Data Management (CAPAIDM), Hot Spring, Virginia, Nov., 1981, pp. 284–292.

    Google Scholar 

  29. M. M. Zloof, “Query by Example,” Proc. AFIPS, NCC, Vol. 44, 1975, pp. 431–438.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Faculty of Science, The University of Tokyo, Hongo, 113, Tokyo, JAPAN

    Kazunori Yamaguchi & Tosiyasu L. Kunii

Authors
  1. Kazunori Yamaguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tosiyasu L. Kunii
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tosiyasu L. Kunii

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Yamaguchi, K., Kunii, T.L. (1984). Top-down VLSI design experiments on a picture database computer. In: Kunii, T.L. (eds) VLSI Engineering. Lecture Notes in Computer Science, vol 163. Springer, Tokyo. https://doi.org/10.1007/BFb0043457

Download citation

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

  • Published:

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-70002-9

  • Online ISBN: 978-4-431-36817-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation