Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

网格方程组并行计算预条件迭代若干性质及应用

对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

结合峰值检测的高噪声图像快速聚类分割方法

针对高噪声污染图像,提出一种结合峰值检测算法的快速聚类分割方法(FC-ImSeg)。根据平行线投影分割算法将二维直方图映射到一维空间,利用峰值检测算法检测图像像素点的聚类结果,调整映射模型的平行线宽度,使直方图符合双峰分布特性,最后利用加权模糊c均值聚类算法实现图像的分割。实验结果证明了该方法是快速有效的。     

基于DSP的SMI方法快速实现研究

空时自适应处理(STAP)权值计算有数据域和均方域两种方法,分别以QR分解和样本协方差矩阵求逆(SMI)方法为代表.QR分解方法可以映射到脉动阵上并行实现,但实现复杂且设计成本较高;SMI方法实现则相对简单,但需要对样本协方差矩阵直接求逆.首先考察了不同矩阵求逆方法的内在并行性,基于DSP支持的片内并行技术,提出并实现了SMI方法的单DSP分块并行处理,进一步给出了数值稳定性分析和改善方法,实验结果证明了方法的有效性.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

液体火箭发动机非线性燃烧不稳定过程的并行仿真

采用计算燃烧学方法对火箭发动机非线性燃烧不稳定工作过程进行了并行数值模拟。气相控制方程组用欧拉坐标系下的Navier Stokes方程组描述 ,液相控制方程组在Lagrangian坐标系下进行描述。气、液两相作用通过方程组的源项互相耦合。编制了串行和并行程序 ,并在并行计算环境下进行了测试。从计算结果可以看出并行计算的效率较高。     

小型移动电站并列过程中的频率测量

小型移动电站并列过程中的频率测量是实现其并列的基础和关键。介绍了一种应用于小型移动电站并列过程中的频率测量方案,分析了其测量的基本原理,给出了硬软件的实现以及实验。该方案基于快速傅立叶变换(FFT)算法,采用专门的数字信号处理芯片TMS320LF2407A,具有精度高、实时性较好的优点,能够较好地满足小型移动电站在并列过程中对精度和实时性的要求。通过对实验结果的分析得出了结论,该方案有一定的实践应用价值。     

MC68HC05L9与TMS320C25并行处理在智能化仪器仪表中的应用

本文简要介绍了一种能用于智能化仪器仪表工业,由MC68HC05L9和TMS320C25两片微处理器组成的并行处理系统.该系统采用乒乓式RAM结构进行数据通讯,处理速度可达1100万次/秒.软硬件采用了抗干扰技术,具有成本低、性能高、结构简单等特点.稍加改进,也可应用于自动控制系统中.     

基于多层循环并行化的负载平衡优化

负载平衡是并行处理中的一个重要概念。参与一个程序执行的各处理机所承担的工作量是否均衡直接影响该程序的并行性能。本文对面向MPP系统程序循环级并行化中负载平衡的优化进行了探讨,提出了优化策略及其实施算法。