File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Extra processors versus future information in optimal deadline scheduling

TitleExtra processors versus future information in optimal deadline scheduling
Authors
Issue Date2004
PublisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00224/
Citation
Theory Of Computing Systems, 2004, v. 37 n. 3, p. 323-341 How to Cite?
AbstractThis paper is concerned with the design of online scheduling algorithms that exploit extra resources. 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.
Persistent Identifierhttp://hdl.handle.net/10722/152423
ISSN
2015 Impact Factor: 0.719
2015 SCImago Journal Rankings: 0.677
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorKoo, CYen_US
dc.contributor.authorLam, TWen_US
dc.contributor.authorNgan, TWen_US
dc.contributor.authorTo, KKen_US
dc.date.accessioned2012-06-26T06:38:23Z-
dc.date.available2012-06-26T06:38:23Z-
dc.date.issued2004en_US
dc.identifier.citationTheory Of Computing Systems, 2004, v. 37 n. 3, p. 323-341en_US
dc.identifier.issn1432-4350en_US
dc.identifier.urihttp://hdl.handle.net/10722/152423-
dc.description.abstractThis paper is concerned with the design of online scheduling algorithms that exploit extra resources. 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.en_US
dc.languageengen_US
dc.publisherSpringer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00224/en_US
dc.relation.ispartofTheory of Computing Systemsen_US
dc.titleExtra processors versus future information in optimal deadline schedulingen_US
dc.typeArticleen_US
dc.identifier.emailLam, TW:twlam@cs.hku.hken_US
dc.identifier.authorityLam, TW=rp00135en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/s00224-004-1116-zen_US
dc.identifier.scopuseid_2-s2.0-7444224774en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-7444224774&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume37en_US
dc.identifier.issue3en_US
dc.identifier.spage323en_US
dc.identifier.epage341en_US
dc.identifier.isiWOS:000220976400002-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridKoo, CY=7006652508en_US
dc.identifier.scopusauthoridLam, TW=7202523165en_US
dc.identifier.scopusauthoridNgan, TW=6602433224en_US
dc.identifier.scopusauthoridTo, KK=36785812300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats