Reputation Guided Genetic Scheduling Algorithm for Independent Tasks in Inter-clouds Environments

@article{Pop2013ReputationGG,
  title={Reputation Guided Genetic Scheduling Algorithm for Independent Tasks in Inter-clouds Environments},
  author={Florin Pop and Valentin Cristea and Nik Bessis and Stelios Sotiriadis},
  journal={2013 27th International Conference on Advanced Information Networking and Applications Workshops},
  year={2013},
  pages={772-776},
  url={https://api.semanticscholar.org/CorpusID:14518561}
}
  • Florin PopV. Cristea Stelios Sotiriadis
  • Published in 27th International Conference… 25 March 2013
  • Computer Science, Engineering
  • 2013 27th International Conference on Advanced Information Networking and Applications Workshops
A reputation guided genetic scheduling algorithm for independent tasks in inter-Clouds environments considering load-balancing as a way to measure the optimization impact for providers and maxspan as a metric for user performance is presented.
View on IEEE
doi.ieeecomputersociety.org
41 Citations
Background Citations
18
Methods Citations
8

Figures from this paper

41 Citations

Reputation-guided evolutionary scheduling algorithm for independent tasks in inter-clouds environments

Previous work with new optimisation heuristics for the problem of scheduling were extended and it was shown how reputation is considered as an optimisation metric, and how these metrics can be considered as upper bounds for others in the optimisation algorithm.

Elasticity Based Scheduling Heuristic Algorithm for Cloud Environments

The presented EBSH shows superior performance because of its ability to adapt to changes and is measured against the bio-inspired optimization algorithms such as Ant Colony Optimization and Honey Bee Optimization.

An enhancement of task scheduling in cloud computing based on imperialist competitive algorithm and firefly algorithm

The motivation of this research is proposing an intelligent meta-heuristic algorithm based on the combination of ICA and FA to get the mentioned required result and the obtained result showed dramatic improvements in makespan, CPU time, load balancing, stability and planning speed.

An Improved Genetic-Based Approach to Task Scheduling in Inter-cloud Environment

This paper improves the genetic algorithm by adopting Gene Space Balance Strategy (GSBS), which optimizes the generation of initial population, and proposes the multi-objective optimization task scheduling method in Inter-cloud.

Performance Analysis of Bio-Inspired Scheduling Algorithms for Cloud Environments

A comparative performance study on bio-inspired scheduling algorithms: Ant Colony Optimization and Honey Bee Optimization are presented and a networking scheduling algorithm, Random Biased Sampling, is also evaluated.

Scheduling of Independent Tasks in Cloud Computing Using Modified Genetic Algorithm

A genetic algorithm based scheduling approach is proposed in which initial population is generated with advance version of Max Min to get more optimize results, in terms of make span.

Nature inspired meta-heuristic algorithms for solving the load-balancing problem in cloud environments

Dynamic Task Scheduling using Genetic Algorithm in Private Cloud Environment

In this paper multi objective is been focused to maximize resource utilization, to minimize cost and time which gives optimized results and improved performance.

Review on Multiobjective Task Scheduling in Cloud Computing using Nature Inspired Algorithms

A survey as well as a comparative analysis of various existing nature inspired scheduling algorithms which are based on genetic algorithm and ant colony optimization algorithm are provided.

Comparative Analysis of Evolutionary Algorithms Based on Swarm Intelligence for QoS Optimization of Cloud Services

An analysis of state of the art evolutionary algorithm based on swarm intelligence for quality of service (QoS) in cloud computing by a large number of contrast experiments under different circumstances.

12 References

Enhancing the genetic-based scheduling in computational grids by a structured hierarchical population

Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments

Reputation Based Selection for Services in Cloud Environments

The papers present the possibility of enhancing the proposed solution in a real environment represented by a workflow engine based on Business Process Execution Language (BPEL), and the experimental results highlight the behavior of proposed reputation function and the comparison with other reputation functions.

A Novel State Transition Method for Metaheuristic-Based Scheduling in Heterogeneous Computing Systems

The proposed Duplication-based State Transition (DST) method is incorporated into three different metaheuristics: genetic algorithms (GAs), simulated annealing (SA), and artificial immune system (AISs) and experimental results confirm DST's promising impact on the performance of meta heuristics.

A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems

It is shown that for the cases studied here, the relatively simple Min?min heuristic performs well in comparison to the other techniques, and one even basis for comparison and insights into circumstances where one technique will out-perform another.

HIGA: Hybrid Immune - Genetic Algorithm for Dependent Task Scheduling in Large Scale Distributed Systems

An innovative solution based on a memetic algorihm that combines the advantages of both imuune and genetic algorithm is proposed that provides near-optimal solution by minimizing the make span (or schedule length).

Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues

This paper investigates an alternative paradigm, based on genetic algorithms, to efficiently solve the scheduling problem without the need to apply any restricted assumptions that are problem-specific, such is the case when using heuristics.

Scheduling Algorithms

Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity

    Tao XieX. Qin
    Computer Science, Engineering
    J. Parallel Distributed Comput.
  • 2007

Dynamic Scheduling and Fault-Tolerance: Specification and Verification

The paper demonstrates how to talk about dynamically scheduled programs in the framework of a timed process algebra and modal logic, establishing fault-tolerance in a distributed real-time program.