完整後設資料紀錄
DC 欄位語言
dc.contributor.authorShih, Wei-Kuan
dc.contributor.authorWang, Huei-Long
dc.date.accessioned2009-06-02T06:20:46Z
dc.date.accessioned2020-05-25T06:36:45Z-
dc.date.available2009-06-02T06:20:46Z
dc.date.available2020-05-25T06:36:45Z-
dc.date.issued2006-10-25T06:13:19Z
dc.date.submitted2000-12-08
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/2490-
dc.description.abstractIn this paper, we study the problem of scheduling a set of tasks to minimize mean flow time. The tasks have equal processing time and are scheduled on two uniform processors. The faster processor is b times faster than the slower one. The schedule needs to satisfy the resource constraints, that is, there are r units of resources, all are of the same kind. At any instant, the total number of resources held by the tasks executed on both uniform processors is less than or equal to r. Tasks are not preemptive. We propose an O(n2) algorithm to find an asymptotically optimal schedule for this problem. Our algorithm can be extended to develop a good approximation algorithm for a multiprocessor system with arbitrary number of processors.
dc.description.sponsorship中正大學,嘉義縣
dc.format.extent8p.
dc.format.extent110070 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2000 ICS會議
dc.subject.otherCombinatorial Computing
dc.titleScheduling on two Uniform Processors with Resource Constraints to Minimize Mean Flow Time
分類:2000年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002000000008.pdf107.49 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。