RELIABLE AND EFFICIENT PARALLEL COMPUTING ON THE BASE OF MULTIAGENT SYSTEM

Authors

  • Aleksej Otwagin

DOI:

https://doi.org/10.47839/ijc.7.3.531

Keywords:

Parallel processing, reliability, runtime optimization, multi-agent architecture, evolutionary algorithms

Abstract

Basic principles of reliable parallel computations are considered. The parallel program is represented as a graph computation schema, that executed by unreliable computing system with possible node faults. For organization and optimization of parallel processing a kind of multiagent architecture was used. The proposed solution uses the principles of runtime evolutionary optimization to increase performance characteristics.

References

. H.S. Nwana. Software Agents: An Overview. // The Knowledge Engineering Review. – 1996. – №11. – P. 205-244.

. M. Wooldridge. Agents and software engineering // AI*IA Notizie. – 1998. - Vol. 11. - № 3. - P. 31-37.

. D. Argiro, S. Kubica, M. Young, and S. Jorgensen. Khoros: An integrated development environment for scientific computing and visualization. Whitepaper, Khoral Research, Inc., 1999.

. M. Zikos, E. Kaldoudi, S. Orphanoudakis. DIPE: A Distributed Environment for Medical Image Processing. Proceedings of MIE'97, Porto Carras, Sithonia, Greece, May 25-29, 1997, pp. 465-469.

. M. Guld, B. Wein, D. Keysers, C. Thies, M. Kohnen, H. Schubert, and T. Lehmann, "A distributed architecture for content-based image retrieval in medical applications," in Proceedings of the 2nd International Workshop on Pattern Recognition in Information Systems, pp. 299–314, 2002.

. J. Wickel, P. Alvarado, P. Dorfler, T. Kruger, and K.-F. Kraiss. Axiom — a modular visual object retrieval system. In M. Jarke, J. Koehler, and G. Lakemeyer, editors, KI 2002: Advances in Artificial Intelligence, LNAI 2479. Springer, 2002, p. 253–267.

. W. Gropp, E. Lusk, and A. Skjellum Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, 1995.

. K. Hwang, Z. Xu. Scalable Parallel Computing – Technology, Architecture, Programming. McGraw-Hill, USA, 1998.

. B. S. Macey, A. Y. Zomaya. A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In Proc. of IPPS/SPDP, 1998, p. 538-541.

. D. A. Menasce, D. Saha et al. Static and dynamic processor scheduling disciplines in heterogeneous parallel architecture. Journal of Parallel and Distributed Computing. Vol. 28, 1995. – pp. 1-18.

. H. Oh, S. Ha. A Static Scheduling Heuristic for Heterogeneous Processors. Second International EuroPar Conference Proceedings, Vol II., Lyon, France, 1996, p. 573-577.

. A. S. Porto, A. C. Ribeiro. A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. International Journal of High-Speed Computing, 2 (7), 1995, p. 45-71.

. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Second, Extended Edition. Springer-Verlag. 1994.

. Y. M. Yufik, T. B. Sheridan. Virtual Networks: New framework for operator modeling and interface optimization in complex supervisory control systems // A Rev. Control, vol. 20, p. 179-195.

. R. Kh. Sadykhov, A.V. Otwagin. Solution search algorithm of solution search for systems of parallel processing based on a virtual neural network model. Automatic Control and Computer Science, vol. 35 (1), 2001, Allerton Press Inc., New York, p. 25-33.

. R. Kh. Sadykhov, A. V. Otwagin. Algorithm for optimization of parallel computation on the basis of genetic algorithms and model of a virtual network. In Proceedings of the International Workshop on Discrete-Event System Design DESDes’01, Przytok, Poland, June 27-29, 2001, p.121-126.

. R.W. Cheng, M. Gen. Parallel machine scheduling problems using Memetic Algorithms // Computers & Industrial Engineering. – Vol. 33. - № 3-4. – 1997. - P. 761-764.

. N.J. Radcliffe. Formal memetic algorithms // Evolutionary Computing: AISB Workshop; ed. T.C. Fogarthy. - Springer Verlag, 1994. – P. 1-16.

. S. Poslad, P. Buckle, R. Hadingham. Open Source, Standards and Scaleable Agencies. International Workshop on Infrastructure for Agents, Multi-Agent Systems, and Scalable Multi-Agent Systems, June 03-07, 2000, Manchester, UK, p.296-303.

Downloads

Published

2014-08-01

How to Cite

Otwagin, A. (2014). RELIABLE AND EFFICIENT PARALLEL COMPUTING ON THE BASE OF MULTIAGENT SYSTEM. International Journal of Computing, 7(3), 107-113. https://doi.org/10.47839/ijc.7.3.531

Issue

2008, Volume 7, Issue 3

Section

Articles

License

International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
•    Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
•    Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
•    Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.