Show simple item record

dc.contributor.supervisor Benkoczi, Robert
dc.contributor.author Nabi, Mahmudun
dc.contributor.author University of Lethbridge. Faculty of Arts and Science
dc.date.accessioned 2017-02-17T17:52:38Z
dc.date.available 2017-02-17T17:52:38Z
dc.date.issued 2016
dc.identifier.uri https://hdl.handle.net/10133/4779
dc.description.abstract In this thesis, we study the task scheduling problem in vehicular clouds. It falls in the category of unrelated parallel machine scheduling problems. Resource assignment in vehicular clouds must deal with the transient nature of the cloud resources and a relaxed definition of non-preemptive tasks. Despite a rich literature in machine scheduling and grid computing, the resource assignment problem in vehicular clouds has not been examined yet. We show that even the problem of finding a minimum cost schedule for a single task over unrelated machines is NP-hard. We then provide a fully polynomial time approximation scheme and a greedy approximation for scheduling a single task. We extend these algorithms to the case of scheduling n tasks. We validate our algorithms through extensive simulations that use synthetically generated data as well as real data extracted from vehicle mobility and grid computing workload traces. Our contributions are, to the best of our knowledge, the first quantitative analysis of the computational power of vehicular clouds. en_US
dc.language.iso en_US en_US
dc.publisher Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science en_US
dc.relation.ispartofseries Thesis (University of Lethbridge. Faculty of Arts and Science) en_US
dc.subject availability constraint en_US
dc.subject non-preemption en_US
dc.subject smart vehicles en_US
dc.subject task scheduling problems en_US
dc.subject vehicular resource utilization en_US
dc.title Resource assignment algorithms for vehicular clouds en_US
dc.type Thesis en_US
dc.publisher.faculty Arts and Science en_US
dc.publisher.department Department of Mathematics and Computer Science en_US
dc.degree.level Masters en_US
dc.proquest.subject 0984 en_US
dc.proquestyes Yes en_US
dc.embargo No en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record