File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Extra processors versus future information in optimal deadline scheduling

TitleExtra processors versus future information in optimal deadline scheduling
Authors
KeywordsCompetitive analysis
Deadline scheduling
Online algorithms
Resource augmentation
Issue Date2002
PublisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00224/
Citation
Annual Acm Symposium On Parallel Algorithms And Architectures, 2002, p. 133-142 How to Cite?
AbstractThis paper is concerned with the extra-resource analysis of online scheduling algorithms. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work that are primarily based on using a faster processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot help.
Persistent Identifierhttp://hdl.handle.net/10722/48427
ISSN
2015 Impact Factor: 0.719
2015 SCImago Journal Rankings: 0.677
References

 

DC FieldValueLanguage
dc.contributor.authorKoo, CYen_HK
dc.contributor.authorLam, TWen_HK
dc.contributor.authorNgan, TWen_HK
dc.contributor.authorTo, KKen_HK
dc.date.accessioned2008-05-22T04:12:43Z-
dc.date.available2008-05-22T04:12:43Z-
dc.date.issued2002en_HK
dc.identifier.citationAnnual Acm Symposium On Parallel Algorithms And Architectures, 2002, p. 133-142en_HK
dc.identifier.issn1432-4350en_HK
dc.identifier.urihttp://hdl.handle.net/10722/48427-
dc.description.abstractThis paper is concerned with the extra-resource analysis of online scheduling algorithms. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work that are primarily based on using a faster processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot help.en_HK
dc.format.extent320134 bytes-
dc.format.extent3039 bytes-
dc.format.extent3039 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00224/en_HK
dc.relation.ispartofAnnual ACM Symposium on Parallel Algorithms and Architecturesen_HK
dc.rightsThe original publication is available at www.springerlink.comen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCompetitive analysisen_HK
dc.subjectDeadline schedulingen_HK
dc.subjectOnline algorithmsen_HK
dc.subjectResource augmentationen_HK
dc.titleExtra processors versus future information in optimal deadline schedulingen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1432-4350&volume=37&issue=3&spage=323&epage=341&date=2004&atitle=Extra+Processors+versus+Future+Information+in+Optimal+Deadline+Schedulingen_HK
dc.identifier.emailLam, TW:twlam@cs.hku.hken_HK
dc.identifier.authorityLam, TW=rp00135en_HK
dc.description.naturepostprinten_HK
dc.identifier.scopuseid_2-s2.0-0036948850en_HK
dc.identifier.hkuros91567-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036948850&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage133en_HK
dc.identifier.epage142en_HK
dc.identifier.scopusauthoridKoo, CY=7006652508en_HK
dc.identifier.scopusauthoridLam, TW=7202523165en_HK
dc.identifier.scopusauthoridNgan, TW=6602433224en_HK
dc.identifier.scopusauthoridTo, KK=36785812300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats