Skip to main content
SpringerLink
Log in

The realization of a data type architecture

  • New Architectures
  • Conference paper
  • First Online:
Book cover Trends in Information Processing Systems (ECI 1981)

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

Included in the following conference series:

Abstract

Abstract data types are a widely accepted means for enhancing software reliability and data security. The objection raised against abstract data type based programming languages is their run time inefficiency when executed on a conventional machine. In the paper, a data type architecture is described which offers efficient and convenient mechanisms for constructing arbitrary data structures and user-defined abstract data types, thus avoiding the inefficiency penalty mentioned above. Through a process of hierarchical decomposition, user-defined abstract data types are mapped on representations given in terms of a basic structured machine data type. This approach combines high performance with generality and completeness. The architecture is structured as a strongly coupled, asymmetric multiprocessor system and includes a pipeline for processing objects of the vector-structured machine data type. Software reliability is enhanced by consistency checks performed at run time.

This work is supported by the German Science Foundation under grant no. Gi 42/13.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backus J., Can Programming be Liberated From the von Neumann Style? A Functional Style and Its Algebra of Programs, CACM 21,8 (Aug. 1978), 613–641

    Google Scholar 

  2. Liskov B., Zilles S., Programming With Abstract Data Types, ACM SIGPLAN Notices 9,4 (Sept. 1974), 50–59

    Google Scholar 

  3. Hanson S. et al., Summary of the Characteristics of Several "Modern" Programming Languages, ACM SIGPLAN Notices 14,5 (May 1979), 28–45

    Google Scholar 

  4. Liskov B., Moss E., Schaffert C., Scheifler B., Snyder A., CLU Reference Manual, Massachusetts Institute of Technology, Laboratory for Computer Science, Computation Structures Group Memo 161 (1978)

    Google Scholar 

  5. Denning P.J., Fault-Tolerant Operating Systems, Computing Surveys 8 (1976), 359–389

    Google Scholar 

  6. Jones A.K., Liskov B., A Language Extension for Expressing Constrains on Data Access, CACM 21,5 (May 1978), 358–367

    Google Scholar 

  7. Giloi W.K., Berg H.K., Introducing the Concept of Data Structure Architectures, Proc. 1977 Internat. Conf. on Parallel Processing, IEEE Catalog No. 77CH1253-4C, 44–51

    Google Scholar 

  8. Giloi W.K., Berg H.K., Data Structure Architectures — A Major Operational Principle, Proc. 5th Annual Symp. on Computer Architecture, IEEE Catalog No. 78CH1284-9C, 175–181

    Google Scholar 

  9. Giloi W.K., The DRAMA Principle and Data Type Architectures, in J. Niedereichholz (ed.), Datenbank technologie, Teubner-Verlag, Stuttgart 1979, 81–100

    Google Scholar 

  10. Berg H.K., Giloi W.K., Hierarchical Specification of Abstract Data Types, in Berg/Giloi (ed.), The Use of Formal Specification of Software, Springer, Berlin-Heidelberg-New York 1981 (Informatik-Fachberichte Nr. 37)

    Google Scholar 

  11. Berry D.M., Ehrlich Z., Lucena C.J., Correctness of Data Representations: Pointers in High-Level Languages, ACM SIGMOD Record 8,2 (Feb. 1976), 115–119

    Google Scholar 

  12. Liskov B., Snyder A., Exception Handling in CLU, IEEE TRANS. ON SOFTWARE ENG. 5 (1979), 546–558

    Google Scholar 

  13. Moss J.E.E., Abstract Data Types in Stack Based Languages, MIT Tech. Report LCS/TR 190, Massachusetts Institute of Technology, Laboratory for Computer Science. 1978

    Google Scholar 

  14. Jensen K., Wirth N., PASCAL User Manual and Report, Springer-Verlag, Berlin-Heidelberg-New York 1974

    Google Scholar 

  15. Fischer C.N., LeBlanc R.J., The Implementation of Run-Time Diagnostics in PASCAL, IEEE TRANS. ON SOFTWARE ENG. 6,4 (July 1980), 313–319

    Google Scholar 

  16. Rattner J., Cox G., Object-Based Computer Architecture, Computer Architecture News 8,6 (Oct. 1980), 4–11

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik — CAMP, Technical University of Berlin, Germany

    W. K. Giloi & R. Gueth

Authors
  1. W. K. Giloi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Gueth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arie Duijvestijn Peter Christian Lockemann

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giloi, W.K., Gueth, R. (1981). The realization of a data type architecture. In: Duijvestijn, A., Lockemann, P.C. (eds) Trends in Information Processing Systems. ECI 1981. Lecture Notes in Computer Science, vol 123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10885-8_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-10885-8_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10885-6

  • Online ISBN: 978-3-540-38794-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation