Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/15826
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Burke, Edmund | - |
dc.contributor.author | Dror, Moshe | - |
dc.contributor.author | Orlin, James B | - |
dc.date.accessioned | 2018-02-15T04:19:41Z | - |
dc.date.issued | 2008-03 | - |
dc.identifier.uri | http://hdl.handle.net/1893/15826 | - |
dc.description.abstract | In 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 problems | en_UK |
dc.language.iso | en | - |
dc.publisher | Elsevier | - |
dc.relation | Burke 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.rights | The 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.subject | Parallel machines | en_UK |
dc.subject | Malleable tasks | en_UK |
dc.title | Scheduling malleable tasks with interdependent processing rates: Comments and observations | en_UK |
dc.type | Journal Article | en_UK |
dc.rights.embargodate | 2999-12-31T00:00:00Z | - |
dc.rights.embargoreason | The 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.doi | http://dx.doi.org/10.1016/j.dam.2007.08.008 | - |
dc.citation.jtitle | Discrete Applied Mathematics | - |
dc.citation.issn | 0166-218X | - |
dc.citation.volume | 156 | - |
dc.citation.issue | 5 | - |
dc.citation.spage | 620 | - |
dc.citation.epage | 626 | - |
dc.citation.publicationstatus | Published | - |
dc.citation.peerreviewed | Refereed | - |
dc.type.status | Publisher version (final published refereed version) | - |
dc.author.email | e.k.burke@stir.ac.uk | - |
dc.contributor.affiliation | Computing Science and Mathematics | - |
dc.contributor.affiliation | University of Arizona | - |
dc.contributor.affiliation | Massachusetts Institute of Technology | - |
dc.rights.embargoterms | 2999-12-31 | - |
dc.rights.embargoliftdate | 2999-12-31 | - |
dc.identifier.isi | 000254161000007 | - |
Appears in Collections: | Computing Science and Mathematics Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Scheduling malleable tasks with interdependent processing rates.pdf | 118.78 kB | Adobe PDF | Under 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.