Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Supercomput

Search In Journal Title:

Abbravation: The Journal of Supercomputing

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s11227-014-1373-9

Search In DOI:

ISSN

1573-0484

Search In ISSN:
Search In Title Of Papers:

A hyperheuristic approach for resource provisioni

Authors: Rajni Aron Inderveer Chana Ajith Abraham
Publish Date: 2015/01/20
Volume: 71, Issue: 4, Pages: 1427-1450
PDF Link

Abstract

Grid computing being immensely based on the concept of resource sharing has always been closely associated with a lot many challenges Growth of Resource provisioningbased scheduling in largescale distributed environments like Grid computing brings in new requirement challenges that are not being considered in traditional distributed computing environments Resources being the backbone of the system their efficient management plays quite an important role in its execution environment Many constraints such as heterogeneity and dynamic nature of resources need to be taken care as steps toward managing Grid resources efficiently The most important challenge in Grids being the job–resource mapping as per the users’ requirement in the most secure way The mapping of the jobs to appropriate resources for execution of the applications in Grid computing is found to be an NPcomplete problem Novel algorithm is required to schedule the jobs on the resources to provide reduced execution time increased security and reliability The main aim of this paper is to present an efficient strategy for secure scheduling of jobs on appropriate resources A novel particle swarm optimizationbased hyperheuristic resource scheduling algorithm has been designed and used to schedule jobs effectively on available resources without violating any of the security norms Performance of the proposed algorithm has also been evaluated through the GridSim toolkit We have compared our resource scheduling algorithm with existing common heuristicbased scheduling algorithms experimentally The results thus obtained have shown a better performance by our algorithm than the existing algorithms in terms of giving more reduced cost and makespan of user’s application being submitted to the GridsWe would like to thank all anonymous reviewers for their comments and suggestions for improving the paper We would like to thank Parteek Gupta for helping in improving the language and expression of a preliminary version of this paper We are also grateful to the Grid Workloads Archive group for making the Grid workload traces available We also thank Dr Dror Feitelson for maintaining the Parallel Workload Archive and all organizations and researchers who made their workload logs available

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Fault-tolerant broadcast in anonymous systems
  2. Constructing data supply chain based on layered PROV
  3. A localization algorithm for large scale mobile wireless sensor networks: a learning approach
  4. Comment on “A general model for long-tailed network traffic approximation”
  5. Direct private query in location-based services with GPU run time analysis
  6. A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem
  7. GPU-based parallel genetic approach to large-scale travelling salesman problem
  8. SENFIS: a Sensor Node File System for increasing the scalability and reliability of Wireless Sensor Networks applications
  9. The panconnectivity and the pancycle-connectivity of the generalized base- b hypercube
  10. 3-Hierarchical resource management model on web grid service architecture
  11. Research challenges and perspectives on Wisdom Web of Things (W2T)
  12. A novel framework for social web forums’ thread ranking based on semantics and post quality features
  13. Conditional forwarding: simple flow control to increase adaptivity for fully adaptive routing algorithms
  14. A proposal on location data supplementing information transfer method over MANET
  15. A framework for SaaS software packages evaluation and selection with virtual team and BOCR of analytic network process
  16. Real-time blind audio source separation: performance assessment on an advanced digital signal processor
  17. High-efficient video compression for social multimedia distribution
  18. RCB: leakage-resilient authenticated encryption via re-keying
  19. A framework for efficient performance prediction of distributed applications in heterogeneous systems
  20. Reducing the search space by closure and simplification paradigms
  21. P2P resource searching with Cloning Random Walker assisted by Weakly Connected Dominating Set
  22. Cost and energy aware service provisioning for mobile client in cloud computing environment
  23. PerContRep: a practical reputation system for pervasive content services
  24. Task scheduling for heterogeneous computing systems
  25. Integrating 3D image descriptors of margin sharpness and texture on a GPU-optimized similar pulmonary nodule retrieval engine
  26. Exploring the speedups of embedded microprocessor systems utilizing a high-performance coprocessor data-path
  27. Tuning remote GPU virtualization for InfiniBand networks
  28. Energy efficient utilization of resources in cloud computing systems
  29. The election problem in asynchronous distributed systems with bounded faulty processes
  30. Dynamic-width reconfigurable parallel prefix circuits
  31. Editorial: special issue on parallel nature-inspired optimization
  32. Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
  33. Editorial of special section on advanced in high performance, algorithm, and framework for future computing
  34. Hierarchical multichannel-based integrated smart metering infrastructure
  35. A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
  36. Distributed identification of the lineality space of a cone
  37. On studying business models in mobile social networks based on two-sided market (TSM)
  38. Reconfiguration process and routing management for service platforms
  39. Scheduling array redistribution with virtual channel support
  40. A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets
  41. A rhythm-based access control system for secure wellness services
  42. A novel Adaptive Cluster Transformation (ACT)-based intrusion tolerant architecture for hybrid information technology
  43. Panconnectivity of Cartesian product graphs
  44. Efficient search algorithms for RNAi target detection
Search Result: