VxWorks平台内核态ARINC653分区实时调度算法设计与实现

集成模块化航空电子架构(Integrated Modular Avionic, IMA)已成为主流航空电子系统。ARINC 653作为航空电子设备IMA架构的标准应用接口,成为研究航空电子软件编程方法的入口。最新研究表明,VxWorks能够为航空电子分区管理提供最优化的平台。然而,基于VxWorks的ARINC 653高效分区调度算法依然是研究的“盲区”。由此,设计了VxWorks内核态分层ARINC 653分区实时调度算法,提高了分区调度效率,为VxWorks内核ARINC 653完整性的研究提供非常有价值的参考。实验数据说明,相较于传统用户态分区管理模型,该调度算法使分区释放开销和分区释放抖动两项指标均显著降低。     

On parallel asynchronous high-order solutions of parabolic PDEs

In achieving significant speed-up on parallel machines, a major obstacle is the overhead associated with synchronizing the concurrent processes. This paper presents high-orderparallel asynchronous schemes, which are schemes that are specifically designed to minimize the associated synchronization overhead of a parallel machine in solving parabolic PDEs. They are asynchronous in the sense that each processor is allowed to advance at its own speed. Thus, these schemes are suitable for single (or multi) user shared memory or (message passing) MIMD multiprocessors. Our approach is demonstrated for the solution of the multidimensional heat equation, of which we present a spatial second-order Parametric Asynchronous Finite-Difference (PAFD) scheme. The well-known synchronous schemes are obtained as its special cases. This is a generalization and expansion of the results in [5] and [7]. The consistency, stability and convergence of this scheme are investigated in detail. Numerical tests show that although PAFD provides the desired order of accuracy, its efficiency is inadequate when performed on each grid point.In an alternative approach that uses domain decomposition, the problem domain is divided among the processors. Each processor computes its subdomain mostly independently, while the PAFD scheme provides the solutions at the subdomains' boundaries. We use high-order finite-difference implicit scheme within each subdomain and determine the values at subdomains' boundaries by the PAFD scheme. Moreover, in order to allow larger time-step, we use remote neighbors' values rather than those of the immediate neighbors. Numerical tests show that this approach provides high efficiency and in the case which uses remote neighbors' values an almost linear speedup is achieved. Schemes similar to the PAFD can be developed for other types of equations [3].This research was supported by the fund for promotion of research at the Technion.     

Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent processes. Removing the synchronization constraint has the potential of speeding up the computation, while maintaining greater computation flexibility (e.g. differences in processors speed; differences in the data input to processors). We construct asynchronous (AS) finite difference schemes for the solution of PDEs by removing the synchronization constraint. We analyze the numerical properties of these schemes. Based on the analysis, we develop corrected-asynchronous (CA) finite difference schemes which are specifically constructed for an asynchronous processing. We present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although our discussion concentrates on the Euler scheme it should serve only as a sample, as it can be extended to other schemes and other PDEs.These schemes are implemented on the shared-memory multi-userSequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that synchronization penalty can be about 50% of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time-level, and with the problem dimension. The efficiency of the AS may reach 90% and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient but provides more accurate results for intermediate (non steady-state) values. The results show the potential of developing asynchronous finite deference schemes for steady-state as well as non steadystate problems.This research was partially supported by a grant from The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.A reduced version of the paper was presented at the 4th SIAM Conference on Parallel Processing for Scientific Computing, Dec. 11–13, 1989, Chicago, USA.The work by this author was supported by research grant 337 of the Israeli National Council for Research and Development in the years 1990–1991.This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NASI-18107 while the author was in residence at the Institute for Computer Applications in Sciences and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665, USA.     

Delay optimization and energy balancing algorithm for improving network lifetime in fixed wireless sensor networks

