基于匹配策略的安全协议重构分析

可重构安全协议对提高安全系统的灵活性和适应能力具有重要意义,它可根据具体上下文环境进行配置、移植,极大增强了系统的安全性,目前基于软件构件的协议重构方法无法满足安全协议对安全性和计算性的特殊要求.针对安全协议的安全性和高密度计算特性,提出了一种针对现有资源选择重构元的解决方法,给出协议可重构元匹配和基于QoS的重构元质量满意度的协议重构选择算法,使系统可以尽快按照重构协议需求选择满意的可重构元.通过实例说明该方法的执行过程,应用结果表明该方法能够有效提高重构效率和重构准确度.     

基于RMC的可重构制造系统设备布局优化研究*

为实现多品种变批量生产制造系统阵列式布局的动态重构,提出一种新的设备布局优化方法.建立了可重构制造系统(RMS)设备优化选择数学模型,设计了基于蚁群优化和阶序聚类算法的可重构制造单元(RMC)动态重构算法.以交货期内最小成本为目标,引入系统复杂度和系统响应度从系统能力角度完善了实现RMS重构的约束条件,最终完成了可重构制造系统设备布局优化.最后通过布局实例仿真验证该方法的可行性和有效性.     

可重构资源管理及硬件任务布局的算法研究

可重构系统具有微处理器的灵活性和接近于ASIC的计算速度,可重构硬件的动态部分重构能力能够实现计算和重构操作的重叠,使系统能够动态地改变运行任务,可重构资源管理和硬件任务布局方法是提高可重构系统性能的关键.提出了基于任务上边界计算最大空闲矩形的算法(TT-KAMER),能够有效地管理系统的空闲可重构资源;在此基础上使用FF和启发式BF算法进行硬件任务的布局.实验表明,算法能够有效地实现在线资源分配与任务布局,获得较高的资源利用率.     

一种异构可重构片上系统的实时任务调度算法

动态可重构系统中为新到达的任务实时地安排任务启动时间和放置位置是硬件任务调度算法的关键.硬件任务的调度在很大程度上影响可重构计算系统的性能.提出了一种基于二维资源模型的分组-邻接边在线调度算法,该算法将硬件任务按照长宽比分为垂直任务和水平任务两组分别考虑在可重构资源上的放置位置,同时引入任务邻接边数作为选择合理放置位置的重要指标,可使得硬件任务放置更为紧凑,减少资源碎片,提高调度成功率.对两种硬件任务放置策略进行了对比,结果表明尽可能旱的安排任务启动有利于提升高负载情况下的调度成功率.仿真实验表明,与已有算法相比,该算法具有更高的任条接受率,而运行时开销没有显著增加.     

基于网络的自重构机器人重构路径研究

文中针对自重构机器人的重构问题提出了一种基于网络的分析方法.自重构模块机器人"AMOEBA-I"的9种不同构形组成了一个构形网络.机器人的每种构形被看成带有权值的有向构形网络中的一个节点.一种构形向另一种构形的转换可描述为一条非负值的有向路径.将图论应用于构形变化的分析,根据构形的拓扑信息相应定义了重构路径、可重构矩阵和路径矩阵.在此基础上,将图论中的算法应用于重构路径的计数和最佳重构路径的选择.数值分析与仿真实验结果验证了该方法的可行性.同时,该方法还可以用于其他自重构机器人的构形控制与自重构规划.     

异构重构计算系统应用任务调度的性能分析

异构重构计算是目前高性能计算的研究热点.由于应用任务的异构性,以及体系结构的可重构性,导致异构重构计算的性能分析非常困难,现有的并行计算性能分析方法不再适用.本文提出一种基于应用任务调度的性能分析方法,该方法以异构重构计算系统模型和应用任务模型为基础,利用异构匹配、重构耦合矩阵,实现应用任务和处理部件的优化选择和耦合匹配,通过调度算法求出应用任务在异构重构计算系统中的完成时间,并进行了实例分析.     

基于机器人的可重构装配系统

本文分析了市场全球化给企业带来的挑战和机遇 ,提出了基于机器人的可重构装配系统 .在分析国外在可重构制造领域的研究状况的基础上 ,提出了基于机器人可重构装配系统的设计内容和方法 ,并提出了可重构装配系统今后需研究的方向     

可重构分组密码处理结构模型研究与设计

