Asynchronous organizations for solving the point-to-point connection problem

Author

de Carvalho Gomes, F. ; De Meneses, Claudio Nogueira ; Lima, Allan G. ; Oliveira, Carlos S.

Author_Institution

Lab. de Inteligencia Artificial, Univ. Fed. do Ceara, Brazil

fYear

1998

fDate

3-7 Jul 1998

Firstpage

144

Lastpage

149

Abstract

We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is an organization of agents that communicate with each other by means of shared memories. Each agent is a heuristic strategy that can make its own choices about its inputs, scheduling and resource allocation. Computational results comparing our approach against an exact algorithm are presented

Keywords

VLSI; circuit CAD; circuit optimisation; circuit switching; cooperative systems; integrated circuit design; software agents; Asynchronous Teams; NP-hard; VLSI design; agent approach; asynchronous organizations; circuit switching; heuristic strategy; nonfixed point-to-point connection problem; optimal global solution; resource allocation; scheduling; shared memories; Application software; Computer science; Design optimization; Dynamic programming; Job shop scheduling; Laboratories; Polynomials; Processor scheduling; Resource management; Switching circuits; Traveling salesman problems; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Multi Agent Systems, 1998. Proceedings. International Conference on

Conference_Location

Paris

Print_ISBN

0-8186-8500-X

Type

conf

DOI

10.1109/ICMAS.1998.699043

Filename

699043