Skip to main content
SpringerLink
Log in

A’UM —A stream-based concurrent object-oriented language—

  • Special Issue
  • Parallel/Concurrent Languages
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper presents a computation model and its programming language,A’UM,* as a result of our pursuit of high parallelism and high expressivity for the development of a large scale software. By basing it on streams and integrating it with objects and relations,A’UM realizes an elegant model, natural representation and efficient execution, all at once, that have never been done by any other approaches.

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. Ashcroft, E. A. and Wadge, W. W., “Lucid, a Non-procedural Language with Iteration,”CACM,20(7), 1977.

  2. Aczel, P., “Non-well-founded Sets”,CSLI Lecture Notes, 14, Stanford University, 1988.

  3. Agha, G. A.,A Model of Concurrent Computation in Distributed Systems, MIT Press, 1986.

  4. America, P., “Definitions of the programming language POOL-T”,ESPRIT project 415, Doc. 91, Philips Research Laboratories, Eindhoven, the Netherlands, 1985.

    Google Scholar 

  5. Arvind and Gostelow, K. P., “A Computer Capable of Exchanging Processors for Time”,Proc. IFIP 77, 1977.

  6. Arvind and Brock, J. D., “Streams and Managers”,LNCS, 143, Springer-Verlag, pp. 452–465, 1982.

  7. Arvind and Culler, D. E., “Dataflow Architecture”,Ann. Rev. Computer Science, 1, 225–53, 1986.

    Article  Google Scholar 

  8. Bellot, P. and Robinet, B., “Streams are not Dreams”,LNCS, 242, Springer-Verlag, 1985.

  9. de Bakker, J. W., Meyer, J. J. Ch. and Orderog, E. R., “Infinite Streams and Finite Observations in The Semantics of Uniform Concurrency”,Theoretical Computer Science, 49, North-Holland, 1987.

  10. Bergstra, J. A. and Klop, J. W., “Process Algebra for Synchronous Communication”,Information and Control, 60, 1984.

  11. Brock, J. D. and Ackerman, W. B., “Scenarios: A model of Non-determinate Computation”,LNCS, 107, Springer-Verlag, 1981.

  12. Broy, M., “A Theory for Nondeterminism, Parallelism, Communication, and Concurrency”,Theoretical Computer Science, 45, North-Holland, 1986.

  13. Chikayama, T. and Kimura, Y., “Multiple Reference Management in Flat GHC”,Proc. of 4th ICLP, 1987.

  14. Clark, K. and Gregory, S., “A Relational Language for Parallel Programming”,Concurrent Prolog, Vol. 1, MIT Press, 1987.

  15. Clark, K. and Gregory, S., “PARLOG: Parallel Programming in Logic”,Concurrent Prolog, Vol. 1, MIT Press, 1987.

  16. Cohen, J., “Garbage Collection of Linked Data Structures”,ACM Computing Surveys,13(3), 1981.

  17. Dennis, J. B., “Programming Generality, Parallelism and Computer Architecture”,Proc. of IFIP, 69, 1969.

  18. Dennis, J. B., “Prelininary Architecture for a Basic Data-Flow Processor”,IEEE Symp. on Comp. Arch., 1975.

  19. Dennis, J. B., “A Language Design for Structured Concurrency”,LNCS, 54, Springer-Verlag, 1976.

  20. Ehrig, H., “Introduction to the Algebraic Theory of Graph Grammars”,LNCS, 73, Springer-Verlag, 1979.

  21. Filman, R. E. and Friedman, D. P.,Coordinated Computing—Tools and Techniques for Distributed Software, McGraw-Hill, 1984.

  22. Goldberg, A. and Robson, D.,Smaltalk-80: The Language and Its Implementation, Addison-Wesley, 1983.

  23. Goto, A., Kimura, Y., Nakagawa, T. and Chikayama, T., “An Incremental Garbage Collection Method for Parallel Inference Machines”,Proc. of LP88, Seattle, 1988.

  24. Hewitt, C., “Viewing Control Structures as Patterns of Passing Messages”,Artificial Inteligence,8(3), 1977.

  25. Hewitt, C. and Baker, H., “Laws for Communicating Parallel Processes”,Proc. of IFIP Congress 77, North-Holland, pp. 987–992, 1977.

  26. Ida, T. and Tanaka, J., “Functional Programming with Streams”,Proc. IFIP 83, pp. 265–270, 1983.

    Google Scholar 

  27. Ishikawa, Y. and Tokoro, M., “A Concurrent Object-Oriented Knowledge Representation Language Orient 84/K: Its Features and Implementation”,Proc. of OOPSLA’86, 1986.

  28. Hur, J. H. and Chon, K., “Overview of a Parallel Object-Oriented Language CLIX”,LNCS, 276, Springer-Verlag, 1987.

  29. Kahn, K., Tribble, E. D., Miller, M. S. and Bobrow, D. G., “Vulcan: Logical Concurrent Objects”,Concurrent Prolog, Vol. 2, MIT Press, 1987.

  30. Kahn, G., “The Semantics of a Simple Language for Parallel Programming”,Proc. of IFIP 74, pp. 471–145, 1974.

    MathSciNet  Google Scholar 

  31. Kahn, G. and MacQueen, D., “Coroutines and Networks of Parallel Processes”,Proc. IFIP 77, pp. 993–998, 1977.

    Google Scholar 

  32. Kaplan, S. M. and Kaiser, G. E., “Garp: Graph Abstractions for Concurrent Programming”,LNCS, 300, Springer-Verlag, 1988.

  33. Kerowski, H.-J. and Wilharm, A., “Net Processes Correspond to Derivation Processes in Graph Grammars”,Theoretical Computer Science, 44, North-Holland, 1986.

  34. Landin, P. J., “A Correspondence between Algol60 and Church’s Lambda-Notation: Part I”,Comm. ACM, 8(2), pp. 89–101, 1965.

    Article  MathSciNet  Google Scholar 

  35. McGraw, J. R., “The VAL Language: Description and Analysis”,ACM Transaction on Programming Languages and Systems,4(1), 1982.

  36. Mandrioli, D. and Ghezzi, C.,Theoretical Foundation of Computer Science, John Wiley & Sons, 1987.

  37. Milner, R., “A Calculus of Communicating Systems, “LNCS, 92, Springer-Verlag, 1980.

  38. Milner, R., “Caliculi for Synchrony and Asynchrony”,Theoretical Computer Science, 25, North-Holland, 1983.

  39. Monteiro, L. F. and Pereira, F. C. N., “A Sheaf-Theoretic Model of Concurrency”,Symp. on Logic in Computer Science, 1986.

  40. Peterson, J. L.,Petri Net Theory and the Modeling of Systems, Prentice-Hall, 1981.

  41. Pratt, V., “Modeling Concurrency with Partial Orders”,International Journal of Parallel Programming,15(1), 1986.

  42. Scott, D. S., “Continuous Lattices”,LNM, 274, Springer-Verlag, 1972.

  43. Scott, D. S., “Domains for Denotaional Semantics”,LNCS, 140, Springer-Verlag, 1982.

  44. Shapiro, E., “A Subset of Concurrent Prolog and Its Interpreter”,Concurrent Prolog, Vol. 1, MIT Press, 1987.

  45. Shapiro, E. and Takeuchi, A., “Object Oriented Programming in Concurrent Prolog”,Concurrent Prolog, Vol. 2, MIT Press, 1987.

  46. Staples, J. and Nguyen, V. L., “Computing the Behavior of Asynchronous Processes”,Theoretical Computer Science, 26, North-Holland, 1983.

  47. Tesler, L. G. and Enea, H. J., “A Language Design for Concurrent Processes”,Proc. of SJCC, 1968.

  48. Tribble, E. D., Miller, M. S., Kahn, K., Bobrow, D. and Abbott, C., “Channels: A Generalization of Streams”,Concurrent Prolog, Vol. 1, MIT Press, 1987.

  49. Ueda, K., “Guarded Horn Clauses”,Concurrent Prolog, Vol. 1, MIT Press, 1987.

  50. Winskel, G., “Synchronization Trees”, TheoreicalComputer Science, 34, North-Holland, pp. 33–82, 1984.

  51. Winkowski, J., “An Algebra of Processes”,Journal of Computer and System Sciences, 35, pp. 206–228, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  52. Yokote, Y. and Tokoro, M., “The Design and Implementation of ConcurrentSmalltalk”,Proc. of OOPSLA ’86, 1986.

  53. Yonezawa, A., Briot, J.-P. and Shibayama, E., “Object-Oriented Concurrent Programming in ABCL/1”,Proc. of OOPSLA’86, 1986.

  54. Zhong, Y. and Sowa, M., “Towards an Implicitly Parallel Object-Oriented Language”,Proc. of COMPSAC’87, 1987.

Download references

Author information

Authors and Affiliations

  1. ICOT Research Center, Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, 108, Tokyo, Japan

    Kaoru Yoshida & Takashi Chikayama

Authors
  1. Kaoru Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Chikayama
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A’UM is a Japanese word, derived from a Sanskrit “ahum” consisting ofAh andUm, which implies the beginning and the end, and open voice and a close voice, and expiration and inspiration. This name was given to symbolize stream communication which is the basic notion of this language.

About this article

Cite this article

Yoshida, K., Chikayama, T. A’UM —A stream-based concurrent object-oriented language—. NGCO 7, 127–157 (1990). https://doi.org/10.1007/BF03037203

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation