完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, Chao-Tungen_US
dc.contributor.authorShih, Wen-Chungen_US
dc.contributor.authorTseng, Shian-Shyongen_US
dc.date.accessioned2014-12-08T15:12:21Z-
dc.date.available2014-12-08T15:12:21Z-
dc.date.issued2008-04-01en_US
dc.identifier.issn0920-8542en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s11227-007-0146-0en_US
dc.identifier.urihttp://hdl.handle.net/11536/9495-
dc.description.abstractLoop partitioning on parallel and distributed systems has been a critical problem. Furthermore, it becomes more difficult to deal with on the emerging heterogeneous PC cluster environments. In the past, some loop self-scheduling schemes have been proposed to be applicable to heterogeneous cluster environments. In this paper, we propose a performance-based approach, which partitions loop iterations according to the performance ratio of cluster nodes. To verify the proposed approach, a heterogeneous cluster is built, and three types of application programs are implemented to be executed in this testbed. Experimental results show that the proposed approach performs better than traditional schemes.en_US
dc.language.isoen_USen_US
dc.subjectparallel loopsen_US
dc.subjectself-schedulingen_US
dc.subjectcluster computingen_US
dc.subjectMPI programmingen_US
dc.subjectheterogeneousen_US
dc.subjectPC clustersen_US
dc.titleDynamic partitioning of loop iterations on heterogeneous PC clustersen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s11227-007-0146-0en_US
dc.identifier.journalJOURNAL OF SUPERCOMPUTINGen_US
dc.citation.volume44en_US
dc.citation.issue1en_US
dc.citation.spage1en_US
dc.citation.epage23en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000253523500001-
dc.citation.woscount12-
顯示於類別:期刊論文


文件中的檔案:

  1. 000253523500001.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。