ISBN-13: 9783639766714 / Angielski / Miękka / 2015 / 76 str.
Scheduling of real time tasks on clouds is one of the research problem, Where the matching of machines and completion time of the tasks are considered. Cloud computing is an internet-based computing, where resources, softwares and information are shared on demand basis i.e. The user can access documents anytime, anywhere. Real-time computer systems are required to produce correct results not only in their values but also in the times at which the results are produced known as timeliness. Here a quantitative expression of time is used to describe the behavior of the system. Real-time task needs to meet their deadlines regardless of system load or makespan. This text discusses about scheduling of real time task on the cloud environment considering Basic Earliest deadline first (BEDF), FFE (first fit EDF), BFE (best fit EDF), WFE (Worst fit EDF) algorithms. Different performance parameters such as a guarantee ratio (GR), utilization of VMs (UV), throughput (TP) are used to measure the effectiveness of the algorithms
Scheduling of real time tasks on clouds is one of the research problem, Where the matching of machines and completion time of the tasks are considered. Cloud computing is an internet-based computing, where resources, softwares and information are shared on demand basis i.e. The user can access documents anytime, anywhere. Real-time computer systems are required to produce correct results not only in their values but also in the times at which the results are produced known as timeliness. Here a quantitative expression of time is used to describe the behavior of the system. Real-time task needs to meet their deadlines regardless of system load or makespan. This text discusses about scheduling of real time task on the cloud environment considering Basic Earliest deadline first (BEDF), FFE (first fit EDF), BFE (best fit EDF), WFE (Worst fit EDF) algorithms. Different performance parameters such as a guarantee ratio (GR), utilization of VMs (UV), throughput (TP) are used to measure the effectiveness of the algorithms