IIIT-Delhi Institutional Repository

Multiprocessor scheduling with rejections: theory and practice

Show simple item record

dc.contributor.author Gehlot, Gaurav
dc.contributor.author Das, Syamantak (Advisor)
dc.date.accessioned 2019-10-09T05:25:55Z
dc.date.available 2019-10-09T05:25:55Z
dc.date.issued 2019-04-25
dc.identifier.uri http://repository.iiitd.edu.in/xmlui/handle/123456789/765
dc.description.abstract We consider the classical on-line load balancing problem of temporary tasks under restricted assignments. Each job can be processed only on a subset of machines, different jobs require a different amounts of processing time, and once a job is assigned to a machine it cannot be reassigned to another machine. The on-line load balancing problem is to assign each job to an appropriate machine such that the maximum load on any machine at any point in time is minimized. Online algorithms are usually analyzed using the competitive ratio, which is de ned as the ratio of the solution obtained by the online algorithm to that obtained by an offline adversary for the worst possible input sequence. The measure of analyzing online algorithms using the notion of a competitive ratio is too bleak. Two popular approaches that have been used to deal with a variety of objective functions in case of scheduling problems have been that of "resource augmentation" [4] and "rejection model" [5]. In this project, our aim is to extend the work of Choudhury et al. [5] to the temporary job settings. As an initial result, we analyze the standard greedy approach in rejection model without late rejections and arrive at the result that the competitive ratio for any on-line greedy algorithm is at-least [(3m)2=3=4] and the upper bound for the same problem is [(3m)2=3=2](1+o(1)). Next, we consider the same problem and arrive at the result that any online algorithm would have a competitive ratio at-least ( p 2m=2). At last, we consider the same problem but this time with late rejections allowed and show that lower bound for this problem is at-least (1=" 􀀀 1) where " is the fraction of jobs which can be rejected. en_US
dc.language.iso en_US en_US
dc.publisher IIITD-Delhi en_US
dc.subject Jobs en_US
dc.subject Machines en_US
dc.subject Restricted assignments en_US
dc.subject load balancing en_US
dc.subject Rejection en_US
dc.subject Greedy en_US
dc.subject Algorithm en_US
dc.subject Bound en_US
dc.subject Competitive ratio en_US
dc.title Multiprocessor scheduling with rejections: theory and practice en_US
dc.type Other en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository

Advanced Search


My Account