Please use this identifier to cite or link to this item:
Title: Communication optimization for SMP clusters
Authors: Lin, W
Chen, W
Li, Z
Zheng, W
Keywords: SMP cluster
Communication optimization
Task scheduling
Issue Date: 2001
Publisher: Tsinghua University
Source: Tsinghua science and technology (清华大学学报自然科学版) (英文版), 2001, v. 6, no. 1, p. 18-23, 41 How to cite?
Journal: Tsinghua science and technology (清华大学学报自然科学版) (英文版) 
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. 
ISSN: 1007-0214
Rights: © 2001 China Academic Journal Electronic Publishing House. It is to be used strictly for educational and research use.
© 2001 中国学术期刊电子杂志出版社。本内容的使用仅限于教育、科研之目的。
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
r02787.pdf215.13 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Mar 18, 2018


Citations as of Mar 18, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.