Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/39955
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | - |
| dc.creator | Lin, W | - |
| dc.creator | Chen, W | - |
| dc.creator | Li, Z | - |
| dc.creator | Zheng, W | - |
| dc.date.accessioned | 2016-05-17T10:08:39Z | - |
| dc.date.available | 2016-05-17T10:08:39Z | - |
| dc.identifier.issn | 1007-0214 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/39955 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Tsinghua University | en_US |
| dc.rights | © 2001 China Academic Journal Electronic Publishing House. It is to be used strictly for educational and research use. | en_US |
| dc.rights | © 2001 中国学术期刊电子杂志出版社。本内容的使用仅限于教育、科研之目的。 | en_US |
| dc.subject | SMP cluster | en_US |
| dc.subject | Communication optimization | en_US |
| dc.subject | Task scheduling | en_US |
| dc.title | Communication optimization for SMP clusters | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 18 | - |
| dc.identifier.epage | 23, 41 | - |
| dc.identifier.volume | 6 | - |
| dc.identifier.issue | 1 | - |
| dcterms.abstract | Shared Memory Processors (SMP) workstation clusters are becoming more and more popular. To optimize communication between the workstations, a new graph partition problem was developed to schedule tasks in SMP clusters. The problem is NP-complete and a heuristic algorithm was developed based on Lee, Kim and Park’s algorithm. Experimental results indicate that our algorithm outperforms theirs, especially when the number of partitions is large. This algorithm can be integrated in a parallelizing compiler as a back end optimizer for the distributed code generator. | - |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Tsinghua science and technology (清华大学学报自然科学版) (英文版), 2001, v. 6, no. 1, p. 18-23, 41 | - |
| dcterms.isPartOf | Tsinghua science and technology (清华大学学报自然科学版) (英文版) | - |
| dcterms.issued | 2001 | - |
| dc.identifier.rosgroupid | r02787 | - |
| dc.description.ros | 2000-2001 > Academic research: refereed > Publication in refereed journal | - |
| dc.description.oa | Version of Record | en_US |
| dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
| dc.description.pubStatus | Published | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| r02787.pdf | 215.13 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
119
Last Week
1
1
Last month
Citations as of Apr 21, 2024
Downloads
34
Citations as of Apr 21, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.