Managing Reconfigurable Resources in Heterogeneous Cores Using Portable Pre-Synthesized Templates

M. Santambrogio, M. Giani, S. Memik
{"title":"Managing Reconfigurable Resources in Heterogeneous Cores Using Portable Pre-Synthesized Templates","authors":"M. Santambrogio, M. Giani, S. Memik","doi":"10.1109/ISSOC.2007.4427446","DOIUrl":null,"url":null,"abstract":"In this paper we consider multi-FPGAs, reconfiguration and system description portability as the processes of specifying and modeling a complete system before it is partitioned and committed to a style/flow of implementation. In the case of a high performance computing cluster employing FPGAs, the reconfigurable elements need to be dynamically re-allocated and reconfigured based on the prevailing workload at a given instance. We particularly target fast configuration and task migration in high performance computing systems, such as server farms. This paper presents a design flow, based in resource sharing across configurations on the reconfigurable devices, which can manage the resource allocation and reconfiguration quickly when resources need to be migrated between different applications. The resources shared across configuration are defined using an isomorphic-driven partitioning approach. This technique detects recurrent structures and produces a partitioned specification in which the identified clusters are instances of repeating templates in the original graph used to describe the input application. Two algorithms for regularity extraction were implemented. The performances of the algorithms were compared with regard to the size and number of regular structures identified by the two approaches, as well as the lime taken to perform their task.","PeriodicalId":244119,"journal":{"name":"2007 International Symposium on System-on-Chip","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on System-on-Chip","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSOC.2007.4427446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper we consider multi-FPGAs, reconfiguration and system description portability as the processes of specifying and modeling a complete system before it is partitioned and committed to a style/flow of implementation. In the case of a high performance computing cluster employing FPGAs, the reconfigurable elements need to be dynamically re-allocated and reconfigured based on the prevailing workload at a given instance. We particularly target fast configuration and task migration in high performance computing systems, such as server farms. This paper presents a design flow, based in resource sharing across configurations on the reconfigurable devices, which can manage the resource allocation and reconfiguration quickly when resources need to be migrated between different applications. The resources shared across configuration are defined using an isomorphic-driven partitioning approach. This technique detects recurrent structures and produces a partitioned specification in which the identified clusters are instances of repeating templates in the original graph used to describe the input application. Two algorithms for regularity extraction were implemented. The performances of the algorithms were compared with regard to the size and number of regular structures identified by the two approaches, as well as the lime taken to perform their task.
使用便携式预合成模板管理异构核心中的可重构资源
在本文中,我们考虑多fpga,重构和系统描述可移植性作为指定和建模一个完整的系统之前,它被划分和承诺的风格/实现流的过程。在使用fpga的高性能计算集群的情况下,需要根据给定实例的主要工作负载动态地重新分配和重新配置可重构元素。我们特别针对高性能计算系统中的快速配置和任务迁移,例如服务器群。本文提出了一种基于可重构设备配置间资源共享的设计流程,当资源需要在不同应用间迁移时,该流程可以快速管理资源分配和重构。跨配置共享的资源是使用同构驱动的分区方法定义的。该技术检测循环结构并生成分区规范,其中已识别的集群是用于描述输入应用程序的原始图中重复模板的实例。实现了两种规则提取算法。比较了两种方法所识别的规则结构的大小和数量以及执行任务所需的时间,比较了算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信