Load Balancing for Hex-Cell Interconnection Network

Transcription

1 Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer, Ahmad Alamoush, Osama Rababah Department of Computer Scence, Kng Abdullah II School for Informaton Technology, The Unversty of Jordan, Amman, Jordan Department of Busness Informaton Technology, Kng Abdullah II School for Informaton Technology, The Unversty of Jordan, Amman, Jordan Receved March ; accepted Aprl ; publshed Aprl Copyrght by authors and Scentfc Research Publshng Inc. Ths work s lcensed under the Creatve Commons Attrbuton Internatonal Lcense (CC BY). Abstract The hex-cell s one of the nterconnecton networks used for parallel systems. The man dea of the hex-cell s that there are hexagon cells that construct the network; each one of those cells has sx nodes. The performance of the network s affected by many factors one of the factors as load balancng. Untl the moment of wrtng of ths paper, there s no load balancng algorthm for ths network. The proposed algorthm for dynamc load balancng on hex-cell s based on Tree Walkng Algorthm (TWA) for load balancng on tree nterconnecton network and the rng all to all broadcast. Keywords Hex-Cell, Load Balancng, Tree Walkng. Introducton Hex-cell s newly proposed nterconnecton network n () []. The researches that evaluate the performance of the hex-cell are not enough and t should get more attenton because t has potentals for parallel systems. Snce there s no load balancng algorthm on hex-cell topology (untl the moment of wrtng of ths paper), the am of ths paper s to propose a dynamc load balancng algorthm and evaluate t. The proposed algorthm s based on Tree Walkng Algorthm (TWA) for load balancng on tree nterconnecton network and the rng all to all broadcast, usng the SBHCR (Secton Based Hex-Cell Routng Algorthm) addressng schema proposed n that dvdes the hex-cell nto sx sectons []. The rest of the paper s arranged as the followng. Secton s the related works that we buld our work on t nclude hex-cell network topology, Tree Walkng Algorthm (TWA) and rng all to all broadcast. Secton s the How to cte ths paper: Manaseer, S., Alamoush, A. and Rababah, O. () Load Balancng for Hex-Cell Interconnecton Network. Int. J. Communcatons, Network and System Scences,, -.

2 proposed load balancng algorthm and example to llustrate the way the algorthm works. Secton s the smulaton for the algorthm. Fnally, Secton s the concluson of the paper and the future work.. Related Works.. Hex-Cell Network Topology Hexogen unts create hex-cell topology; each one of those cells has sx nodes. The depth of the network s the number of levels around the nnermost cell denoted by HC (d) where d s the depth. So the nnermost cell has depth of one, the sx cells around t form level two, then the next twelve cells make the level three and so on [], As shown n Fgure. There are three addressng for the hex-cell topology. Frst addressng depend on the number of the lne that the node stand on from top to down and the number of node n that lne from left to rght [], whch denoted by par (X, Y) where X s the lne number and Y s the node number n that lne. So f the node n the thrd lne and has poston of ten then the node label s (, ). As shown n Fgure. The second addressng of the hex-cell s by dvdng the network nto sx sectons label from one to sx left to rght (clockwse). Each node takes a label consst of three numbers (S, L, X) where S s the secton number, L s the level number and X s the node number n that level whle X s not bgger than (( L) ) []. So f we have a node n secton three, n level two and number n that level s three then the node label s (,, ). As shown n Fgure. The thrd addressng s by usng the level of the node and the node number n that level. Whch denoted by par (X, Y) where X s the level number and Y s the node number whle the Y s less than ( L ) where L s the node level []. So the node n the thrd level and has number of thrty then (, ) as shown n Fgure... Tree Walkng Algorthm (TWA) The TWA uses global nformaton collecton to know the accumulatve load at each subtree and the number of the nodes at each subtree. After that the root node calculates the average load and broadcast t. Then each node calculates the quota for subtree for whch t s the root. Fnally start the exchange of tasks between the nodes []. To explan how TWA works Fgure shows tree wth seven nodes. Each node has number of tasks. Frst after the global nformaton collecton, each node has number of tasks (W ) and number of nodes n the subtree t rooted (N ). Then each node calculate the total number of tasks n the subtree (SW ). The root node (N ) calculates the average load and the remanng task (R) that cannot be evenly dvded on nodes. Then broadcast average load and R to all the nodes. Next each node calculates the quota for tself (Q ) and the subtree t rooted ( ). Table shows the values for each node. The flow of steps s presented n Fgure... Rng All to All Broadcast In all to all broadcast what needed s that each node sends the same message to all other nodes. That knd of Fgure. Hex-cell wth level one, two and three [].

