Adaptive Online Voltage Scaling Scheme Based on the Nash Bargaining Solution

In an effort to reduce energy consumption, research into adaptive power management in real‐time systems has become widespread. In this paper, a novel dynamic voltage scaling scheme is proposed for multiprocessor systems. Based on the concept of the Nash bargaining solution, a processor's clock speed and supply voltage are dynamically adjusted to satisfy these conflicting performance metrics. In addition, the proposed algorithm is implemented to react adaptively to the current system conditions by using an adaptive online approach. Simulation results clearly indicate that the superior performance of the proposed scheme can strike the appropriate performance balance between contradictory requirements.     

Service stage Petri net models with product form solution

A class of service stage Petri net models whose equilibrium probabilities satisfy local balance equations is presented. Examples of their applicability include bus oriented multiprocessor interconnections, the classical dining philosophers problem and the alternating bit protocol. The natural topological space for embedding the state transition lattice for this class of SSPN is shown to be a multidimensional toroidal manifold.     

结构的多机并行分析I——结构的并行有限元方法

本文详细分析和讨论了结构分析的并行有限元方法—并行预处理共轭梯度法(以下简称PPCG法)。着重讨论了基于自带存储器的多处理机系统的并行预处理算法问题,并由此提出了两种PPCG法:PPCG1和PPCG2法。这两种方法适用于以单道剖分(one-way dissection)的子结构法为基础的并行分析。由于这种剖分法产生的结构刚度矩阵具有箭头形状,可独立地消除各子结构的内部自由度,并且不会在刚度矩阵中产生新的非零元素,因此很适合具有较多处理机的并行机系统对复杂结构进行的并行分析。     

并行计算机在现代雷达信号处理中的应用

现代各种体制的雷达，包括地基雷达、舰载雷达、机载雷达和星载雷达如想提高雷达性能，就要大力提高信号处理和数据处理速度，目前国内外均采用现成商用大规模并行处理机。这些处理机的型号较多，文中着重介绍美国成功研制的MP-2，因为MP-2在美国THAAD和NMD地基雷达中得到了成功应用。此外还介绍了并行处理机在国内外机载和星载雷达中的应用及发展。     

并行多处理机系统中的光纤互连网络的设计与实现

在并行多处理机系统中应用光纤互连网络完成处理单元之间的数据交换,可以极大地提高系统中数据通信的速率、带宽、抗干扰性和准确可靠性.本文详细阐述了并行多处理机系统的体系结构、实现方法、性能分析和实验结果.     

基于MSP430单片机的多机串口通信设计

MSP430单片机以其显著的低功耗特性在工业控制等领域得到了广泛应用。本文讨论了采用MSP430单片机构建串口多机通信系统的问题,在分析了MSP430单片机串口模块特性的基础上,给出了应用MSP430单片机进行串口多机通信系统设计的框图,针对实际串口通信存在的问题提出使用应答式串行通信协议,并结合MSP430单片机的低功耗和中断特性实现了该协议。     

Thek-partitioning problem

Thek-partitioning problem is defined as follows: Given a set of items {I ₁,I ₂,...,I _n} where itemIj is of weightwj 0, find a partitionS ₁,S ₂,...,S _m of this set with ¦S _i ¦ =k such that the maximum weight of all subsetsS _i is minimal,k-partitioning is strongly related to the classical multiprocessor scheduling problem of minimizing the makespan on identical machines. This paper provides suitable tools for the construction of algorithms which solve exactly the problem. Several approximation algorithms are presented for this NP-hard problem. The worst-case behavior of the algorithms is analyzed. The best of these algorithms achieves a performance bound of 4/3.     

多处理器芯片体系结构研究

随着超大规模集成电路工艺和超级计算技术的发展，作者认为在单个芯片内集成多处理器系统将成为可能。本文详细讨论了多处理器芯片的分类和结构，着重阐述了同构型多处理器芯片的主要研究方向，并对同构型多处理器的可行性作出了分析。     

一种基于遗传算法的多处理机调度算法实现

针对使用有向无回路图表示的应用任务在多处理机系统上的静态调度问题，对基于问题空间遗传算法(PSGA)的调度技术进行改进。以减少系统响应时间。为了验证本文算法的有效性，把其与标准算法和CP/MISF列表算法进行了比较，仿真试验表明，本文算法能够得到最优的调度结果。     

Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop

This paper describes a complex scheduling problem taken from a hospital diagnostic testing center that schedules hundreds of patients in an open shop environment consisting of multiple facilities and multiple processors. This scheduling problem, known as the multiprocessor open shop (MPOS) problem, is strongly NP-hard with few published results. Realizing that in many MPOS environments processing times are stage-dependent, not both job and stage-dependent, this paper examines a new class of problems for the MPOS—proportionate ones. This paper exploits the structural nature of the proportionate MPOS and defines new terms. Despite the enormous complexity of the MPOS problem, this work demonstrates that polynomial time algorithms exist for two special cases. Since other applications of this problem exist in service and manufacturing environments, solving the proportionate MPOS problem is not only significant in the theory of optimization, but also in many real-world applications.