EIGENVECTORS-BASED PARALLELISATION OF NESTED LOOPS WITH AFFINE DEPENDENCES

Abstract

This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of the program into sequential and parallel regions, and generate parallel code to execute these regions. For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane-based loop transformation.     

带曲率补偿的带隙基准电流源的设计

简单介绍了带隙基准源的基本原理,给出了一款基于Widlar结构的带曲率补偿的带隙基准电压电流源的设计方法,通过采用TSMC₀.5μm工艺库对电路进行仿真,在-40～150℃的温度范围内,其带隙基准的输出具有12ppm/℃的温度系数,电流基准的输出具有42ppm/℃。此外,文中还对曲率补偿电路的工作原理进行了分析,并且通过仿真波形对曲率补偿的工作机制进行了讨论。     

使用矩阵实现LRU的页面置换算法

操作系统的内存管理一直是计算机领域研究的一个重要方向。文中分析了几种常用内存管理中的页面置换算法及其存在的问题,提出了LUR页面置换算法的操作系统内存管理中比较接近理想算法的一种页面置换算法,并阐述了使用矩阵方法实现该页面置换算法的原理。     

一种新的码片内多径时延估计方法

根据信道冲激响应的稀疏特性,提出了一种频域的时延估计压缩感知模型,将时延估计问题转化为基于欠采样数据的稀疏向量估计问题.利用离散傅里叶变换(Discrete Fourier transform,DFT)矩阵的子矩阵所满足的受限等距性(Restricted isometry property,RIP)以及信道冲激响应的稀疏特性充分降低了时延估计所需数据量的要求.分析了本文模型具有码片内多径分辨能力以及良好抗噪性能的原因,并与多信号分类(Multiple signal classification,MUSIC)和旋转不变技术的信号参数估计(Estimation of signal parameters via rotational invariance technique,ESPRIT)算法的时延估计性能进行仿真比较.仿真结果表明,本文提出的方法不需要预知多径的条数,对码片内多径时延具有较高的估计精度,其时延估计性能在特定条件下优于MUSIC和ESPRIT算法.     

支持状态机建模的工作流引擎研究

为了能清晰地描述存在较多审批环节和步骤跳转的业务流程,提出利用状态机为流程建模的方法。通过改进传统的关系结构工作流引擎,给出一个支持状态机建模的关系结构工作流引擎的设计方案,详细介绍该引擎的设计原理和实现柔性方法。最后通过一个示例,演示支持状态机建模的工作流引擎的工作机制和实例迁移的过程。原型已经应用到高校学费管理系统中。实践证明,该引擎可以有效地支持状态机建模,并缩短关键业务的开发周期。     

膨胀弯管在管道柔性设计中的定性分析

为防止管道因热胀冷缩、管道支撑或端点附加位移造成的应力问题,对管线中设置的膨胀弯管进行定性分析.通过2个参数的变化对膨胀弯管进行编号得到多种设计方案,用ANSYS建立管道的有限元模型,并分析各方案中膨胀管道的变形、应力和弯矩等;根据分析结果对膨胀弯管设计半径、设置位置和形状进行定性分析.该定性分析结果可为膨胀弯管概念设计和管道柔性设计提供参考.     

具有时变状态滞后2-D离散系统的稳定与镇定(英文)

针对一类由局部状态空间(LSS)Fornasini-Marchesini(FM)第二模型描述的,具有时变状态滞后的2-D离散系统,其中时变滞后项的上、下界均为正实数,研究了其稳定性和控制综合问题。首先,利用Lyapunov-Krasovski泛函方法,提出了系统的稳定性准则。再根据这一准则,分别设计状态反馈和动态输出反馈控制器保证系统的稳定性。状态反馈控制律和输出反馈矩阵可由线性矩阵不等式(LMI)求得。最后,通过数值算例说明所得结果的有效性。     

Positive state‐bounding observer for positive interval continuous‐time systems with time delay

This paper is concerned with the problem of positive observer synthesis for positive systems with both interval parameter uncertainties and time delay. Conventional observers may no longer be applicable for such kind of systems due to the positivity constraint on the observers, and they only provide an estimate of the system state in an asymptotic way. A pair of positive observers with state‐bounding feature is proposed to estimate the state of positive systems at all times in this paper. A necessary and sufficient condition for the existence of desired observers is first established, and the observer matrices can be obtained easily through the solutions of a set of linear matrix inequalities (LMIs). Then, to reduce the error signal between the system state and its estimates, an iterative LMI algorithm is developed to compute the optimized state‐bounding observer matrices. Finally, a numerical example is presented to show the effectiveness and applicability of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Augmented Lyapunov functional approach for stability of neutral systems with mixed delays

This paper is concerned with the neutral‐delay‐dependent and discrete‐delay‐dependent stability for uncertain neutral systems with mixed delays and norm‐bounded uncertainties. Through constructing a new augmented Lyapunov‐Krasovskii functional and proving its positive definiteness, introducing some slack matrices and using integral inequality, the improved delay‐dependent stability criteria are derived in terms of linear matrix inequalities. Numerical examples are given to illustrate the significant improvement on the conservatism of the delay bound over some existing results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Polynomial approximation of functions of matrices and applications

In solving a mathematical problem numerically, we frequently need to operate on a vector by an operator that can be expressed asf(A), whereA is anN ×N matrix [e.g., exp(A), sin(A), A^–-]. Except for very simple matrices, it is impractical to construct the matrixf (A) explicitly. Usually an approximation to it is used. This paper develops an algorithm based upon a polynomial approximation tof (A). First the problem is reduced to a problem of approximatingf (z) by a polynomial in z, where z belongs to a domainD in the complex plane that includes all the eigenvalues ofA. This approximation problem is treated by interpolatingf (z) in a certain set of points that is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problems is described. Since a solution to a linear systemAx=b isx=A ^–1 b, an iterative solution algorithm can be based upon a polynomial approximation tof (A)=A ^–1. We give special attention to this important problem.