Aspect-Oriented Programing Techniques to support Distribution, Fault Tolerance, and Load Balancing in the CORBA-LC Component Model

Author(s):  
Diego Sevilla ◽  
Jose M. Garcia ◽  
Antonio Gomez
Author(s):  
M. Chaitanya ◽  
K. Durga Charan

Load balancing makes cloud computing greater knowledgeable and could increase client pleasure. At reward cloud computing is among the all most systems which offer garage of expertise in very lowers charge and available all the time over the net. However, it has extra vital hassle like security, load administration and fault tolerance. Load balancing inside the cloud computing surroundings has a large impact at the presentation. The set of regulations relates the sport idea to the load balancing manner to amplify the abilties in the public cloud environment. This textual content pronounces an extended load balance mannequin for the majority cloud concentrated on the cloud segregating proposal with a swap mechanism to select specific strategies for great occasions.


2021 ◽  
Vol 12 (11) ◽  
pp. 1523-1533
Author(s):  
Bidush Kumar Sahoo , Et. al.

Cloud computing is built upon the advancement of virtualization and distributed computing to support cost-efficient usage of computing resources and to provide on demand services. After methodical analysis on various factors affecting fault tolerance during load balancing is performed and it is concluded that the factors influencing fault tolerance in load balancing are cloud security, adaptability etc. in comparatively more software firms. In this paper, we have created a model for various IT industries for checking the fault tolerance during Load balancing. An exploration is done with the help of some renowned IT farms and industries in South India. This work consists of 20 hypotheses which may affect the fault tolerance during load balancing in South India. It is verified by using potential statistical analysis tool i.e. Statistical Package for Social Science (SPSS).


2012 ◽  
pp. 232-259
Author(s):  
Eddy Caron ◽  
Frédéric Desprez ◽  
Franck Petit ◽  
Cédric Tedeschi

Within distributed computing platforms, some computing abilities (or services) are offered to clients. To build dynamic applications using such services as basic blocks, a critical prerequisite is to discover those services. Traditional approaches to the service discovery problem have historically relied upon centralized solutions, unable to scale well in large unreliable platforms. In this chapter, we will first give an overview of the state of the art of service discovery solutions based on peer-to-peer (P2P) technologies that allow such a functionality to remain efficient at large scale. We then focus on one of these approaches: the Distributed Lexicographic Placement Table (DLPT) architecture, that provide particular mechanisms for load balancing and fault-tolerance. This solution centers around three key points. First, it calls upon an indexing system structured as a prefix tree, allowing multi-attribute range queries. Second, it allows the mapping of such structures onto heterogeneous and dynamic networks and proposes some load balancing heuristics for it. Third, as our target platform is dynamic and unreliable, we describe its powerful fault-tolerance mechanisms, based on self-stabilization. Finally, we present the software prototype of this architecture and its early experiments.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 130500-130526
Author(s):  
Muhammad Asim Shahid ◽  
Noman Islam ◽  
Muhammad Mansoor Alam ◽  
Mazliham Mohd Su'ud ◽  
Shahrulniza Musa

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Minakshi Tripathy ◽  
C. R. Tripathy

In recent past, many types of shared memory cluster computing interconnection systems have been proposed. Each of these systems has its own advantages and limitations. With the increase in system size of the cluster interconnection systems, the comparative analysis of their various performance measures becomes quite inevitable. The cluster architecture, load balancing, and fault tolerance are some of the important aspects, which need to be addressed. The comparison needs to be made in order to choose the best one for a particular application. In this paper, a detailed comparative study on four important and different classes of shared memory cluster architectures has been made. The systems taken up for the purpose of the study are shared memory clusters, hierarchical shared memory clusters, distributed shared memory clusters, and the virtual distributed shared memory clusters. These clusters are analyzed and compared on the basis of the architecture, load balancing, and fault tolerance aspects. The results of comparison are reported.


2002 ◽  
Vol 32 (3) ◽  
pp. 23-23 ◽  
Author(s):  
Armando L. Caro ◽  
Janardhan R. Iyengar ◽  
Paul D. Amer ◽  
Gerard J. Heinz ◽  
Randall R. Stewart

Author(s):  
Tian-Liang Huang ◽  
Tian-An Hsieh ◽  
Kuan-Chou Lai ◽  
Kuan-Ching Li ◽  
Ching-Hsien Hsu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document