Multi-agent parallel implementation of VLSI CAD procedures

The integrated framework for parallel processing of data describing integrated circuits layouts that based on a graphoriented parallel algorithm representation is represented. A parallel program is developed from single computational units (grains) in specialized visual editor. This visual schema is translated into XML form that is interpreted by multi agent runtime system, based on a MPI library. The runtime system realizes a dynamic optimization of parallel computations with the algorithm of virtual associative network. The proposed tools are well suited for rapid development, analysis and execution of parallel algorithms with adaptation to specific cluster architecture.

REFERENCES (14)

Voganti M., Ercal F., Dagli C., Tsunekawa S.: Automatic PCI Inspection Algorithms: A Survey, Computer Vision and Image Understanding, 1996, 63, p. 287-313.

Google Scholar

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

Google Scholar

A Framework for Parallel Processing of Image Dataflow in Industrials Applications / Aleksej Otwagin, Alexander Doudkin //Proceedings of the fourth International Conference on Neural Networks and Artificial Intelligence (ICNNAI’2006), May, 31-June, 2, Brest, Belarus /Brest: BSTU, 2006, p. 162-167.

Google Scholar

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

Google Scholar

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

Google Scholar

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

Google Scholar

Gerasoulis A., Yang T.: A comparison of clustering heuristics for scheduling directed acyclic graphs onto multiprocessors. Journal of Parallel and Distributed Computing, 1992, №4 (16), p. 276-291.

Google Scholar

Sarkar V.: Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. The MIT Press, 1989.

Google Scholar

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

Google Scholar

10.

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

Google Scholar

11.

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

Google Scholar

12.

Sadykhov R.Kh., Otwagin AV.: 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), Allerton Press Inc., New York, 2001, p. 25-33.

Google Scholar

13.

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

Google Scholar

14.

Poslad S., Buckle P., Hadingham R.: 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.

Google Scholar

Submit your paper

Instructions for Authors

eISSN:	2719-423X
ISSN:	1642-686X