File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.tcs.2008.01.036
- Scopus: eid_2-s2.0-42149169630
- WOS: WOS:000256199100016
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Title | Competitive analysis of most-request-first for scheduling broadcasts with start-up delay |
---|---|
Authors | |
Keywords | Competitive analysis Lower bounds Non-preemptive scheduling On-demand data broadcasts Upper bounds |
Issue Date | 2008 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/tcs |
Citation | Theoretical Computer Science, 2008, v. 396 n. 1-3, p. 200-211 How to Cite? |
Abstract | In this paper, we give a tight and complete mathematical analysis of the Most-Request-First algorithm for scheduling on-demand broadcasts with start-up delay. The algorithm is natural and simple, yet its practical performance is surprisingly good. We derive tight upper and lower bounds on its competitive ratio under different system configurations. Our results reveal an interesting relationship between the start-up delay and the competitiveness of the algorithm. © 2008 Elsevier Ltd. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/88914 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 0.570 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hung, RYS | en_HK |
dc.contributor.author | Ting, HF | en_HK |
dc.date.accessioned | 2010-09-06T09:50:04Z | - |
dc.date.available | 2010-09-06T09:50:04Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.citation | Theoretical Computer Science, 2008, v. 396 n. 1-3, p. 200-211 | en_HK |
dc.identifier.issn | 0304-3975 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/88914 | - |
dc.description.abstract | In this paper, we give a tight and complete mathematical analysis of the Most-Request-First algorithm for scheduling on-demand broadcasts with start-up delay. The algorithm is natural and simple, yet its practical performance is surprisingly good. We derive tight upper and lower bounds on its competitive ratio under different system configurations. Our results reveal an interesting relationship between the start-up delay and the competitiveness of the algorithm. © 2008 Elsevier Ltd. All rights reserved. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/tcs | en_HK |
dc.relation.ispartof | Theoretical Computer Science | en_HK |
dc.rights | Theoretical Computer Science. Copyright © Elsevier BV. | en_HK |
dc.subject | Competitive analysis | en_HK |
dc.subject | Lower bounds | en_HK |
dc.subject | Non-preemptive scheduling | en_HK |
dc.subject | On-demand data broadcasts | en_HK |
dc.subject | Upper bounds | en_HK |
dc.title | Competitive analysis of most-request-first for scheduling broadcasts with start-up delay | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0304-3975&volume=361&issue=1-3&spage=200&epage=&date=2008&atitle=Competitive+analysis+of+most-request-first+for+scheduling+broadcasts+with+start-up+delay | en_HK |
dc.identifier.email | Ting, HF:hfting@cs.hku.hk | en_HK |
dc.identifier.authority | Ting, HF=rp00177 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.tcs.2008.01.036 | en_HK |
dc.identifier.scopus | eid_2-s2.0-42149169630 | en_HK |
dc.identifier.hkuros | 149512 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-42149169630&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 396 | en_HK |
dc.identifier.issue | 1-3 | en_HK |
dc.identifier.spage | 200 | en_HK |
dc.identifier.epage | 211 | en_HK |
dc.identifier.isi | WOS:000256199100016 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Hung, RYS=14028462000 | en_HK |
dc.identifier.scopusauthorid | Ting, HF=7005654198 | en_HK |
dc.identifier.issnl | 0304-3975 | - |