Competitive analysis in deadline scheduling and broadcasting마감시간 스케줄링과 브로드캐스팅에서의 컴페티티브 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 689
  • Download : 0
In this thesis, we are concerned with competitive analysis used in various optimization problems, especially, in deadline scheduling and broadcasting. The competitive analysis provides a criterion to decide which algorithm is better. In particular, the algorithms do not have full information about the input instance in advance. A lot of algorithms face with this environment in practice. As a typical example, we may refer to online algorithms; as input data are given over time, the online algorithm makes decisions without any information about the data given in the future. In this environment, the performance of algorithms with partial information about the input instance is compared with that of the optimal algorithm with full information about the input instance. For the online algorithms, their performance is compared with that of the optimal offline algorithm, which knows all input data in advance and gives the optimal solution. This thesis deals with problems about two different topics; deadline scheduling and broadcasting. For deadline scheduling, we study online scheduling of jobs with deadlines. The goal is to maximize the total weight of jobs completed by their deadlines. First, we consider online preemptive and non-preemptive job scheduling depending on whether preemption for each job is allowed or not, respectively. The online scheduling algorithms, Earliest Deadline First(EDF) and Earliest EXpiration Time First(EXF), are investigated in a single machine and multiple machines setting. Also we apply the resource augmentation model to the problems, where the online algorithm can use faster machines than the optimal offline algorithm. Second, we consider the problem of scheduling broadcasts in data delivering systems via broadcast. In this problem, a number of requests for a data can be simultaneously satisfied by one broadcast of a server. The clients of requests may leave the system if their requests are still unsatisfied after waiting for some time, t...
Advisors
Chwa, Kyung-Yongresearcher좌경룡researcher
Description
한국과학기술원 : 전산학전공,
Publisher
한국과학기술원
Issue Date
2003
Identifier
181178/325007 / 000965805
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학전공, 2003.2, [ [iv], 73 p. ]

Keywords

competitive analysis; online algorithm; broadcasting; scheduling; broadcast scheduling; 브로드캐스트 스케줄링; 온라인 알고리즘; 컴페티티브 분석; 브로드캐스팅; 스케줄링

URI
http://hdl.handle.net/10203/32831
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=181178&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0