随着信息技术的发展和网络规模不断扩大,网络通信等应用对数据加解密处理提出了更高的要求,可重构计算是将可重构硬件处理单元和软件可编程处理器结合的计算系统.因此采用可重构计算技术来设计密码处理系统,使同一硬件能够高效灵活地支持密码应用领域内的多种算法.同时满足了密码处理对性能和灵活性的要求,提高了密码系统的安全性.论文在分析分组密码算法处理结构的基础上,结合了可重构结构的设计思想和方法,提出了一种可重构密码处理结构模型RCPA,并基于该模型实现了一款验证原型.原型在FPGA上成功进行了验证测试并在0.18μm CMOS工艺标准单元库下进行逻辑综合以及布局布线.实验结果表明,在RCPA验证原型上执行的分组密码算法都可达到较高的性能,其密码处理性能与通用高性能微处理器处理性能相比提高了10～20倍;与其他一些专用可重构密码处理结构处理性能相比提高了1.1～5.1倍.结果说明研究的RCPA模型既能保证分组密码算法应用的灵活性又能够达到较高的性能.     

可重构制造系统监督控制器的自动重构

提出了基于改进的网重写系统(Improved net rewriting system, INRS)的可重构制造系统(Reconfigurable manufacturing systems, RMS) Petri网监督控制器的自动重构方法, 以快速适应由市场需求变化所引起的制造系统构形的频繁变化. INRS解决了网重写系统存在的问题, 可动态调整给定Petri网模型的结构而不改变其行为属性. 以集合和图的组合形式定义了RMS的构形, 并提出了基于INRS的一类模块化、可重构的Petri网控制器的设计方法. 针对这类Petri网控制器, 提出了基于INRS的自动重构方法. 方法可将RMS构形的变化转变为INRS的图重写规则, 并作用于当前Petri网控制器, 使其快速、自动地重构为所求的新控制器. 所提出的Petri网控制器的设计与重构方法, 均从理论上保证了结果的正确性, 免校验. 仿真研究验证了方法的有效性.     

基于物元的流程报警系统重构算法及应用

根据流程工业的特点,提出了流程工业系统的物元表示方法.结合流程报警系统的特点,提出了面向时序数据的关联函数的计算方法和基于可拓学的系统重构方法.采用关联函数对重构系统进行聚类处理,建立了面向流程工业应用的实用系统重构算法.通过在乙烯裂解炉报警系统中的应用,验证了该算法的有效性.     

可重构系统中硬件任务布局布线算法研究

可重构计算系统中,二维可重构硬件任务的布局布线问题是影响系统资源利用率的重要因素。在异质化的可重构器件和任务模型基础上,对可重构硬件任务进行了适当分类,并提出一种能够对多类型可重构硬件任务同时布局布线的算法DRS-TCW。实验表明,该算法能够有效提高可重构器件的资源利用率和任务布线连通率。     

A non-dominated sorting genetic algorithm based approach for optimal machines selection in reconfigurable manufacturing environment

This paper deals with a problem of reconfigurable manufacturing systems (RMSs) design based on products specifications and reconfigurable machines capabilities. A reconfigurable manufacturing environment includes machines, tools, system layout, etc. Moreover, the machine can be reconfigured to meet the changing needs in terms of capacity and functionality, which means that the same machine can be modified in order to perform different tasks depending on the offered axes of motion in each configuration and the availability of tools. This problem is related to the selection of candidate reconfigurable machines among an available set, which will be then used to carry out a certain product based on the product characteristics. The selection of the machines considers two main objectives respectively the minimization of the total cost (production cost, reconfiguration cost, tool changing cost and tool using cost) and the total completion time. An adapted version of the non- dominated sorting genetic algorithm (NSGA-II) is proposed to solve the problem. To demonstrate the effectiveness of the proposed approach on RMS design problem, a numerical example is presented and the obtained results are discussed with suggested future research.     

Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system

Based on the current fiber optic technology, a new computational model, called a linear array with a reconfigurable pipelined abus system (LARPBS), is proposed in this paper. A parallel quicksort algorithm is implemented on the model, and its time complexity is analyzed. For a set of N numbers, the quicksort algorithm reported in this paper runs in O(log₂ N) average time on a linear array with a reconfigurable pipelined bus system of size N. If the number of processors available is reduced to P, where P < N, the algorithm runs in O((N/P) log₂ N) average time and is still scalable. Besides proposing a new algorithm on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations can be used to design other parallel algorithms on the same model. Future research in this area is also identified in this paper.     