8 ... Phase Three: Broadcast the Average Load Broadcast the average load tasks and the remanng tasks for each node n the tree secton. Each node calculates ts quota: ) Node quota = average load tasks + IF node order < remanng tasks. ) Node quota = average load tasks IF node order remanng tasks. For the each subtree quota: Subtree quota = (Average load tasks Number of nodes n the rooted subtree) + Remanng tasks for the rooted subtree.... Phase Four: TWA Balancng Trees wth dfferent load tasks do: ) Trees wth extra tasks apply TWA so that the extra task goes to the root node. ) Trees wth exact quota just apply TWA. ) Trees wth fewer tasks than ts quota do TWA to complete ts node from bottom to top wth the rght number of tasks (the node quota).... Phase Fve: Rng Balancng If the root node has extra tasks then sends the extra tasks to the next root else t sends Zero tasks to the next root node.... Phase Sx: Fnal Balancng Apply TWA agan to balance the receved tasks... LBHC Example Here s an example on the proposed LBHC algorthm. Fgure shows hex-cell network and each node has number of tasks.... Phase One: Global Informaton Collecton Each tree does the global nformaton collecton and compute total number of tasks and number of nodes n each subtree. The followng sx tables (Tables -) show that nformaton.... Phase Two: All to All Rng Broadcast Each root node sends the maxmum average and mnmum average. Then evaluate the task number and t s effcent to do global balancng snce maxmum quota s and the mnmum s. (Snce we have chosen tasks dfferent between the hghest average tasks load and lowest average tasks load to check the effcency to do Fgure. TWA balancng on tree nterconnecton network.

16 Fgure. Hex-cell network partal balanced. ) Root node n tree secton wll receve task, and ts quota s completed now. As shown n Fgure.... Phase Sx: Fnal Balancng After the root node n tree secton receved the tasks to complete ts quota as shown n Fgure. The tree wll apply TWA agan to balance the receved tasks. One communcaton step needed to perform the balancng: ) Send tasks from node to node. As shown n Fgure. Fnally the hex-cell network tasks load s balanced as shown n Fgure.. Smulaton The smulaton s done usng JAVA programmng language verson (.._) -bt, usng mult-threadng to smulate each node. The hardware specfcaton for our smulaton are: ) Processor: Intel(R) Core(TM) - M GHz. ) RAM:. GB. ) System type: Wndows /-bt. As for the smulaton we have chosen dfferent tasks between the hghest average tasks load and lowest average tasks load to check the effcency to do global balancng between the sectons trees. The major factor to evaluate load balancng algorthm s the accuracy. After the smulaton wth dfferent levels and dfferent nputs for the load tasks for each node, LBHC proved to be effectve. In all runs, the dfference between the hghest task load and the lowest task load s one. (Unless t s not effcent to do global balancng where the dfference wll be the factor we choose and that s ). The executon tme for any algorthm s one of the mportant factors to evaluate the performance. So Fgure shows the average executon tme for LBHC n varous levels, from level one (hex-cell has nodes) to level ten (hex-cell wth nodes). Another factor we have studed s number of messages n the network whle applyng the LBHC algorthm. Fgure shows the average number of messages n varous levels from level one (hex-cell has nodes) to level ten (hex-cell wth nodes).. Concluson and Future Work In ths paper, we have proposed a dynamc load balancng algorthm for hex-cell nterconnecton network that

17 Fgure. Root nodes from the sectons sendng tasks. Fgure. Partal balanced tree Secton receved more tasks. Fgure. Tree secton apply TWA agan to balance the receved tasks. s based on Tree Walkng Algorthm (TWA) and the rng all to all broadcast, usng SBHCR addressng schema that dvdes the hex-cell nto sx sectons. As the smulaton shows, ths algorthm has good performance n executon tme and number of message compared wth the number of nodes n the network. But snce there are no other dynamc load balancng algorthms on the hex-cell, we could not compare t any algorthm. For future

Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A