Distributed data access/find system with metadata for data-intensive computing

Author(s):  
Minoru Ikebe ◽  
Atsuo Inomata ◽  
Kazutoshi Fujikawa ◽  
Hideki Sunahara
2013 ◽  
Vol 29 (3) ◽  
pp. 739-750 ◽  
Author(s):  
Lizhe Wang ◽  
Jie Tao ◽  
Rajiv Ranjan ◽  
Holger Marten ◽  
Achim Streit ◽  
...  

2019 ◽  
Vol 8 (3) ◽  
pp. 7440-7446

In the distributed data-intensive computing environment, relegating certain assignments to specific machines in a protected way is a major test for the employment planning issue. The unpredictability of this issue increments with the size of the activity and it is hard to understand viably. A few metaheuristic calculations including particle swarm optimization (PSO) strategy and variable neighborhood particle swarm optimization VNPSO) system are utilized to tackle the employment planning issue in distributed computing. While allocating assignments to the machines, to fulfill the security requirements and to limit the cost capacity, we proposed an altered PSO with a scout adjustment (MPSO-SA) calculation which utilized a cyclic term called change administrator to get the best cost capacity. The exhibition of the proposed MPSO-SA booking component is contrasted and the Genetic calculation (GA), PSO and VNPSO systems and the exploratory outcome demonstrate that the proposed technique diminishes the likelihood of hazard with security requirements and it has preferable intermingling property over the current conventions.


Sign in / Sign up

Export Citation Format

Share Document