CASIA OpenIR  > 国家专用集成电路设计工程技术研究中心
多级划分算法的后处理与评价方法
蒿杰; 彭思龙; HAOJie; PENGSi-long,
Source Publication小型微型计算机系统,
2010
Volume31(1)Issue:1Pages:160-163
Abstract多级划分算法需要进行多次实验以得到最优值.本文根据网表顶点在多次实验中的倾向性将其分为:活跃点、固定点和亚固定点,并提出只对活跃点重新划分的后处理方法.另外,通过将固定点和亚固定点分配到相应簇中,得到一种算法评价方法.实验表明,本文的后处理方法可有效减小hMetis算法的最小割,而评价方法能够客观评价hMetis算法在不同聚类策略下的划分结果.
Other AbstractAbstract:Multilevelpartitioningalgorithm obtainsanoptimalsolutionfrom alotofexperiments.Accordingtothetendencyofverticesinallexperiments,
verticesareclassifiedintothreecategories:activevertices, fixedverticesandsemi-fixedvertices.Wepropose
apost-processingmethodbyre-partitioningonlyforactivevertices.Besides, byassigningfixedverticesandsemi-fixedverticestothe
correspondingclusters, wecanobtainanevaluationmethodforpartitioningalgorithm.Experimentshowsthatourpost-processing
methodcaneffectivelyreducethemin-cutofhMetisalgorithm.Inaddition, weobjectivelyevaluatetheresultofhMetisalgorithm
withdifferentclusteringstrategies.
Keyword多级划分算法 / 收敛性 / 后处理 / 超图 / 超大规模集成电路
Document Type期刊论文
Identifierhttp://ir.ia.ac.cn/handle/173211/12248
Collection国家专用集成电路设计工程技术研究中心
Corresponding Author蒿杰
Recommended Citation
GB/T 7714
蒿杰,彭思龙,HAOJie,等. 多级划分算法的后处理与评价方法[J]. 小型微型计算机系统,,2010,31(1)(1):160-163.
APA 蒿杰,彭思龙,HAOJie,&PENGSi-long,.(2010).多级划分算法的后处理与评价方法.小型微型计算机系统,,31(1)(1),160-163.
MLA 蒿杰,et al."多级划分算法的后处理与评价方法".小型微型计算机系统, 31(1).1(2010):160-163.
Files in This Item: Download All
File Name/Size DocType Version Access License
多级划分算法的后处理与评价方法_蒿杰.p(161KB)期刊论文作者接受稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[蒿杰]'s Articles
[彭思龙]'s Articles
[HAOJie]'s Articles
Baidu academic
Similar articles in Baidu academic
[蒿杰]'s Articles
[彭思龙]'s Articles
[HAOJie]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[蒿杰]'s Articles
[彭思龙]'s Articles
[HAOJie]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 多级划分算法的后处理与评价方法_蒿杰.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

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