Skip to main content
SpringerLink
Log in

The Effects of Timing Dependence and Recursion on Parallel Program Schemata

  • Conference paper
  • First Online:
High Performance Computing (ISHPC 2002)

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

Included in the following conference series:

  • 833 Accesses

Abstract

We are interested in the effects of timing dependence and recursion in the class of parallel program schemata. We compare the expression power of some classes of dataflow schemata: UDF, DF π, RDF etc. DF π includes a π-gate which introduces timing dependence, and RDF has a facility for recursion and UDF has both devices. In conclusion, we show some inclusion relations between classes, including the existence of a class standing between EF and EF d. These relations reveal the role of timing dependence and recursion.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Constable, R. L. and Gries, D., “On Classes of Program Schemata”, SIAM Journal on computing, 1, 1, pp. 66–118(1972).

    Article  MathSciNet  MATH  Google Scholar 

  2. Strong, H. R., “High Level Languages of Maximum Power”, PROC. IEEE Conf. on Switching and Automata Theory, pp. 1–4(1971).

    Google Scholar 

  3. Jaffe, J. M., “The Equivalence of r.e. Program Schemes and Data flow Schemes”, JCSS, 21, pp. 92–109(1980).

    MathSciNet  MATH  Google Scholar 

  4. Matsubara, Y. and Noguchi, S., “Expressive Power of Dataflow Schemes on Partial Interpretations”, Trans. of IECE Japan, J67-D,4, pp. 496–503 (1984).

    MathSciNet  Google Scholar 

  5. Matsubara, Y. and Noguchi, S., “Dataflow Schemata of Maximum Expressive power”, Trans. of IECE Japan, J67-D,12, pp. 1411–1418(1984).

    Google Scholar 

  6. Matsubara, Y. “Necessity of Timing Dependency in Parallel Programming Language”, HPC-ASIA 2000, The Fourth International Conference on High Performance Computing in Asia-Pacific Region. May 14–17, 2000 Bejing, China.

    Google Scholar 

  7. Matsubara, Y., “ADF(∞) is Also Equivalent to EF”, The Bulletin of The Faculty of Information and Communication, Bunkyo University. (1995).

    Google Scholar 

  8. Matsubara, Y. and Miyagawa, H. “Ability of Classes of Dataflow Schemata with Timing Dependency”, Third International Symposium, ISHPC2000, Tokyo, Japan, October 2000 Proceedings, “HighPerformance Computing”, Lecture Notes in Computer Science 1940 Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information and Communications, Bunkyo University, Namegaya, 1100, Chigasaki-shi, 253-8550, Japan

    Yasuo Matsubara & Takahiro Shakushi

Authors
  1. Yasuo Matsubara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takahiro Shakushi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Software Science, University of Vienna, Liechtensteinstr. 22, 1090, Vienna, Austria

    Hans P. Zima

  2. Department of Information and Computer Science, Nara Women’s University, Kitauoyanishimachi, Nara City, 630-8506, Japan

    Kazuki Joe

  3. Institute of Information Science and Electronics, University of Tsukuba, Tenno-dai 1-1-1, Tsukuba, Ibaraki, 305-8577, Japan

    Mitsuhisa Sato

  4. Internet Systems Research Laboratories, NEC Corporation, 4-1-1, Miyazaki, Miyamae, Kawasaki, Kanagawa, 216-8555, Japan

    Yoshiki Seo

  5. Kyoto University, Yoshidahonmachi, Sakyo-ku, Kyoto, 606-8501, Japan

    Masaaki Shimasaki

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsubara, Y., Shakushi, T. (2002). The Effects of Timing Dependence and Recursion on Parallel Program Schemata. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds) High Performance Computing. ISHPC 2002. Lecture Notes in Computer Science, vol 2327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47847-7_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-47847-7_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43674-4

  • Online ISBN: 978-3-540-47847-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation