A Distributed Bio-Inspired Method for Multisite Grid Mapping
Computational grids assemble multisite and multiowner resources and represent the most promising solutions for processing distributed computationally intensive applications, each composed by a collection of communicating tasks. The execution of an application on a grid presumes three successive step...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2010-01-01
|
| Series: | Applied Computational Intelligence and Soft Computing |
| Online Access: | http://dx.doi.org/10.1155/2010/505194 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850210660226433024 |
|---|---|
| author | I. De Falco A. Della Cioppa U. Scafuri E. Tarantino |
| author_facet | I. De Falco A. Della Cioppa U. Scafuri E. Tarantino |
| author_sort | I. De Falco |
| collection | DOAJ |
| description | Computational grids assemble multisite and multiowner resources and represent the most promising solutions for processing distributed computationally intensive applications, each composed by a collection of communicating tasks. The execution of an application on a grid presumes three successive steps: the localization of the available resources together with their characteristics and status; the mapping which selects the resources that, during the estimated running time, better support this execution and, at last, the scheduling of the tasks. These operations are very difficult both because the availability and workload of grid resources change dynamically and because, in many cases, multisite mapping must be adopted to exploit all the possible benefits. As the mapping problem in parallel systems, already known as NP-complete, becomes even harder in distributed heterogeneous environments as in grids, evolutionary techniques can be adopted to find near-optimal solutions. In this paper an effective and efficient multisite mapping, based on a distributed Differential Evolution algorithm, is proposed. The aim is to minimize the time required to complete the execution of the application, selecting from among all the potential ones the solution which reduces the use of the grid resources. The proposed mapper is tested on different scenarios. |
| format | Article |
| id | doaj-art-90a52f68e23c4ca2b0ad68b8b6d7307e |
| institution | OA Journals |
| issn | 1687-9724 1687-9732 |
| language | English |
| publishDate | 2010-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Applied Computational Intelligence and Soft Computing |
| spelling | doaj-art-90a52f68e23c4ca2b0ad68b8b6d7307e2025-08-20T02:09:44ZengWileyApplied Computational Intelligence and Soft Computing1687-97241687-97322010-01-01201010.1155/2010/505194505194A Distributed Bio-Inspired Method for Multisite Grid MappingI. De Falco0A. Della Cioppa1U. Scafuri2E. Tarantino3Institute of High Performance Computing and Networking, National Research Council of Italy, Via P. Castellino 111, 80131 Naples, ItalyNatural Computation Laboratory, DIIIE, University of Salerno, Via Ponte don Melillo 1, 84084 Fisciano (SA), ItalyInstitute of High Performance Computing and Networking, National Research Council of Italy, Via P. Castellino 111, 80131 Naples, ItalyInstitute of High Performance Computing and Networking, National Research Council of Italy, Via P. Castellino 111, 80131 Naples, ItalyComputational grids assemble multisite and multiowner resources and represent the most promising solutions for processing distributed computationally intensive applications, each composed by a collection of communicating tasks. The execution of an application on a grid presumes three successive steps: the localization of the available resources together with their characteristics and status; the mapping which selects the resources that, during the estimated running time, better support this execution and, at last, the scheduling of the tasks. These operations are very difficult both because the availability and workload of grid resources change dynamically and because, in many cases, multisite mapping must be adopted to exploit all the possible benefits. As the mapping problem in parallel systems, already known as NP-complete, becomes even harder in distributed heterogeneous environments as in grids, evolutionary techniques can be adopted to find near-optimal solutions. In this paper an effective and efficient multisite mapping, based on a distributed Differential Evolution algorithm, is proposed. The aim is to minimize the time required to complete the execution of the application, selecting from among all the potential ones the solution which reduces the use of the grid resources. The proposed mapper is tested on different scenarios.http://dx.doi.org/10.1155/2010/505194 |
| spellingShingle | I. De Falco A. Della Cioppa U. Scafuri E. Tarantino A Distributed Bio-Inspired Method for Multisite Grid Mapping Applied Computational Intelligence and Soft Computing |
| title | A Distributed Bio-Inspired Method for Multisite Grid Mapping |
| title_full | A Distributed Bio-Inspired Method for Multisite Grid Mapping |
| title_fullStr | A Distributed Bio-Inspired Method for Multisite Grid Mapping |
| title_full_unstemmed | A Distributed Bio-Inspired Method for Multisite Grid Mapping |
| title_short | A Distributed Bio-Inspired Method for Multisite Grid Mapping |
| title_sort | distributed bio inspired method for multisite grid mapping |
| url | http://dx.doi.org/10.1155/2010/505194 |
| work_keys_str_mv | AT idefalco adistributedbioinspiredmethodformultisitegridmapping AT adellacioppa adistributedbioinspiredmethodformultisitegridmapping AT uscafuri adistributedbioinspiredmethodformultisitegridmapping AT etarantino adistributedbioinspiredmethodformultisitegridmapping AT idefalco distributedbioinspiredmethodformultisitegridmapping AT adellacioppa distributedbioinspiredmethodformultisitegridmapping AT uscafuri distributedbioinspiredmethodformultisitegridmapping AT etarantino distributedbioinspiredmethodformultisitegridmapping |