• Nenhum resultado encontrado

VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER

N/A
N/A
Protected

Academic year: 2017

Share "VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER"

Copied!
5
0
0

Texto

(1)

7

Е

Е

Я

681.3

. .

.

. ,

. – ,

. ,

-,

-. ,

.

: , , .

( )

. , ,

.

[1]. ,

.

. G

V E,

, V

v ii| 1, 2, ...,n

– ; E

eu|u1, 2, ...,n

[2].

,

G V E , V ,

E. V k

, V    V1 V2 .. Vk, t j V, tVj  .

F, V V1, 2,... ,Vk. – F.

– ,

[3].

,

[4],

[2]. .

, ,

V G - [2].

,

[5]. C

T [2, 4, 5].

, C.

[6].

[5, 7]. ,

,

[6].

, [8, 9].

V

vi [10]

 

 

Pr( )

 

  

  

 

i i i

j j V

v v

v

j

v

, (1)

 i T , vi,

 

(2)

i

v [7].  0  0

, , [6].

,

, ,

.

[2].

.

[5–10]:

1. - ( ) ,

.

2. , - .

,

[6]. ч

,

, . , ,

, . ,

.

-, , ,

, [10].

,

-- , .

,

-, .

, ,

-, . . m n ,

. ,

-.

щ

.

,

[6, 9]. ,

,

-, ,

.

[5, 7].

[8].

- (1). ,

( ,

-). ,

.

[10, 11]. ,

. ,

.

,

, .

.

-, , , .

. ,

[10, 12]. ,

,

-, .

-,

-, . –

(3)

1

( ) log

  

r i i

i

E X P P, (2)

i

P .

n : n n( 1) / 2 , rn n( 1) / 2.

max

1 1

1 1

log log log

 

 

r i i  

r

i i

E P P r

r r . (3)

,

-, .

:

5 E 1

4 , 3

2 0

 

  

  

A

B E A

C E B

E C

, (4)

max

max

1 

  E E

E

E , (5)

E

(3), A B C, , – , .

-A 0,81 ~ 0,89, B – 0,74 ~ 0,54, C

-B.

1

2

3

4

5

6

7

9

10

8

(4)

,

,

-, .

.

1. .

2. (4).

3.

-.

4. , .

5. , ,

.

6. , ,

-, .

7. . ,

4, , 8.

8. (2).

9. (5).

4.

10. .

. 11. .

- .

++.

Visual Studio 2008 32- Windows,

IBM- Intel(R) Duo Core(TM)Duo

2Ghz 512 MB DIMM PC-3200.

( ) PrimGA1.

[6, 12], .

-, , –  – ,

-.

-. ,

.  :

  f f

f ,

f – ; f

.

К , ,

100 100

 

   

 

f

f [%],

f – , ;

f – .

[6, 12] ,

6%.

ч

, .

.

,

-.

-, ,

, .

[13]. ,

(5)

-, . -,

– .

.

1. . ., . ., . .

// . . « ». –

2007. – № 2 (77). – . 18–25.

2. Dorigo M., Stützle T. Ant Colony Optimization. – London: A Bradford, 2004. – 305 p.

3. . ., . . //

. . – 2010. – № 1. – . 32–45.

4. . ., . ., . . . – .:

, 2009. – 384 .

5. . ., . . // .

. « ». – 2008.– № 4 (81). – 7–12.

6. . . // . .

« ». – 2009. – № 12 (101). – C. 53–58.

7. . ., . ., . . ,

// . . «

-». – 2009. – № 4 (93). – C. 16–24.

8. . . // . – 2004. – № 4 (4). – . 70–75.

9. . ., . . // .

-. – 2008-. – № 4 (81). – . 20–26.

10.Hlaing Z., Khine M. An Ant Colony Optimization Algorithm for Solving Traveling Salesman Problem //

International Proceedings of Computer Science and Information Technology. – 2011. – V. 16. – P. 54–59.

11.Hinne M., Marchiori. E. Cutting Graphs Using Competing Ant Colonies and an Edge Clustering Heuristic//

Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization. – 2011. – V. 6622. – P. 60–71.

12.Randall M., Lewis A. Modifications and additions to ant colony optimization to solve the set partitioning

problem // Proceedings of the 2010 6th IEEE International Conference on e-Science Workshops. – 2010. – P. 110–115.

13. . ., . ., . . ,

-: // . . «

-». – 2010. – № 12 (113). – C. 196–203.

Referências

Documentos relacionados

Assegura-se assim, com a tecnologia do broto/batata-semente, a um custo equivalente do sistema convencional de importação de lotes de tubérculos/batata- semente, a fidelidade

O conceito de supervisão pedagógica tem sido utilizado sobretudo em contextos relacionados com a formação inicial de professores e com o desenvolvimento profissional de docentes

Then, the methodology is applied to the design of two representa- tive engineering systems through multi-objective optimization using the Firefly Colony Algorithm in association

Popular optimization techniques, as genetic algorithm (GA) and particle swarm optimization (PSO), were used to design the shape of the ground plane in order to improve

The filled function algorithm is an efficient deterministic global optimization algorithm, and it has been used to solve plenty of optimization problems, such as unconstrained

Considering a wireless sensor network where the nodes have limited energy, we propose a novel model Energy ∗ Delay based on Ant Colony Optimization (ACO) algorithm (E&D ANTS)

For the optimization and intelligence research periodicals (e.g. IEEE Transactions on Evolutionary Computation , Wiley’s Expert Systems , etc.), in addition to the standard

The techniques discussed in this paper are Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Bacterial Foraging Optimization Algorithm (BFOA),