多机容错操作系统DFTOS的设计与实现

本文介绍了一个适于三模冗余容错计算机系统的系统管理软件ＤＦＴＯＳ，它是一个多机容错操作系统，具有分布处理和容错计算功能，并且与用户具有良好的接口关系，方便用户对系统的使用和开发。     

基于神经元网络的燃油锅炉烟气氧含量的软

针对目前各种氧含量检测仪表在运行过程中的可靠性差、使用寿命短及价格昂贵等诸多不足，通过探寻锅炉运行中的其他参数与烟气氧含量的映射关系，建立ＢＰ神经元网络，提出了燃油锅炉烟气氧含量的软测量方法。结果表明，其精度完全达到了设计要求。     

交流电机软起动

介绍了用ＮＥ５５５控制固态继电器，实现交流电机软起动的装置，以及电流闭环控制设计。实验证明：该方案具有良好的软起动性能，且造价低。     

异步电机软起动装置的模糊控制器设计研究

介绍了DRQ系列异步电机软起动装置的硬件电路。在此基础上着重讨论了其模糊控制器的设计,探讨了模糊控制器量化因子和比例因子的选择与整定方法,使模糊控制与电流瞬时值采样相配合,达到了良好的控制效果。该方法电流波动小,无电流冲击与振荡现象。     

A Scalable Interconnection Network Architecture for Petaflops Computing

Extrapolating technology advances in the near future, a computer architecture capable of petaflops performance will likely be based on a collection of processing nodes interconnected by a high-performance network. One possible organization would consist of thousands of inexpensive, low-power symmetric multiprocessor (SMP) nodes. Each node will inject data into the interconnection network at a very large rate and consequently, the interconnect scheme is one of the most crucial design issues affecting system performance. This paper describes the 2D simultaneous optical multiprocessor exchange bus (2D SOME-Bus) which has the potential to become the basis of a high-end computer architecture capable of petaflops performance. It consists of N horizontal, N vertical 1D SOME-Bus networks, and N ² nodes. Each node is connected to one horizontal and one vertical 1D SOME-Bus. Each of N nodes connected to one 1D SOME-Bus has a dedicated broadcast channel and an input channel interface based on an array of N receivers monitoring all N channels and allowing multiple simultaneous broadcasts. In the 2D SOME-Bus, messages being broadcast on one Bus can be broadcast in a cut-through manner on one or more Buses in the other dimension. This paper describes the optoelectronic devices and technology which make the 2D SOME-Bus possible, and the network interface organization. It also presents simulation results which compare the performance of the 2D SOME-Bus, the 1D SOME-Bus, the crossbar and the torus under the message-passing paradigm.     

Analysis,simulation and verification of a bipolar current source power resonant inverter

A high‐frequency bipolar current source resonant inverter introduced in this paper has dramatic zero‐voltage‐switching (ZVS) characteristic. The analytic expressions of the resonant voltage and current are given. It indicates that the resonant waveform is composed of two parts, i.e. the oscillatory component and the stationary component. In special cases, the resonant waveform degenerates into the mono‐frequency component, as presents the graceful sinusoidal wave with very low total harmonic distortion (THD) value. Based on the closed‐form voltage and current, the component stresses on reactive elements are obtained. The impact of different component values and operating frequencies on ZVS feature is also discussed. It should be noted that the ZVS merit may be lost if the components are carelessly selected. The validity of the theoretical analysis has been proven with Pspice simulations and experimental results. Copyright © 2004 John Wiley Sons, Ltd.     

基于DSP非同步控制的新型软起动系统

提出了一种基于自关断器件拓扑结构主电路的新型软起动系统．该系统实现了触发脉冲的 非同步控制，而且能够消除定子电流的低次谐波。与晶闸管控制的软起动相比，新型软起动控制简单，节能效果突出。该系统采用DSP和单片机构成的双CPU结构，实现数据处理和系统监控的并行处理，提高系统的响应速度和可靠性。结果表明，该系统具有很好的可行性和广阔的应用前景。     

Parallel global optimization with the particle swarm algorithm

Present day engineering optimization problems often impose large computational demands, resulting in long solution times even on a modern high-end processor. To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the particle swarm optimization (PSO) algorithm. Parallel PSO performance was evaluated using two categories of optimization problems possessing multiple local minima-large-scale analytical test problems with computationally cheap function evaluations and medium-scale biomechanical system identification problems with computationally expensive function evaluations. For load-balanced analytical test problems formulated using 128 design variables, speedup was close to ideal and parallel efficiency above 95% for up to 32 nodes on a Beowulf cluster. In contrast, for load-imbalanced biomechanical system identification problems with 12 design variables, speedup plateaued and parallel efficiency decreased almost linearly with increasing number of nodes. The primary factor affecting parallel performance was the synchronization requirement of the parallel algorithm, which dictated that each iteration must wait for completion of the slowest fitness evaluation. When the analytical problems were solved using a fixed number of swarm iterations, a single population of 128 particles produced a better convergence rate than did multiple independent runs performed using sub-populations (8 runs with 16 particles, 4 runs with 32 particles, or 2 runs with 64 particles). These results suggest that (1) parallel PSO exhibits excellent parallel performance under load-balanced conditions, (2) an asynchronous implementation would be valuable for real-life problems subject to load imbalance, and (3) larger population sizes should be considered when multiple processors are available.     

分布式存储环境下的加性Schwarz方法

引言 区域分裂方法起源于古老的schwarz交替方法[l].八十年代末期,法国数学家P.L.LionS提出了schwarz交替方法的投影解释[2一4],使得人们对schwarz交替方法有了全新的认识,为其进一步发展奠定了理论基础.由于并行计算环境的逐渐成熟以及预处理技术的兴起和大规模科学计算的需要,由严格串行的scliwarz交替方法发展了多种可完全并行的     

A distributed deadlock detection algorithm for mobile computing system

The mode of mobile computing originated from distributed computing and it has the un-idempotent operation property, therefore the deadlock detection algorithm designed for mobile computing systems will face challenges with regard to correctness and high efficiency. This paper attempts a fundamental study of deadlock detection for the AND model of mobile computing systems. First, the existing deadlock detection algorithms for distributed systems are classified into the resource node dependent （ RD ） and the resource node independent （RI） categories, and their corresponding weaknesses are discussed. Afterwards a new RI algorithm based on the AND model of mobile computing system is presented. The novelties of our algorithm are that： 1 ） the blocked nodes inform their predecessors and successors simultaneously; 2） the detection messages （agents） hold the predecessors information of their originator; 3 ） no agent is stored midway. Additionally, the quit-inform scheme is introduced to treat the excessive victim quitting problem raised by the overlapped cycles. By these methods the proposed algorithm can detect a cycle of size n within n - 2 steps and with （ n^2- n - 2 ）/2 agents. The performance of our algorithm is compared with the most competitive RD and RI algorithms for distributed systems on a mobile agent simulation platform. Experiment results point out that our algorithm outperforms the two algorithms under the vast majority of resource configurations and concurrent workloads. The correctness of the proposed algorithm is formally proven by the invariant verification technique.