在高层次综合中,时变与固定加速度系数的粒子群驱动勘探:性能和质量评估

A. Sengupta, V. Mishra
{"title":"在高层次综合中,时变与固定加速度系数的粒子群驱动勘探:性能和质量评估","authors":"A. Sengupta, V. Mishra","doi":"10.1109/ICIT.2014.16","DOIUrl":null,"url":null,"abstract":"The performance of particle swarm optimization (PSO) greatly depends upon the effective selection of vital tuning metric known as acceleration coefficients (especially when applied to design space exploration (DSE) problem) which incorporates ability to clinically balance between exploration and exploitation during searching. The major contributions of the paper are as follows: a) A novel analysis of two variants of acceleration coefficient (hierarchical time varying acceleration coefficient vs. Constant acceleration coefficient) in PSO and their impact on convergence time and exploration time in context of multi objective (MO) DSE in HLS. The analysis assists the designer in pre-tuning the acceleration coefficient to an optimal value for achieving better convergence and exploration time before DSE initiation, b) A novel performance comparison of PSO driven DSE (PSO-DSE) with previous works based on quality metrics for MO evolutionary algorithms such as generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric. When two variants of acceleration coefficients (constant and time varying) were compared, it was revealed from the results that the PSO-DSE has on average 9.5% better exploration speed with constant acceleration coefficient as compared to hierarchical time varying acceleration coefficient. Further, with setting of constant acceleration coefficient, the PSO-DSE produces results with efficient generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric as compared to previous approaches.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"281-286"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Time Varying vs. Fixed Acceleration Coefficient PSO Driven Exploration during High Level Synthesis: Performance and Quality Assessment\",\"authors\":\"A. Sengupta, V. Mishra\",\"doi\":\"10.1109/ICIT.2014.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of particle swarm optimization (PSO) greatly depends upon the effective selection of vital tuning metric known as acceleration coefficients (especially when applied to design space exploration (DSE) problem) which incorporates ability to clinically balance between exploration and exploitation during searching. The major contributions of the paper are as follows: a) A novel analysis of two variants of acceleration coefficient (hierarchical time varying acceleration coefficient vs. Constant acceleration coefficient) in PSO and their impact on convergence time and exploration time in context of multi objective (MO) DSE in HLS. The analysis assists the designer in pre-tuning the acceleration coefficient to an optimal value for achieving better convergence and exploration time before DSE initiation, b) A novel performance comparison of PSO driven DSE (PSO-DSE) with previous works based on quality metrics for MO evolutionary algorithms such as generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric. When two variants of acceleration coefficients (constant and time varying) were compared, it was revealed from the results that the PSO-DSE has on average 9.5% better exploration speed with constant acceleration coefficient as compared to hierarchical time varying acceleration coefficient. Further, with setting of constant acceleration coefficient, the PSO-DSE produces results with efficient generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric as compared to previous approaches.\",\"PeriodicalId\":6486,\"journal\":{\"name\":\"2014 17th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"1 1\",\"pages\":\"281-286\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 17th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2014.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 17th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2014.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

粒子群优化算法(PSO)的性能在很大程度上取决于加速系数这一重要调节指标的有效选择(特别是在设计空间探索(DSE)问题中),该指标在搜索过程中包含了在探索和利用之间进行临床平衡的能力。本文的主要贡献如下:a)新颖地分析了PSO中两种加速度系数(分层时变加速度系数和恒定加速度系数)的变化及其对HLS多目标DSE下收敛时间和探索时间的影响。该分析有助于设计者在DSE启动前将加速系数预先调整到最优值,以实现更好的收敛和探索时间。b)基于代距、最大帕累托最优前误差、间隔、扩散和加权度量等MO进化算法的质量指标,将PSO驱动的DSE (PSO-DSE)与先前的研究进行了新的性能比较。将两种加速度系数(恒定和时变)进行比较,结果表明,恒定加速度系数下的PSO-DSE比分层时变加速度系数下的平均勘探速度高9.5%。此外,在恒定加速度系数的条件下,PSO-DSE算法的代距、最大帕累托最优前误差、间隔、扩展和加权度量均优于以往的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Time Varying vs. Fixed Acceleration Coefficient PSO Driven Exploration during High Level Synthesis: Performance and Quality Assessment
The performance of particle swarm optimization (PSO) greatly depends upon the effective selection of vital tuning metric known as acceleration coefficients (especially when applied to design space exploration (DSE) problem) which incorporates ability to clinically balance between exploration and exploitation during searching. The major contributions of the paper are as follows: a) A novel analysis of two variants of acceleration coefficient (hierarchical time varying acceleration coefficient vs. Constant acceleration coefficient) in PSO and their impact on convergence time and exploration time in context of multi objective (MO) DSE in HLS. The analysis assists the designer in pre-tuning the acceleration coefficient to an optimal value for achieving better convergence and exploration time before DSE initiation, b) A novel performance comparison of PSO driven DSE (PSO-DSE) with previous works based on quality metrics for MO evolutionary algorithms such as generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric. When two variants of acceleration coefficients (constant and time varying) were compared, it was revealed from the results that the PSO-DSE has on average 9.5% better exploration speed with constant acceleration coefficient as compared to hierarchical time varying acceleration coefficient. Further, with setting of constant acceleration coefficient, the PSO-DSE produces results with efficient generational distance, maximum pareto-optimal front error, spacing, spreading and weighted metric as compared to previous approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Android IR - Full-Text Search for Android Impurity Measurement in Selecting Decision Node Tree that Tolerate Noisy Cases A Comparative Study of IXP in Europe and US from a Complex Network Perspective Ensemble Features Selection Algorithm by Considering Features Ranking Priority User Independency of SSVEP Based Brain Computer Interface Using ANN Classifier: Statistical Approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1