Since wireless in terms of energy-restricted processes, dispersion radii, processing power limitations, buffers, bandwidth-limited connections, active network topologies, and network stream of traffic outlines, sensor networks provide difficult design issues. The number of hops and latency are decreased if there is a relay mote because it interacts directly with relay motes that are closer to the destination mote. The tremendous intensive research in the area of Wireless Sensor Networks (WSN) has gained a lot of significance among the technical community and research. The job of WSN is to sense the data using sensor motes, pass on the data to the destination detection mote which is associated with a processing center and can be used in multiple spans of Internet of Things (IoT) applications. Wireless sensor network has a set of sensor motes. By making use of sensor mote placement strategy all the sensor motes are spread in an area with each mote having its own exceptional location. Internet of things applications are delay sensitive those applications have a challenge of forming the complete path at a lower delay constraint. The proposal is to modify the game theory energy balancing algorithm by making use of relay motes so that overall network lifetime is increased. It has been proved that modified GTEB is better with respect to existing algorithms in terms of delay, figure of hops, energy depletion, figure of alive motes, figure of dead motes, lifespan ratio, routing overhead and throughput.     

激光准直检测仪的研制及其应用开发

检测仪的研制，是从工程中数量甚大的桥式起重机的安全性检测中，国家规范要求甚高而实际检测手段简陋的矛盾提出的。装置充分利用激光束的直线性和传输过程中光斑中心不变、光强较高的特性；通过集光、机、电为一体的测尺直接读出数据。应用这套装置，已进行１１台双梁桥式起重机箱形主梁的变形测定，结果表明：这套装置在现场使用方便，精度与检测要求匹配，装置价格不高，对工程单位比较实用。１９９５年获国家实用新型专利     

Rime- and glaze-ice accretion due to freezing rain falling vertically on a horizontal thermally insulated overhead line conductor

A theory of atmospheric icing due to freezing rain on an overhead line conductor (OHLC) is developed. The rain falls vertically on a horizontal OHLC that is thermally insulated. It is assumed that the collection efficiency of the accretion surface is unity and that this surface is in thermodynamic equilibrium with the environment.

For air temperature T_A 0°C and raindrop temperature T_D 0°C, the freezing rain accretes as rime ice, provided that the temperature of the ice surface T_l < 0°C. The evolution equation governing the mass transfer at the accretion surface is solved analytically, yielding the shape of the rime-ice surface. Equations governing the thermal state of the rime-ice deposit are also given. These determine the onset of wet growth or glaze accretion at the upper stagnation line during suitable environmental conditions.

For environmental conditions producing an ice surface at temperature T_l = 0°gC, the freezing accretes as glaze. Equations governing the heat and mass transfer at the surface determine the shape of the glaze surface and the downward viscous motion of the unfrozen water. For T_D < 0°C, glaze evolution equations are developed for T_A 0°C and T_A 0°C. Analytical solutions of these equations are obtained. In particular, when T_D < −T_A < 0°C, the evolution equation predicts a novel limiting growth that is triangular in shape. Further study of the mass and heat transfer conditions, in the neighborhood of this final stage of glaze accretion, shows that it is maintained in thermodynamic equilibrium with its warm air environment.     

一种基于分段能量分析的桥式吊车镇定控制器设计方法

针对欠驱动桥式吊车系统,提出了一种基于分段能量分析的桥式吊车镇定控制器没计方法.具体而言,首先通过对系统特性进行分段分析构造出一个新的能量函数;随后,在其基础上设计了一种新型的能量控制器,并借助Lyapunov方法和LaSalle不变性原理证明了闭环系统的渐近稳定性.利用数值仿真与实际实验验证了所提出的控制算法具有良好的控制性能,对外界干扰具有较强的鲁捧性.此外,实验结果进一步表明:相比常规的能量控制方法与时间最优控制方法,该控制方法可降低驱动能耗,保征台车的快速精确定位,同时负载的摆角被抑制在更小的范围内,几乎无残余摆动.     

Modelling the motion of a disk Rolling on a curve in R: The case where the motion is driven by using two overhead rotors

This work deals with the modelling of the motion of a disk rolling without slipping ona regular curve in R³. The disk's motion is driven by a pedalling torque and by using two overhead rotors.     

Splitting graphs when calculating Myerson value for pure overhead games

A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in order to reduce the associated calculus for communication situations with a pure overhead game, the possibility of splitting the graph in several subgraphs is analyzed. For each fixed decomposition of the graph, a subspace of games compatible with this decomposition is given.