On the Relevance of Architectural Awareness for Efficient Fork/Join Support on Cluster-Based Manycores

H. Al-Khalissi, Mladen Berekovic, A. Marongiu
{"title":"On the Relevance of Architectural Awareness for Efficient Fork/Join Support on Cluster-Based Manycores","authors":"H. Al-Khalissi, Mladen Berekovic, A. Marongiu","doi":"10.1145/2613908.2613911","DOIUrl":null,"url":null,"abstract":"Several recent manycores leverage a hierarchical design, where small-medium numbers of cores are grouped inside clusters and enjoy low-latency, high-bandwidth local communication through fast L1 scratchpad memories. Several clusters can be interconnected through a network-on-chip (NoC), which ensures system scalability but introduces non-uniform memory access (NUMA) effects: the cost to access a specific memory location depends of the physical path that corresponding transactions traverse. These peculiarities of the HW must clearly be carefully taken into account when designing support for programming models. In this paper we study how architectural awareness is key to supporting efficient and streamlined fork/join primitives. We compare hierarchical fork/join operations to \"flat\" ones, where there is no notion of the hierarchical interconnection system, considering two real-world manycores: Intel SCC and STMicro-electronics STHORM.","PeriodicalId":84860,"journal":{"name":"Histoire & mesure","volume":"5 1","pages":"9-16"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Histoire & mesure","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2613908.2613911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Several recent manycores leverage a hierarchical design, where small-medium numbers of cores are grouped inside clusters and enjoy low-latency, high-bandwidth local communication through fast L1 scratchpad memories. Several clusters can be interconnected through a network-on-chip (NoC), which ensures system scalability but introduces non-uniform memory access (NUMA) effects: the cost to access a specific memory location depends of the physical path that corresponding transactions traverse. These peculiarities of the HW must clearly be carefully taken into account when designing support for programming models. In this paper we study how architectural awareness is key to supporting efficient and streamlined fork/join primitives. We compare hierarchical fork/join operations to "flat" ones, where there is no notion of the hierarchical interconnection system, considering two real-world manycores: Intel SCC and STMicro-electronics STHORM.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多核集群的高效分叉/连接支持体系结构意识的相关性研究
最近的几个多核利用了分层设计,其中将中小型核分组在集群中,并通过快速L1暂存存储器享受低延迟、高带宽的本地通信。几个集群可以通过片上网络(NoC)相互连接,这确保了系统的可伸缩性,但引入了非统一内存访问(NUMA)效应:访问特定内存位置的成本取决于相应事务遍历的物理路径。在设计对编程模型的支持时,必须清楚地仔细考虑硬件的这些特性。在本文中,我们研究了架构感知如何成为支持高效和流线型的fork/join原语的关键。我们将分层分叉/连接操作与“扁平”操作进行比较,其中没有分层互连系统的概念,考虑到两个现实世界的多核:英特尔SCC和意法半导体STHORM。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The International Institute of Agriculture and the Information Infrastructure of World Trade (1905-1946) Une justice étrangère ? Measurement Standards and Market Governance: London Corn Trade Association and International Grain Markets (1880-1914) L’énergie : une histoire symbiotique Les dynamiques de l’objectivation du social
×
引用
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