Reconfigurable Resource Assignment Based on a Type-Location Model

ZHANG Hui-zhen; XIE Wei-bo; LI Xi; HONG Xin

doi:10.3969/j.issn.0372-2112.2015.02.015

您当前的位置：

首页 >

文章列表页 >

Reconfigurable Resource Assignment Based on a Type-Location Model

更新时间：2025-07-16

- Reconfigurable Resource Assignment Based on a Type-Location Model
- Acta Electronica Sinica Vol. 43, Issue 2, Pages: 299-304(2015)
- 作者机构：
  
  华侨大学计算机科学与技术学院,福建,厦门,361021
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61271383);Huaqiao University Talent Research Startup Project (No.12BS214)
- DOI：10.3969/j.issn.0372-2112.2015.02.015
  CLC： TP302.7
- Published：2015
- 稿件说明：
移动端阅览
ZHANG Hui-zhen, XIE Wei-bo, LI Xi, et al. Reconfigurable Resource Assignment Based on a Type-Location Model[J]. Acta Electronica Sinica, 2015, 43(2): 299-304.
DOI：

ZHANG Hui-zhen, XIE Wei-bo, LI Xi, et al. Reconfigurable Resource Assignment Based on a Type-Location Model[J]. Acta Electronica Sinica, 2015, 43(2): 299-304. DOI： 10.3969/j.issn.0372-2112.2015.02.015.

摘要

在基于指令集动态可扩展技术的可重构指令集处理器研究中

如何有效使用系统的可重构资源

将很大程度上影响扩展得到的定制指令的功能实现

进而影响系统性能的优化效果.本文针对可重构资源的利用问题

首先设计了一种可重构资源模型

该模型弱化了可重构资源的功能和数量属性

主要提供其种类和位置属性

并能够以此计算资源使用的时间属性.基于此模型

本文将图论中的图着色问题进行扩展

引入多遍着色的思想

提出了一种针对粗粒度可重构资源的资源指派算法

该算法将可重构资源的指派等价为一个图多遍着色问题

通过模型提供的属性参数和限制条件完成指派过程.实验结果验证了算法的有效性

并揭示了资源使用中的规律性

对提高资源利用率和系统性能具有一定的指导意义.

Abstract

In the research of reconfigurable instruction set processors based on instruction-set extension

the effectiveness of reconfigurable resources utilization will greatly impact the implementation of function units for custom instructions and furthermore performance improvement of the whole system.For the problem

this paper first designs a resource model

which weakens the functions and amounts of reconfigurable resources and mainly provides their types and locations that can calculate utility time.Based on the model

an assignment algorithm for coarse-grained reconfigurable resources is proposed.The algorithm deals with the problem as a multi-coloring graph

and assigns resources for custom instructions through extending graph coloring algorithm in graph theory.Experimental results prove the correctness and effectiveness of the algorithm

and reveal some interesting rules which have guiding significance to improve resource utilization and system performance.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Data-Driven Uniform Programming Model for Reconfigurable Computing

An Improved Level Partitioning Algorithm Considering Minimum Execution Delay and Resource Restraints

A Fine Grain Parallel Computer Architecture Model Based on Free Space Optical Interconnection

Related Author

ZHOU Xue-hai

LUO Sai

WANG Feng

QI Ji

CHEN Nai-jin

JIANG Jian-hui

CHEN Xin

ZHOU Zhou

Related Institution

Department of Computer Science and Technology,University of Science and Technology of China

School of Software Engineering, Tongji University

College of Computer and Information Engineering, Anhui Polytechnic University

College of Electronics and Information Engineering, Tongji University

School of Software Engineering Tongji University Shanghai China

⁰