一种优化的LTPB网络带宽分配方法及实时性能分析

研究LTPB（线性令牌传递总线）通信网络中带宽分配方法对网络实时性能的影响。提出了一种优化的带宽分配方法和基于“最差情形下可达负载率”的网络实时性能分析方法，证明了该带宽分配方法优于所有传统的分配方法，最后举例说明了结论的正确性。     

Compositional priority specification in real-time distributed systems

In this paper, we develop a compositional denotational semantics for prioritized real-time distributed programming languages. One of the interesting features is that it extends the existing compositional theory proposed by Koymanset al (1988) for prioritized real-time languages preserving the compositionality of the semantics. The language permits users to define situations in which an action has priority over another action without the requirement of preassigning priorities to actions for partially ordering the alphabet of actions. These features are part of the languages such as Ada designed specifically keeping in view the needs of real-time embedded systems. Further, the approach does not have the restriction of other approaches such as prioritized internal moves can pre-empt unprioritized actions etc. Our notion of priority in the environment is based on the intuition that a low priority action can proceed only if the high priority action cannot proceed due to lack of the handshaking partner at that point of execution. In other words, if some action is possible corresponding to that environment at some point of execution then the action takes place without unnecessary waiting. The proposed semantic theory provides a clear distinction between the semantic model and the execution model — this has enabled us to fully ensure that there is no unnecessary waiting.     

Load-Balanced Sparse Matrix–Vector Multiplication on Parallel Computers

We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors on parallel computers. We propose a method that combines fast load-balancing with efficient message-passing techniques to alleviate computational and inter-node communications challenges. The performance of the proposed method was evaluated on benchmark as well as on synthetically generated matrices and compared with the current work. It is shown that, by using our approach, a tangible improvement over prior work can be obtained, particularly for very sparse and skewed matrices. Moreover, it is also shown that I/O overhead for this problem can be efficiently amortized through I/O latency hiding and overall load-balancing.     

自适应SW-ADI方法解反应扩散方程的并行实现

根据解反应扩散方程的自适应样条小波-交替方向(SW-ADI)方法,使用MPI、OpenMP两种并行编程模式,对串行程序进行了直接并行化,并在上海大学的高性能计算机自强2000上分别用MPI和OpenMP实现了对方程的求解。对运算结果进行了分析并给出了与串行程序相比较的并行加速比。     

穿黄隧洞预应力衬砌结构三维非线性有限元分析

采用考虑接触问题的三维非线性有限元方法,对穿黄隧洞预应力衬砌结构进行计算分析。计算中考虑了内、外衬之间的接触,以及地基抗力对结构的作用,并对荷载施加过程和锚具槽施工过程进行了模拟。计算结果表明,预应力衬砌因锚索张拉挤压产生环向预压应力,同时,在衬砌环中还产生纵向拉应力。有资料分析某隧洞仿真模型预应力张拉试验中衬砌出现的环向裂缝,就是纵向拉应力超限所致。通过数值方法,分析引起纵向拉应力的主要因素,可供类似工程结构参考应用。     

XNETi网络接口的差错控制与分包／重组问题的研究

ＸＮＥＴｉ是为ＸＮＥＴ网络互连系统设计的基于ＰＣＩ总线的网络接口,可以有效地支持用户层的消息传递。本文着重介绍了ＸＮＥＴｉ中差错控制与分包／重组等功能的具体实现。     

Robust gossiping with an application to consensus

We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t<n be the number of failures, where n is the number of processors. If , then one of our algorithms completes gossiping in O(log²t) time and with O(npolylogn) messages. We develop an algorithm that performs gossiping with O(n^1.77) messages and in O(log²n) time, in any execution in which at least one processor remains non-faulty. We show a trade-off between time and communication in gossiping algorithms: if the number of messages is at most O(npolylogn), then the time has to be at least . By way of application, we show that if n−t=Ω(n), then consensus can be solved in O(t) time and with O(nlog²t) messages.     

Data flow analysis of distributed communicating processes

Data flow analysis is a technique essential to the compile-time optimization of computer programs, wherein facts relevant to program optimizations are discovered by the global propagation of facts obvious locally. This paper extends several known techniques for data flow analysis of sequential programs to the static analysis of distributed communicating processes. In particular, we present iterative algorithms for detecting unreachable program statements, and for determining the values of program expressions. The latter information can be used to place bounds on the size of variables and messages. Our main innovation is theevent spanning graph, which serves as a heuristic for ordering the nodes through which data flow information is propagated. We consider bothstatic communication, where all channel arguments are constants, and the more difficultdynamic communication, where channel arguments may be variables and channels may be passed as messages.A preliminary version of this paper appeared in the proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 257–268, June 1979.Supported by National Science Foundation Grant NSF MCS82-00269 and the Office of Naval Research Contract N00014-80-C-0647.Supported by National Science Foundation Grants NSF DCR-8505873 and NSF CCR-8704309.     

目标过顶的程序跟踪控制技术

阐述了利用计算机程序过顶控制技术解决地面站出现跟踪盲区时的过顶跟踪问题。利用实测数据分析了施加程序过顶跟踪控制前后的指向误差。     

VAX／RGL的C语言接口设计

异种语言编写的程序相互调用，是程序设计者为利用已有软件资源而经常涉及的实用技巧，本文基于Ｃ应用程序调用ＶＡＸ／ＲＧＬ图形库绘图的实践，探讨ＶＡＸ／ＶＭＳ环境中Ｃ语言与ＦＯＲＴＲＡＮ语言的接口方法，其关键在于弥补两者采用的ＶＡＸ过程调用参数机构上的差异。然后介绍笔者利用该方法为ＲＧＬ实现的一个Ｃ程序接口软件。