An Empirical Investigation on the Simulation of Priority and Shortest-Job-First Scheduling for Cloud-Based Software Systems

Ru, Jia; Keung, Jacky

doi:10.1109/aswec.2013.19

Cited by 39 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Authors in papers [9] [12] submitted an investigation on the simulation of SJF scheduling algorithm based on priority in CCE. A comparative study is proposed [9] of SJF and an integrated grouping based scheduling algorithm with priorityaware features and SJF algorithm to reduce the makespan and turnaround time besides making the optimum resource utilization.…”

Section: Related Workmentioning

confidence: 99%

“…The characteristics of data-centre include IaaS features of the cloud [7] such as MIPS capacity of VMs, RAM size, bandwidth availability etc. Whereas algorithms that consider characteristics of cloudlets schedule them according to physical or non-physical requirements [4], for instance Service Level Agreement (SLA), Quality of Service (QoS) [8], memory or bandwidth requirements [9], application-specific requirements etc.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An empirical study of most fit, max-min and priority task scheduling algorithms in cloud computing

Taneja

2015

International Conference on Computing, Communication &Amp; Automation

View full text Add to dashboard Cite

Cloud computing is envisioned to provide each IT enabled service as a utility. From hardware to software, it is committed to fulfill all kind of needs with regard to computation, storage, development etc. at cost-effective and efficient manner. The efficient delivery of services in a cloud largely depends on how it schedules the user jobs (cloudlets) over its resources. A plenty of task scheduling algorithms are available for a cloud provider to choose from. This paper selects three most versatile and fundamental task scheduling algorithms i.e. Most Fit, MaxMin and Priority algorithm to study their comparative performance. From the practical aspect, these algorithms are simulated over cloudsim 3.0.3 toolkit with variable workload circumstances. A set of metrics is also calculated and a comparative assessment of the above mentioned algorithms has been done on the basis of these metrics.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

An empirical study of most fit, max-min and priority task scheduling algorithms in cloud computing

Taneja

2015

International Conference on Computing, Communication &Amp; Automation

View full text Add to dashboard Cite

show abstract

“…This algorithm reduced the makespan of the system. Another algorithm proposed by the authors of [15] is integrated with priority and SJF(Shortest job first) schemes and it reduced the waiting time and processing time by 30%.…”

Section: Related Workmentioning

confidence: 99%

Optimization of Task Scheduling Algorithm through QoS Parameters for Cloud Computing

Monika¹,

Jindal²

2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. Cloud computing is an incipient innovation which broadly spreads among analysts. It furnishes clients with foundation, stage and programming as enhancement which is easily available by means of web. A cloud is a sort of parallel and conveyed framework comprising of a gathering of virtualized PCs that are utilized to execute various tasks to accomplish good execution time, accomplish due date and usage of its assets. The scheduling issue can be seen as the finding an ideal task of assignments over the accessible arrangement of assets with the goal that we can accomplish the wanted objectives for tasks. This paper presents an optimal algorithm for scheduling tasks to get their waiting time as a QoS parameter. The algorithm is simulated using Cloudsim simulator and experiments are carried out to help clients to make sense of the bottleneck of utilizing no. of virtual machine parallely.

show abstract

“…Cloud Computing has emerged from the contribution of techniques from parallel computing, distributed computing and platform virtualization technologies [1]. It provides dynamic resource allocation and has become one of the main research fields in Software Engineering.…”

Section: Introductionmentioning

confidence: 99%

“…It offers benefits, as improved operational efficiency and reduced costs. As an instance, Salesforce.com 1 provides an SaaS for Customer Relationship Management. Salesforce uses a subscription revenue model and charges clients per user on a monthly basis.…”

Section: Introductionmentioning

confidence: 99%

A Systematic Mapping Study on the Multi-tenant Architecture of SaaS Systems

Pinto

Luz²,

Oliveira

et al. 2016

International Conferences on Software Engineering and Knowledge Engineering

View full text Add to dashboard Cite

Abstract-Background: SaaS (Software as a Service) is a services delivery model in Cloud Computing whose applications are remotely hosted by the service provider and available to customers on demand over the Internet. Multi-tenant Architecture (MTA) is an organizational pattern for SaaS that enables a single instance of an application to be hosted on the same hardware and accessed by multiple customers, so-called tenants, with the aim of lowering costs. Tenants are able to configure the system according to their particular needs. Objective: This research aims at the obtaining an overview of the challenges and research opportunities in MTA context for SaaS through a Systematic Mapping Study. Results: Eighty nine primary studies were selected for discussions on advances and opportunities for further investigations. The results showed the relevancy of MTA and pointed out the main research trends for next years in this topic.Cloud Computing; software as a service; multi-tenant architecture; systematic mapping study.

show abstract

An Empirical Investigation on the Simulation of Priority and Shortest-Job-First Scheduling for Cloud-Based Software Systems

Cited by 39 publications

References 13 publications

An empirical study of most fit, max-min and priority task scheduling algorithms in cloud computing

An empirical study of most fit, max-min and priority task scheduling algorithms in cloud computing

Optimization of Task Scheduling Algorithm through QoS Parameters for Cloud Computing

A Systematic Mapping Study on the Multi-tenant Architecture of SaaS Systems

Contact Info

Product

Resources

About