DC Field | Value | Language |
---|---|---|
dc.contributor.author | O.H. Kwon | ko |
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.date.accessioned | 2013-02-27T15:04:31Z | - |
dc.date.available | 2013-02-27T15:04:31Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1998-01 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.9, no.9, pp.856 - 860 | - |
dc.identifier.issn | 1045-9219 | - |
dc.identifier.uri | http://hdl.handle.net/10203/69235 | - |
dc.description.abstract | In this paper, we consider the problem of nonpreemptively scheduling independent jobs so as to minimize overall finish time on an m-dimensional hypercube system. This problem is NP-hard. We propose a polynomial time approximation algorithm and prove that the absolute performance ratio of the algorithm does not exceed 1.875. This is the first algorithm achieving an absolute performance ratio less than two by a constant. | - |
dc.language | English | - |
dc.publisher | IEEE Computer Soc | - |
dc.title | An Algorithm for Scheduling Jobs in Hypercube System | - |
dc.type | Article | - |
dc.identifier.wosid | 000076179000003 | - |
dc.identifier.scopusid | 2-s2.0-0032163144 | - |
dc.type.rims | ART | - |
dc.citation.volume | 9 | - |
dc.citation.issue | 9 | - |
dc.citation.beginningpage | 856 | - |
dc.citation.endingpage | 860 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.contributor.nonIdAuthor | O.H. Kwon | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | hypercube systems | - |
dc.subject.keywordAuthor | job scheduling | - |
dc.subject.keywordAuthor | subcube allocation | - |
dc.subject.keywordAuthor | approximation algorithm | - |
dc.subject.keywordAuthor | absolute performance ratio | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.