{"title":"Mapping decisions by fuzzy inference","authors":"A. Sodan, V. Torra","doi":"10.1109/ICAPP.1997.651509","DOIUrl":null,"url":null,"abstract":"The approach presented is based on a system for mapping dynamic task tree-structures, such as occur in the relevant subfields of symbolic applications, to parallel machines. This mapping system provides multiple, and in many cases combinable, elementary strategies instead of a single universal one. The strategy configuration best matching the application characteristics, i.e. leading to optimal performance, can then be chosen. This requires establishing appropriate characteristics-oriented selection criteria that are expressive and precise enough to enable the compiler to find (close-to-)optimal configurations automatically. This paper focuses on the automatic-configuration aspect and presents the FiM system's solution to this task. FiM is implemented as a fuzzy-inference system, fuzziness allowing us to capture soft classifications of application characteristics and vague certainties or degrees of adequacy about the appropriateness of strategy selections. Existing approaches to fuzzy inference had to be extended to allow fuzzy multistage reasoning. The feasibility of the fuzzy-inference approach is shown. Though developed for mapping, the FiM approach can-using the corresponding selection rules-be applied to other configuration problems in multiple-strategy systems.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"11220 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1997.651509","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The approach presented is based on a system for mapping dynamic task tree-structures, such as occur in the relevant subfields of symbolic applications, to parallel machines. This mapping system provides multiple, and in many cases combinable, elementary strategies instead of a single universal one. The strategy configuration best matching the application characteristics, i.e. leading to optimal performance, can then be chosen. This requires establishing appropriate characteristics-oriented selection criteria that are expressive and precise enough to enable the compiler to find (close-to-)optimal configurations automatically. This paper focuses on the automatic-configuration aspect and presents the FiM system's solution to this task. FiM is implemented as a fuzzy-inference system, fuzziness allowing us to capture soft classifications of application characteristics and vague certainties or degrees of adequacy about the appropriateness of strategy selections. Existing approaches to fuzzy inference had to be extended to allow fuzzy multistage reasoning. The feasibility of the fuzzy-inference approach is shown. Though developed for mapping, the FiM approach can-using the corresponding selection rules-be applied to other configuration problems in multiple-strategy systems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模糊推理的映射决策
该方法基于一个将动态任务树结构映射到并行机器的系统,例如在符号应用的相关子领域中出现的动态任务树结构。这个映射系统提供了多个基本策略,在许多情况下是可组合的,而不是单一的通用策略。然后可以选择与应用程序特征最匹配的策略配置,即导致最佳性能。这就需要建立适当的面向特性的选择标准,这些选择标准具有足够的表现力和精确度,以使编译器能够自动找到(接近)最优配置。本文重点研究了自动配置方面的问题,并提出了FiM系统的解决方案。FiM是作为一个模糊推理系统实现的,模糊性使我们能够捕获应用特征的软分类,以及关于策略选择适当性的模糊确定性或充分性程度。现有的模糊推理方法必须扩展到允许模糊多阶段推理。证明了模糊推理方法的可行性。虽然是为映射而开发的,但FiM方法可以使用相应的选择规则应用于多策略系统中的其他配置问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An FPGA-based on-line neural system in photon counting intensified imagers for space applications A parallel sort-balance mutual range-join algorithm on hypercube computers Real-time obstacle detection on a massively parallel linear architecture Eigenvectors-based parallelisation of nested loops with affine dependences Parallel algorithms for spatial data partition and join processing
×
引用
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