检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学国家专用集成电路系统工程技术研究中心,江苏南京210096
出 处:《电子学报》2007年第8期1558-1562,共5页Acta Electronica Sinica
基 金:国家自然科学基金(No.60676011)
摘 要:本文提出一种基于扩展控制流图(ECFG)的片上存储器(Scratch-Pad Memory,SPM)分配策略,该策略首先把程序划分为全局变量、全局堆栈、指令块等节点,用包含节点和节点间关系的ECFG来描述应用程序,接着采用考虑了节点间关系的改进的背包算法把选中的节点分配到SPM中.实验表明该策略比采用单纯背包算法的SPM分配策略减少应用程序执行时间11%,比不使用SPM时减少56%,大大提高了SoC存储子系统的性能.A SPM memory allocation method were proposed based on extend control flow graph. This method transforms the application into a directed graph consisting of nodes and relationships of nodes. In succession, this method applies a refined Knapsack algorithm to solve the problem of SPM memory allocation.In the previous researches, these relationships of nodes are ignored, which result in a considerable expense of memory space during the process of SPM allocation. Our experiments show that our approach conduces to significant performance improvements ( 11% an average) compared to the previous.And the execution time of the application is reduced to 56 % compared to none SPM environment.
分 类 号:TP343[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229