完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Shih, WC | en_US |
dc.contributor.author | Yang, CT | en_US |
dc.contributor.author | Tseng, SS | en_US |
dc.date.accessioned | 2014-12-08T15:36:32Z | - |
dc.date.available | 2014-12-08T15:36:32Z | - |
dc.date.issued | 2005 | en_US |
dc.identifier.isbn | 3-540-29810-X | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/24879 | - |
dc.description.abstract | Efficient loop scheduling on parallel and distributed systems depends mostly on load balancing, especially on heterogeneous PC-based cluster and grid computing environments. In this paper, a general approach, named Performance-Based Parallel Loop Self-Scheduling (PPLSS), was given to partition workload according to performance of grid nodes. This approach was applied to three types of application programs, which were executed on a testbed grid. Experimental results showed that our approach could execute efficiently for most scheduling parameters when estimation of node performance was accurate. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | parallel loops | en_US |
dc.subject | loop scheduling | en_US |
dc.subject | self-scheduling | en_US |
dc.subject | grid computing | en_US |
dc.subject | globus | en_US |
dc.subject | MPI | en_US |
dc.title | A performance-based parallel loop self-scheduling on grid computing environments | en_US |
dc.type | Article; Proceedings Paper | en_US |
dc.identifier.journal | NETWORK AND PARALLEL COMPUTING, PROCEEDINGS | en_US |
dc.citation.volume | 3779 | en_US |
dc.citation.spage | 48 | en_US |
dc.citation.epage | 55 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000234857500007 | - |
顯示於類別: | 會議論文 |