Static Load Balancing Algorithms in Cloud Computing: Challenges and SolutionsCloud computing offers paid hosting and Internet services. It has now become a preferred method for scalable network communication and computing because of its many attractive features such as high availability, scalability, fault...
This paper is devoted to static load balancing techniques for mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors. At each iteration, independent calculations are carried out in parallel, and
There exist only a few studies that use the non-cooperative approach for load balancing in distributed systems. Kameda et al. [22] derived load balancing algorithms for single and multi-class jobs using non-cooperative games based on Wardrop equilibrium. In this case each of the infinitely many...
The experimental results demonstrated that the algorithm outperformed the earliest deadline first and the time-stepped load-balancing scheduling algorithms. The results also demonstrated that the HLBhad a higher real-time operating efficiency than the other algorithms under a lower overhead guarantee. ...
A Dynamic Load Balancing Framework for Unstructured Adaptive Computations on Distributed-Memory Multiprocessors - 1996 () Citation Context ...Many load balancing algorithms have been optimized for static or quasi-static networks, with or without the possibility of site failure [3]. Algorithms have also...
destination network addresses, subnet masks, next-hop addresses, interface identifiers, and path metrics.The table maintains detailed records of source and destination IP addresses, along with default gateway information, enabling efficient packet forwarding decisions through longest prefix matching algorithms...
Because the routing protocols have metrics based on algorithms that are different from the other protocols, it is not always possible to determine the best path for two routes to the same destination that were generated by different routing protocols. Each routing protocol is prioritized using an ...
Some heuristic algorithms were evaluated in [8] to find a greedy algorithm providing optimal performance. A heuristic content delivery algorithm based on fan-out was proposed by Radoslav et al. [9] and Jamin et al. [10]. Except for retrieval cost, the upload cost was further added [11]....
The architecture employed was a supervised feed forward multilayered ANN, trained using scaled conjugate gradient algorithms (Bose and Liang 1996). The input layer consisted of three design variables: sliding velocity, applied pressure, and sliding time. The outputs of interest included the ...
Because the routing protocols have metrics based on algorithms that are different from the other protocols, it is not always possible to determine the best path for two routes to the same destination that were generated by different routing protocols. Each routing protocol is prioritized using an ...