3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.
-
Upload
molly-patterson -
Category
Documents
-
view
219 -
download
0
description
Transcript of 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.
![Page 1: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/1.jpg)
3/12/2013 Computer Engg, IIT(BHU) 1
HYPERCUBE ALGORITHMS-3
![Page 2: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/2.jpg)
●Model: All-port, full-duplex, WH ● Lower bound: ● Intermediate research results: –Recursive tiling approach–Dilated-diagonal-based approach – Both, applicable only on two-dimensional tori.
![Page 3: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/3.jpg)
●Assume torus
● Look at the torus as on mosaic of constant patterns
(5 ,5 )k kT
![Page 4: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/4.jpg)
Recursive tiling approach
![Page 5: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/5.jpg)
![Page 6: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/6.jpg)
![Page 7: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/7.jpg)
![Page 8: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/8.jpg)
5 B-Patterns (k=1)
![Page 9: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/9.jpg)
A-Pattern (k=1)
![Page 10: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/10.jpg)
Recursive tiling approach
●Observation: Torus for any k can be represented as a single A-Pattern. (every A-Pattern consists of 5 B-Patterns).
●Define for nodes that transmit at any odd round i, for nodes that transmit at any even round i. (the broadcaster has A-sons(B-sons) for every odd(even) i. His A-sons has B-sons for every even i, and A-sons for i=3,5,…k(or k-1). And so on…)
(5 ,5 )k kT
iA son
![Page 11: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/11.jpg)
Recursive tiling approach●The Algorithm (for any node t ) : –toSend = true; Msg contains value - for broadcasting node,
– toSend = false; Msg is null - for all other nodes
–At round i ( ) do:●If toSend = true and i is odd then–send Msg to all (5) ●Else If toSend = true and i is even then–send Msg to all (5)●Else if received message M` then–Msg M`–toSend true–End of round
1 2i k
iA sons
iB sons
![Page 12: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/12.jpg)
Recursive tiling approach
●Complexity analysis:●# of rounds: 2k, (reminder: )●# of transmissions: every node receives message only once, therefore it is
●The algorithm is optimal!
●Note: The algorithm is applicable only to tori
22 2 1log 5 2k k
25 1k
(5 ,5 )k kT
![Page 13: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/13.jpg)
Dilated-diagonal-based approach●Assume torus.●The algorithm consists out of 3 Phases.●Phase I: Broadcast the packet into all rows so that each row contains exactly one packet. (by recursive splitting the torus into 5 horizontal strips, sending the packet using XY routing).●Phase I takes rounds
(5 ,5 )k kT
5log N k
![Page 14: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/14.jpg)
Dilated-diagonal-based approach
![Page 15: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/15.jpg)
Dilated-diagonal-based approach
![Page 16: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/16.jpg)
Dilated-diagonal-based approach
![Page 17: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/17.jpg)
Dilated-diagonal-based approach●Phase II: Align the packets to the main diagonal in all rows in parallel.
●Phase II takes single round.
![Page 18: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/18.jpg)
Dilated-diagonal-based approach●Phase III: Decompose the torus into 5 diagonal bands (of width ).–The main diagonal is in the middle diagonal of the first one.–Every node on middle diagonal sends 4 packets to the counterpart nodes on the middle diagonals of other 4 bands.–All packets are send on link-disjoint paths.–Recursively divide each band into 5 bands and continue with the algorithm.
●Phase III takes rounds.
15k
5log N k
![Page 19: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/19.jpg)
![Page 20: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/20.jpg)
![Page 21: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/21.jpg)
![Page 22: 3/12/2013Computer Engg, IIT(BHU)1 HYPERCUBE ALGORITHMS-3.](https://reader036.fdocuments.us/reader036/viewer/2022062413/5a4d1b207f8b9ab059995335/html5/thumbnails/22.jpg)
Dilated-diagonal-based approach●Complexity analysis:●# of rounds: 2k+1● # of transmissions: every node receives message only once, therefore it is ●The algorithm is almost optimal!●Note: The algorithm can be generalized and applied to arbitrary 2-D torus, in which case it requires at most 5 rounds more than the lower bound.
25 1k