Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHOU, HCen_US
dc.contributor.authorCHUNG, CPen_US
dc.date.accessioned2014-12-08T15:04:04Z-
dc.date.available2014-12-08T15:04:04Z-
dc.date.issued1994-04-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://hdl.handle.net/11536/2569-
dc.description.abstractWe propose an optimization scheme for unit-execution-time task scheduling on multiprocessors. In this scheme, dominance, semi-dominance, equivalence and semi-equivalence relations between tasks are first defined. The solution tree technique is adopted to keep track of the unfinished sub-schedules. We prove that when certain conditions are satisfied, a sub-schedule need not be explored further, since it cannot lead to a schedule better than some others. An algorithm that avoids generating such non-optimal schedules is presented. Then we conduct experiments to show the promise of our scheme in reducing solution space. Another advantage of this scheme is its extensibility. This scheme can easily be applied to other scheduling problems by simply adding additional constraints to the original definitions of the dominance, semi-dominance, equivalence and semi-equivalence relations.en_US
dc.language.isoen_USen_US
dc.titleOPTIMAL MULTIPROCESSOR TASK-SCHEDULING USING DOMINANCE AND EQUIVALENCE-RELATIONSen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume21en_US
dc.citation.issue4en_US
dc.citation.spage463en_US
dc.citation.epage475en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1994MZ76900010-
dc.citation.woscount3-
Appears in Collections:Articles