可重构制造系统的可重构控制器

可重构控制器是可重构制造系统的重要组成部分之一。该文提出了可重构控制器的体系结构。分析了实现可重构制造系统的可重构控制的方法。仿真研究表明可重构控制是实现可重构制造系统控制系统可重构的有效方法。     

基于免疫原理的逻辑电路设计算法

硬件进化是基于进化计算和可重构硬件的新兴研究领域。逻辑电路的进化设计是硬件进化的主要研究方向之一。文章将生物免疫系统的进化非选择机制引入到逻辑电路设计中,提出了相应的逻辑电路设计算法,并给出了该文算法和进化算法的对比实验结果,结果表明该文算法更加有效。     

可重构系统中软硬任务划分方法研究

软硬件任务划分是可重构系统开发过程中的重要设计步骤,其划分结果直接影响到可重构系统的性能。目前的软硬件任务划分技术大多只考虑了对应用程序或算法的划分结果,忽略了FPGA在配置和通信时的开销,从而导致实际应用效果不理想。介绍了一种基于性能评估的软硬件任务划分方法,即通过对FPGA计算开销、配置开销、通信开销的预评估测试,结合改进的模拟退火算法得出可重构系统中的软硬任务划分结果。实验结果表明,该划分方法具有较好的划分效果和算法收敛速度。     

一种可重构计算系统设计与实现

可重构计算系统是一种新的实现计算系统的方法,它补充了原有通用处理器和专用硬件计算系统的不足,既具有在制造后的可编程性,又能提供较高的计算性能和计算密度。在简单介绍可重构计算系统体系结构的基础上,通过一个嵌入式实时控制系统实例,给出了可重构计算系统的一种实现方法。     

A process-driven computing model for reconfigurable semiconductor manufacturing

Reconfigurability is essential for semiconductor manufacturing systems to remain competitive. Reconfigurable systems avoid costly modifications required to change and adapt to changes in product, production and services. A fully automated, collaborative, and integrated while reconfigurable manufacturing system proves cost-effective in the long term and is a promising strategy for the semiconductor manufacturing industry. However, there is a lack of computing models to facilitate the design and development of control and management systems in a truly reconfigurable manner. This paper presents an innovative computing model for reconfigurable systems and controlled manufacturing processes while allowing for the integration of modern technologies to facilitate reconfiguration, such as radio frequency identification (RFID) and reconfigurable field programmable gate array (FPGA). Shop floor manufacturing activities are modeled as processes from a business perspective. A process-driven formal method that builds on prior research on virtual production lines is proposed for the formation of a reconfigurable cross-facility manufacturing system. The trajectory of the controlled manufacturing systems is optimized for on-demand production services. Reconfigurable process controllers are introduced in support of the essential system reconfigurability of future semiconductor manufacturing systems. Implementation of this approach is also presented.     

Automatic folding of cartons using a reconfigurable robotic system

This paper proposes new theories and methodology for the study of folding carton and reconfigurable packaging systems and presents both virtual and experimental systems to support the theories. Equivalent mechanisms of cartons were established by describing carton creases as joints and carton panels as links. With the analysis of the equivalent mechanism, the gusset vertexes of cartons were analyzed based on their equivalent spherical linkages and were identified as guiding linkages that determine folding. A reconfigurable robotic system was developed to demonstrate the ability to erect diverted cartons in the reconfigurable packaging system which could previously only be achieved manually.     

Decision-making method of reconfigurable manufacturing systems’ reconfiguration by a Gale-Shapley model

The companies need to rapid response to new product introduction, mix and demand changes to stay competitive. A reconfigurable manufacturing system can quickly react to changes in products and market. The control method to reconfigure the machines of a reconfigurable manufacturing system is crucial for the performance level. This paper proposes a reconfiguration decision-making method based on a Game-Theory algorithm, and in particular the Gale-Shapley model. A periodic review strategy is used to create two sets: one set of machine over-loaded and one set under-loaded. The Gale-Shapley model forms a coupled of over-loaded and under-loaded machines. The reconfiguration concerns the under-loaded machine of the coupled adding also the task performed by the over-loaded machine. This paper presents a simulation environment developed to evaluate the proposed method and highlight the main topics. The simulation results highlight how the game-theory approach developed improves all the performance measures with controlled number of machines’ reconfigurations.