Читать книгу Cloud Computing Solutions - Группа авторов - Страница 26

Grid computing engages in linking different geographically remote machines and servers into one individual network to create (from client’s perspective) a virtual supercomputer aided by joining the resource and computational control of all computers on the grid. A system of geologically and physically distributed resources having machines, switches, devices, connecting cables, appliances and data make up the grid computing environment. Every resource can be utilized by every user with only one login account. Diverse artifaces may possess the physical artifaces. The related terminologies in grid computing are distributed computing and peer-to-peer computing [9].

 Distributed Computing (DC): Distributed computing uses the procedure of dispersing the workload of a program across at least two procedures. The prime goal of distributed computing is separating and dealing with issues in various computers associated through a typical network. A distributing system involves different selfgoverning computers, self-communicating with each other by means of a personal computer network. The personal computer cooperates keeping in mind the end goal to attain a shared objective. A few characteristics of a distributed system are given below:

 Fault Tolerance: All personal computers inside the shared system have to cope with crashes, i.e., the system needs to tolerate the faults.

 Heterogeneous Atmosphere: The disseminated framework (network latency, network topology, network associations and several involved personal computers) isn’t predefined. The disseminated framework may incorporate specific types of personal computers and heterogeneous network joins. When running a program, framework structure could change with a specific end goal to achieve that goal. This is known as “heterogeneous atmosphere.”

 Separate Participation: Separate participation is an instance where each and every personal computer has its particular participation and has a constrained perspective of the final system. All personal computers may just know a few modules or a few parts of the entire program or information.

Figure 1.3: Schematic diagram of distributed system.

The above Figure 1.3 shows disseminated frameworks as a group of personal computers connected with each other by a correspondence network with all personal computers having a processor and memory with a similar kind of end goal for the work. Depending upon the workload and the execution time, the network topology and aggregate number of contributing personal computers can be progressively orchestrated.

 Peer-to-Peer Computing (P2P): In this strategy, every personal computer shares the physical resources and services by specifically interchanging among the systems and every personal computer could perform as servers and client for other personal computers associated with the network. Which personal computer could perform as a client or server depends upon which part is more dependable and proficient for that network. In P2P, data is commonly interchanged immediately and maintain the basic internet protocol (IP) network. The main priority of P2P is decentralized coordination which avoids single dependency.

Figure 1.4 below shows 6 nodes, Node A, B, C, D, E, and F. Every node speaks for itself in a machine and could distribute the physical artifacts and organizations specifically trading between the nodes and communicating with all others. Every node could act as server and client for alternate nodes associated with the system.

Figure 1.4: Peer-to-peer communication scenario.

In P2P frameworks, resources such as storage, estimations and bandwidth are given by clients. The main advantage of P2P network is the decentralized system. Subsequently, there is an arrangement of information and framework backup among the nodes. In any case, the fundamental proviso of P2P framework is the security issue. A node can download an infection document that could contaminate alternate frameworks; in that worry, P2P framework is powerless against unsigned and unsecured codes which prompt unsecured conditions because of the absence of a unified executive.