计算机科学与技术

一种应用图论方法管理可重构资源的策略

展开
  • 1. 哈尔滨工程大学 计算机科学与技术学院, 黑龙江 哈尔滨 150001; 2. 齐齐哈尔大学 计算机与控制工程学院, 黑龙江 齐齐哈尔 161006
张宏烈(1966-),女,教授,主要从事嵌入式系统与可重构计算的研究.

收稿日期: 2010-01-06

  修回日期: 2010-06-28

  网络出版日期: 2010-11-25

基金资助

黑龙江省自然科学基金资助项目(B2007-07); 齐齐哈尔市工业攻关项目(GYGG—09009)

Graph Theory-Based Algorithm to Manage FPGA Resources

Expand
  • 1.College of Computer Science and Technology,Harbin Engineering University,Harbin 150001,Heilongjiang,China;2.College of Computer and Control Engineering,Qiqihar University,Qiqihar 161006,Heilongjiang,China
张宏烈(1966-),女,教授,主要从事嵌入式系统与可重构计算的研究.

Received date: 2010-01-06

  Revised date: 2010-06-28

  Online published: 2010-11-25

Supported by

黑龙江省自然科学基金资助项目(B2007-07); 齐齐哈尔市工业攻关项目(GYGG—09009)

摘要

可重构硬件资源的管理是可重构操作系统的一个首要任务。本文提出了一种基于图论技术的管理空闲资源的UPFS算法。其核心思想是将FPGA的空闲区域映射 成无向图,在无向图中运用邻接矩阵和方向矢量交角等概念,求解最大回路和通路,最终找到满足条件的最大空闲矩形集。仿真实验表明,UPFS算法与已有算法相比,能有效减少系统资源浪费,降低系统硬件布局时间,是可行的管理策略。

本文引用格式

张宏烈 张国印 . 一种应用图论方法管理可重构资源的策略[J]. 华南理工大学学报(自然科学版), 2010 , 38(11) : 91 -95 . DOI: 10.3969/j.issn.1000-565X.2010.11.017

Abstract

In order to avoid the redundancy and duplication when using the plane partition algorithm to find all maximal empty rectangles,an algorithm based on virtual undigraph marked as KAMER_VU is proposed to manage the reconfigurable empty hardware resources.Based on the FPGA of two-dimension region,the algorithm uses the mapping between the undigraph and the FPGA model and indirectly finds all maximal empty rectangles by looking for effective loop and pathway in the virtual undigraph,thus simplifying the partition of free region.Some simulations are then performed to make a comparison between the proposed algorithm and the existing SL algorithm.The results indicate that KAMER_VU effectively saves time for hardware distribution and increases the success probabi-lity of hardware allocation for task.

参考文献

[1]null

文章导航

/