In recent years, Cloud computing has been developed and become the foundation of a wide range applications. It allows users to access catalog standardized services respond their business needs flexibly adaptively, in event unforeseen demands, paying solely for consumption they have made. Task scheduling problem is considered one most critical cloud challenges. The refers how reasonably order al...

The main intent of the cloud computing to provide utilities demands users that are booming day by day. To meet requirements, existing scheduling algorithms focus on improving performance and neglecting energy consumed fulfill those demands. Hence, we propose a new Hybrid Scheduling Algorithm (HS) which is based Genetic (GA) Flower Pollination (FPA) for environments. proposed algorithm has surpa...

In this paper we implement the EDF-VD (Earliest Deadline First with Virtual Deadline) algorithm described in [1] for scheduling mixed-criticality, realtime task systems on preemptive uniprocessor platforms. We compare the scheduling overheads of this algorithm with the scheduling overheads of the well known EDF (Earliest Deadline First) algorithm for scheduling realtime task systems on preempti...