Optimal Stochastic Scaling for CAE Parallel Computations

Authors:
Mariusz Flasinski;Robert Schaefer;Wojciech Toporkiewicz
Affiliations:
-;-;-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 4
Cited 4

Distorted pattern analysis with the help of node label controlled graph languages

Pattern Recognition
Power properties of NLC graph grammars with a polynomial membership problem

Theoretical Computer Science
Control Activities in Message Passing Environment

Proceedings of the 4th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Markov Chain Based Management of Large Scale Distributed Computations of Earthen Dam Leakages

VECPAR '96 Selected papers from the Second International Conference on Vector and Parallel Processing

Multi-agent System for Recognition of Hand Postures

ICCS 2009 Proceedings of the 9th International Conference on Computational Science
The dynamics of computing agent systems

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
The autonomous concurrent strategy for large scale CAE computation

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Inference of Parsable Graph Grammars for Syntactic Pattern Recognition

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.