File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Design and analysis of online batching systems

TitleDesign and analysis of online batching systems
Authors
KeywordsCompetitive analysis
Online algorithms
Online batching systems
Scheduling
Issue Date2010
PublisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00453/index.htm
Citation
Algorithmica (New York), 2010, v. 57 n. 2, p. 217-231 How to Cite?
AbstractIn this paper, we study the design and analysis of online batching systems, which can be used to model many popular IT systems such as the Video-On-Demand system and the Pull-based Data Dissemination system. We analyze how the start-up delay affects the performance of these systems and investigate the tradeoff relationship between the number of servers and the length of the start-up delay. We also study a simple online algorithm for scheduling online batching systems. By deriving close lower and upper bounds, we prove that our algorithm is near optimal. © 2008 Springer Science+Business Media, LLC.
Persistent Identifierhttp://hdl.handle.net/10722/127360
ISSN
2015 Impact Factor: 0.795
2015 SCImago Journal Rankings: 0.898
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong RGCHKU-7045/02E
Funding Information:

This research was supported in part by Hong Kong RGC Grant HKU-7045/02E.

References

 

DC FieldValueLanguage
dc.contributor.authorHung, RYSen_HK
dc.contributor.authorTing, HFen_HK
dc.date.accessioned2010-10-31T13:21:02Z-
dc.date.available2010-10-31T13:21:02Z-
dc.date.issued2010en_HK
dc.identifier.citationAlgorithmica (New York), 2010, v. 57 n. 2, p. 217-231en_HK
dc.identifier.issn0178-4617en_HK
dc.identifier.urihttp://hdl.handle.net/10722/127360-
dc.description.abstractIn this paper, we study the design and analysis of online batching systems, which can be used to model many popular IT systems such as the Video-On-Demand system and the Pull-based Data Dissemination system. We analyze how the start-up delay affects the performance of these systems and investigate the tradeoff relationship between the number of servers and the length of the start-up delay. We also study a simple online algorithm for scheduling online batching systems. By deriving close lower and upper bounds, we prove that our algorithm is near optimal. © 2008 Springer Science+Business Media, LLC.en_HK
dc.languageengen_HK
dc.publisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00453/index.htmen_HK
dc.relation.ispartofAlgorithmica (New York)en_HK
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectCompetitive analysisen_HK
dc.subjectOnline algorithmsen_HK
dc.subjectOnline batching systemsen_HK
dc.subjectSchedulingen_HK
dc.titleDesign and analysis of online batching systemsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0178-4617&volume=57&issue=2&spage=217&epage=231&date=2010&atitle=Design+and+analysis+of+online+batching+systemsen_HK
dc.identifier.emailTing, HF:hfting@cs.hku.hken_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s00453-008-9201-3en_HK
dc.identifier.scopuseid_2-s2.0-77949265571en_HK
dc.identifier.hkuros178823en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77949265571&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume57en_HK
dc.identifier.issue2en_HK
dc.identifier.spage217en_HK
dc.identifier.epage231en_HK
dc.identifier.eissn1432-0541-
dc.identifier.isiWOS:000274140400002-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridHung, RYS=14028462000en_HK
dc.identifier.scopusauthoridTing, HF=7005654198en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats