Skip to main content

Optimal Stochastic Scaling of CAE Parallel Computations

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1424))

Included in the following conference series:

  • 743 Accesses

Abstract

The meshless strategy of CAE problem partitioning is presented. It offers significant decrement of time complexity in comparison with usual mesh decomposition algorithms, and therefore may be applied in on-line processing. The effective IE graph solid representation is applied as well as the stochastic performance forecast system for parallel MIMD computer nodes. The main scaling problem is formulated as the optimal fuzzy graph matching and it is proposed to be solved by efficient ETPL(k) parsers.

The research was supported from the ESPRIT Project 20288-13.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Belytschko, Y. Krongauz, D. Organ, M. Fleming, P. Krysl, Meshless methods: An overview and recent developments, Comp. Meth. in Applied Mech. and Eng. 139 (1996), 3ā€“47.

    Article  MATH  Google Scholar 

  2. M. FlasiƱski, Distorted pattern analysis with the help of node label controlled graph languages, Pattern Recognition 23 (1990), 765ā€“774.

    Article  Google Scholar 

  3. M. FlasiƱski, L. Kotulski, On the use of graph grammars for the control of a distributed software allocation, Comp. J. 35 (1992), A165ā€“A175.

    Google Scholar 

  4. M. FlasiƱski, On the parsing of deterministic graph languages for syntactic pattern recognition, Pattern Recognition 26 (1993), 1ā€“16.

    Article  MathSciNet  Google Scholar 

  5. M. FlasiƱski, Use of graph grammars for the description of mechanical parts, Computer Aided Design 27 (1995), 403ā€“433.

    Article  MATH  Google Scholar 

  6. M. FlasiƱski, Power properties of NLC graph grammars with a polynomial membership problem, Theoretical Computer Science 203 (1998), in print.

    Google Scholar 

  7. M. FlasiƱski, R.F. Schaefer, W. Toporkiewicz, Supporting CAE Parallel Computations with IE Graph Solid Representation, J. for Geom. and Graph., VOL 1 (1997), No. 1, 23ā€“29.

    MATH  Google Scholar 

  8. R.F. Schaefer, Z. Onderka, Markov Chain Based Management of Large Scale Distributed Computations of Earthen Dam Leakages, L.N.C.S 1215, Springer 1997, 49ā€“64.

    Google Scholar 

  9. R.F. Schaefer, J. Sipowicz, G. Myoeliwiec, Control Activities in Message Passing Environment, L.N.C.S 1332, Springer 1997, 143ā€“151.

    Google Scholar 

  10. B.H.V. Toping, A.I. Khan, J.K. Wilson, Parallel Dynamic Relaxation and Domain Decomposition, Advances in Parallel and Vector Processing for Structural Mechanics, CIVIL-COMP, 215ā€“232.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

FlasiƱski, M., Schaefer, R., Toporkiewicz, W. (1998). Optimal Stochastic Scaling of CAE Parallel Computations. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics