Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15826
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBurke, Edmund-
dc.contributor.authorDror, Moshe-
dc.contributor.authorOrlin, James B-
dc.date.accessioned2018-02-15T04:19:41Z-
dc.date.issued2008-03-
dc.identifier.urihttp://hdl.handle.net/1893/15826-
dc.description.abstractIn this short paper, we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problemsen_UK
dc.language.isoen-
dc.publisherElsevier-
dc.relationBurke E, Dror M & Orlin JB (2008) Scheduling malleable tasks with interdependent processing rates: Comments and observations, Discrete Applied Mathematics, 156 (5), pp. 620-626.-
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.-
dc.subjectParallel machinesen_UK
dc.subjectMalleable tasksen_UK
dc.titleScheduling malleable tasks with interdependent processing rates: Comments and observationsen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2999-12-31T00:00:00Z-
dc.rights.embargoreasonThe publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.-
dc.identifier.doihttp://dx.doi.org/10.1016/j.dam.2007.08.008-
dc.citation.jtitleDiscrete Applied Mathematics-
dc.citation.issn0166-218X-
dc.citation.volume156-
dc.citation.issue5-
dc.citation.spage620-
dc.citation.epage626-
dc.citation.publicationstatusPublished-
dc.citation.peerreviewedRefereed-
dc.type.statusPublisher version (final published refereed version)-
dc.author.emaile.k.burke@stir.ac.uk-
dc.contributor.affiliationComputing Science and Mathematics-
dc.contributor.affiliationUniversity of Arizona-
dc.contributor.affiliationMassachusetts Institute of Technology-
dc.rights.embargoterms2999-12-31-
dc.rights.embargoliftdate2999-12-31-
dc.identifier.isi000254161000007-
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
Scheduling malleable tasks with interdependent processing rates.pdf118.78 kBAdobe PDFUnder Permanent Embargo    Request a copy


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.