Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing
Computing consists of a network of heterogeneous computers, from which a virtual super computer is essentially formed. It displays immense potential as the various resources across large networks can be pooled to service many and be utilized by many, using the Internet from around the world. The pot...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
European Alliance for Innovation (EAI)
2018-06-01
|
| Series: | EAI Endorsed Transactions on Scalable Information Systems |
| Subjects: | |
| Online Access: | http://eudl.eu/doi/10.4108/eai.19-6-2018.154826 |
| _version_ | 1818452434662457344 |
|---|---|
| author | J. Amudhavel V. Agalya T. Dhivya V. Vijayakumar S. Keerthana A. Dhamayanthi B. Bhuvaneswari |
| author_facet | J. Amudhavel V. Agalya T. Dhivya V. Vijayakumar S. Keerthana A. Dhamayanthi B. Bhuvaneswari |
| author_sort | J. Amudhavel |
| collection | DOAJ |
| description | Computing consists of a network of heterogeneous computers, from which a virtual super computer is essentially formed. It displays immense potential as the various resources across large networks can be pooled to service many and be utilized by many, using the Internet from around the world. The potential for parallel CPU processing is one of the most attractive features of a grid. A perfectly scalable application will finish five times faster if it uses five times the number of processors. Application software as required by the users of the grid. Thus, the structure can be represented in layers, as implied by the grouping of grid components. Hardware, the bottom layer, would then contain a large number of heterogeneous resources and would be accessed by a limited number of users to ensure data privacy. The next layer would then consist of application software and tools that are useful for the users and which are domain-specific. In this research we analyzed the distributed and high-performance system in grid computing to provide the efficient resource discovery and message broadcasting. The Distributed Spanning Tree (DST’s) implementation is altered and adapted to achieve better server load and message load distribution by a selective search and look-up mechanism in this proposal. In addition, a fault tolerance mechanism is also expressed in this contribution, as part of the DST’s adaptation, such that if the system which is providing the service fails or leaves the grid environment, then the backup site will immediately take up the execution and recover the task. |
| first_indexed | 2024-12-14T21:23:02Z |
| format | Article |
| id | doaj.art-5ed4e586ae0c43359ea031c9c840a405 |
| institution | Directory Open Access Journal |
| issn | 2032-9407 |
| language | English |
| last_indexed | 2024-12-14T21:23:02Z |
| publishDate | 2018-06-01 |
| publisher | European Alliance for Innovation (EAI) |
| record_format | Article |
| series | EAI Endorsed Transactions on Scalable Information Systems |
| spelling | doaj.art-5ed4e586ae0c43359ea031c9c840a4052022-12-21T22:46:54ZengEuropean Alliance for Innovation (EAI)EAI Endorsed Transactions on Scalable Information Systems2032-94072018-06-015181810.4108/eai.19-6-2018.154826Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computingJ. Amudhavel0V. Agalya1T. Dhivya2V. Vijayakumar3S. Keerthana4A. Dhamayanthi5B. Bhuvaneswari6Department of CSE, KL University, Andhra Pradesh, India; info.amudhavel@gmail.comDepartment of Computer Science and Engineering, SMVEC, Pondicherry, IndiaDepartment of Computer Science and Engineering, SMVEC, Pondicherry, IndiaDepartment of Computer Science and Engineering, SMVEC, Pondicherry, IndiaDepartment of Computer Science and Engineering, SMVEC, Pondicherry, IndiaDepartment of Computer Science and Engineering, SMVEC, Pondicherry, IndiaDepartment of Computer Science, Pondicherry University, Pondicherry,IndiaComputing consists of a network of heterogeneous computers, from which a virtual super computer is essentially formed. It displays immense potential as the various resources across large networks can be pooled to service many and be utilized by many, using the Internet from around the world. The potential for parallel CPU processing is one of the most attractive features of a grid. A perfectly scalable application will finish five times faster if it uses five times the number of processors. Application software as required by the users of the grid. Thus, the structure can be represented in layers, as implied by the grouping of grid components. Hardware, the bottom layer, would then contain a large number of heterogeneous resources and would be accessed by a limited number of users to ensure data privacy. The next layer would then consist of application software and tools that are useful for the users and which are domain-specific. In this research we analyzed the distributed and high-performance system in grid computing to provide the efficient resource discovery and message broadcasting. The Distributed Spanning Tree (DST’s) implementation is altered and adapted to achieve better server load and message load distribution by a selective search and look-up mechanism in this proposal. In addition, a fault tolerance mechanism is also expressed in this contribution, as part of the DST’s adaptation, such that if the system which is providing the service fails or leaves the grid environment, then the backup site will immediately take up the execution and recover the task.http://eudl.eu/doi/10.4108/eai.19-6-2018.154826Grid computing systemsDistributed spanning treeResource selection |
| spellingShingle | J. Amudhavel V. Agalya T. Dhivya V. Vijayakumar S. Keerthana A. Dhamayanthi B. Bhuvaneswari Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing EAI Endorsed Transactions on Scalable Information Systems Grid computing systems Distributed spanning tree Resource selection |
| title | Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing |
| title_full | Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing |
| title_fullStr | Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing |
| title_full_unstemmed | Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing |
| title_short | Selective lookup and intercommunication in grid (SLIG) adapting the distributed spanning tree to grid computing |
| title_sort | selective lookup and intercommunication in grid slig adapting the distributed spanning tree to grid computing |
| topic | Grid computing systems Distributed spanning tree Resource selection |
| url | http://eudl.eu/doi/10.4108/eai.19-6-2018.154826 |
| work_keys_str_mv | AT jamudhavel selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing AT vagalya selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing AT tdhivya selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing AT vvijayakumar selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing AT skeerthana selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing AT adhamayanthi selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing AT bbhuvaneswari selectivelookupandintercommunicationingridsligadaptingthedistributedspanningtreetogridcomputing |