Show simple item record

dc.contributor.advisorWu, Jie, 1961-
dc.creatorWan, Ziqi
dc.date.accessioned2020-11-05T19:50:35Z
dc.date.available2020-11-05T19:50:35Z
dc.date.issued2015
dc.identifier.other931912233
dc.identifier.urihttp://hdl.handle.net/20.500.12613/4013
dc.description.abstractCloud computing focuses on maximizing the effectiveness of the shared resources. Cloud resources are usually not only shared by multiple users but are also dynamically reallocated per demand. This can work for allocating resources to users. This leads to task scheduling as a core and challenging issue in cloud computing. This thesis gives different scheduling strategies and algorithms in cloud computing. For a common cloud user, there is a great potential to boost the performance of mobile devices by offloading computation-intensive parts of mobile applications to the cloud. However, this potential is hindered by a gap between how individual mobile devices demand computational resources and how cloud providers offer them. In this thesis, we present the design of utility-based uploads sharing strategy in cloud scenarios, which bridges the above gap through providing computation offloading as a service to mobile devices. Our scheme efficiently manages cloud resources for offloading requests to improve offloading performances of mobile devices, as well as to reduce the monetary cost per request of the provider. However, from the viewpoint of data centers, resource limitations in both bandwidth and computing triggers a variety of resource management problems. In this thesis, we discuss the tradeoff between locality and load balancing, along with the multi-layer topology of data centers. After that, we investigate the interrelationship between the time cost and the virtual machine rent cost, and formalize it as the parallel speedup pattern. We then design several algorithms by adopting the idea of minimizing the utility cost. Furthermore, we focus on the detail of MapReduce framework in Cloud. For different MapReduce phases, there are different resource requirements. We propose a new scheduling algorithm based on the idea of combining map shuffle pairs, which has better performance than the popular min-max time first algorithm in minimizing the average makespan of tasks in the job matrix. Directions for future research mainly focus on the large scale implementation of our proposed solution. There are a wide variety of open questions remaining with respect to the design of algorithms to minimize response time. Further, it is interesting and important to understand how to schedule in order to minimize other performance metrics.
dc.format.extent106 pages
dc.language.isoeng
dc.publisherTemple University. Libraries
dc.relation.ispartofTheses and Dissertations
dc.rightsIN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available.
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectComputer Science
dc.titleScheduling Policies for Cloud Computing
dc.typeText
dc.type.genreThesis/Dissertation
dc.contributor.committeememberJi, Bo, 1982-
dc.contributor.committeememberTan, Chiu C.
dc.description.departmentComputer and Information Science
dc.relation.doihttp://dx.doi.org/10.34944/dspace/3995
dc.ada.noteFor Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
dc.description.degreeM.S.
refterms.dateFOA2020-11-05T19:50:35Z


Files in this item

Thumbnail
Name:
TETDEDXWan-temple-0225M-12122.pdf
Size:
9.828Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record