Graph Coloring using Peer-to-Peer Networks
•Descargar como PPT, PDF•
0 recomendaciones•736 vistas
![Content ,[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recomendados
Recomendados
Más contenido relacionado
Destacado
Destacado (19)
Similar a Graph Coloring using Peer-to-Peer Networks
Similar a Graph Coloring using Peer-to-Peer Networks (20)
Más de Faculty of Computer Science
Más de Faculty of Computer Science (19)
Último
Último (20)
Graph Coloring using Peer-to-Peer Networks
- 1. Graph Coloring using Peer-to-Peer Networks Adrian Iftene, Cornelius Croitoru {adiftene,croitoru}@infoiasi.ro Faculty of Computer Science “ Al.I.Cuza” University, Iaşi, ROMANIA RoEduNet 2006, Sibiu
- 6. CAN – Insertion – Sample 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 Node 2 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 Node 2 Node 3 A node can refuse to split if it thinks it neighbors should be split instead, keeps the load balanced 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 Node 2 Node 3 Node 4 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 Node 2 Node 3 Node 4 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 Node 2 Node 3 Node 4 Node 5 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Node 1 Node 2 Node 3 Node 5 Node 4 Node 6
- 9. Recursive Graph Coloring A node from network will initiate a coloring problem All available neighbours will be involved in problem solving In the end all partial solutions are sended to the initiator All nodes will communicate with problem initiator
- 12. Tests and Results 78 s 127 s 38 36 35 25 17425 450 Le450-25d 90 s 145 s 39 37 36 25 17343 450 Le450-25c 85 s 129 s 32 32 30 15 16750 450 Le450-15d 79 s 110 s 32 33 30 15 16680 450 Le450-15c 26 s 44 s 18 18 18 5 9757 450 Le450-5d 13 s 20 s 14 15 13 5 5734 450 Le450-5b 14 s 21 s 13, 14 15 13 5 5714 450 Le450-5a 27 s 30 s 25 32 25 16 12640 256 Queen16-16 2 s 1 s 14, 15, 16 17 18 12 3216 128 Queen10-10 1 s 0 s 13, 14, 15 16 14 10 2112 81 Queen9-9 1 s 0 s 12, 13, 14 16 13 9 728 64 Queen8-8 1 s 0 s 15 , 16, 17 17 15 12 1368 96 Queen8-12 1 s 0 s 10, 11 , 12 13 12 7 476 49 Queen7-7 1 s 0 s 9 , 10, 11 13 9 7 290 36 Queen6-6 1 s 0 s 6, 7, 8 , 9 8 7 5 160 25 Queen5-5 1 s 1 s 9, 10 9 10 9 638 120 Games120 0 s 0 s 10 , 11 11 11 10 254 80 Jean 0 s 0 s 11 11 11 11 301 74 Huck 0 s 0 s 11, 12, 13 12 12 11 406 87 David 2 s 1 s 11, 12 12 12 11 493 138 Anna 0 s 0 s 7, 8 8 7 7 755 95 Myciel7 0 s 0 s 6 , 7 7 6 6 236 47 Myciel5 0 s 0 s 5 , 6 6 5 5 71 23 Myciel4 P2P Local Random Order Theorem Edges Nodes ID