Load balancing – node transfer trade-off in reconfigurable WDM networks

2006 ◽  
Vol 153 (3) ◽  
pp. 469
Author(s):  
I. Alfouzan ◽  
M.E. Woodward
2020 ◽  
Vol 10 (15) ◽  
pp. 5266 ◽  
Author(s):  
Lianyin Jia ◽  
Chongde Zhang ◽  
Mengjuan Li ◽  
Yinong Chen ◽  
Yong Liu ◽  
...  

Trie is one of the most common data structures for string storage and retrieval. As a fast and efficient implementation of trie, double array (DA) can effectively compress strings to reduce storage spaces. However, this method suffers from the problem of low index construction efficiency. To address this problem, we design a two-level partition (TLP) framework in this paper. We first divide the dataset is into smaller lower-level partitions, and then we merge these partitions into bigger upper-level partitions using a min-heap based greedy merging algorithm (MH-GMerge). TLP has an excellent characteristic of load balancing and can be easily parallelized. We implemented two efficient parallel partitioned DAs based on TLP. Extensive experiments were carried out, and the results showed that the proposed methods can significantly improve the construction efficiency of DA and can achieve a better trade-off between construction and retrieval performance than the existing state-of-the-art methods.


2003 ◽  
Author(s):  
Zhizhong Zhang ◽  
Fang Cheng ◽  
Qingji Zeng ◽  
Tong Ye

2017 ◽  
Vol 8 (3) ◽  
pp. 53-73
Author(s):  
Raza Abbas Haidri ◽  
Chittaranjan Padmanabh Katti ◽  
Prem Chandra Saxena

The emerging cloud computing technology is the attention of both commercial and academic spheres. Generally, the cost of the faster resource is more than the slower ones, therefore, there is a trade-off between deadline and cost. In this paper, the authors propose a receiver initiated deadline aware load balancing strategy (RDLBS) which tries to meet the deadline of the requests and optimizes the rate of revenue. RDLBS balances the load among the virtual machines (VMs) by migrating the request from the overloaded VMs to underloaded VMs. Turnaround time is also computed for the performance evaluation. The experiments are conducted by using CloudSim simulator and results are compared with existing state of art algorithms with similar objectives.


2004 ◽  
Author(s):  
Zhizhong Zhang ◽  
Yunlin Zhang ◽  
Qingji Zeng ◽  
Jianxin Wang ◽  
Tong Ye ◽  
...  

2014 ◽  
pp. 33-38
Author(s):  
Violeta Felea ◽  
Bernard Toursel

In the context of heterogeneous networks, like clusters of workstations, the design of programming and execution environments aims to automatically adapt execution to fluctuations that may appear in the execution of distributed and parallel Java applications. ADAJ, Adaptive Distributed Applications in Java, addresses this problem, dealing with both parallelism and distribution features. Ease of programming is achieved through an object and method parallelism paradigm. The trade-off between transparency of such a parallelism expression and efficiency is solved by application redeployment, meant to maintain a good performance level. This is the purpose of the load balancing in ADAJ, a dynamic and transparent tool at the middleware level, which exploits information issued from observation of the application, in order to consider both object activity and communication patterns. Communications generate attraction relations between objects and this article presents the evaluation of the load balancing mechanism for a type of asynchronous applications in which the communication aspect is important.


Sign in / Sign up

Export Citation Format

Share Document