一种面向移动Agent的多任务并行计算模型及算法

介绍了一种面向移动Agent的并行计算模型,给出了采用十标度策略解决任务排序,采用满射策略解决任务映射的算法。该模型允许多个计算任务在异构主机构成的分布式环境下同时进行计算,并且通过算法优化,降低移动Agent之间的通信成本,减少网络流量。     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

快速的平行码临界路径跟踪故障模拟

针对平行码临界路径跟踪故障模拟中最费时间的扇出源故障模拟,提出了若干加速技术。通过对电路结构进行的独立扇出分支、扇出源分类及扇出源的最终汇聚门等静态分析,结合对停止线及停止扇出源、测试码标记向量以及扇出源临界性确定前的预处理等动态计算,使得扇出源故障模拟区域及需要故障模拟的扇出源数目大大减少,极大地缩短了整个故障模拟时间。实验结果表明,平行码临界路径跟踪故障模拟算法,对少量和大批的随机码都非常有效,并且随着电路规模增加,其有效性更加明显。     

用于海底观测网络的海缆远程供电系统的可靠性

提出了串联恒流和并联恒压两种适合应用于海底观测网络的远程供电系统方案;在相同条件下,利用算法分别完成了两种系统的可靠性设计与分配方案,并根据各子单元的分配可靠度计算了两种系统各节点的供电可靠度。分析结果表明：相比于并联恒压远供系统,串联恒流远供系统对子单元的要求相对较低,而各节点的供电可靠度相对较高,说明串联恒流远供系统更适合应用于我国的海底观测网络建设。     

遥感图像自动配准的串行与并行策略研究

面对数据量呈指数增长的全球遥感图像,研究快速、有效、高精度的自动图像配准算法成为遥感领域迫切需要解决的问题。综述了遥感图像自动配准算法的研究现状和关键技术,且从新的角度分类总结了已有算法的特点及适用情况,并给出了综合的解决方案;同时研究并提出了三种新的并行策略,获得了较好的实验结论。由于算法采用粗粒度的数据并行方法,因此可扩展性和可移植性较好,无论在理论上还是在实践上都能为实际的遥感应用提供有益的指导和借鉴。最后提出了有待进一步研究的问题。     

并行离散事件仿真中的DDM机制实现

在并行离散事件仿真系统中实现仿真模型间的互操作机制需要引入类似HLA中定义的声明管理(DM)和数据分发管理(DDM)服务.我们开发的KD-PADSE高性能并行离散事件仿真环境采用谓词断言和对象代理方法在面向对象的并行离散事件仿真系统中实现了基于平行结构和事件调度机制的声明管理(DM)和数据分发管理(DDM)服务.在以千兆以太网互联的10节点Linux集群计算机上,采用DDM机制后仿真模型每秒(物理时间)可以进行1万次属性更新,是没有采用DDM机制时的20倍,在功能性和性能上验证了该DDM机制在并行离散事件仿真系统中的适用性.     

Cρ 准则下选择最优子集的并行算法

C_p准则是目前颇受重视的一种变量选择准则。本文针对大型线性回归模型,推导了从所有可能子集中用C_p准则选择最优子集的(乘除法) 运算次数,提出了C_p准则下变量选择的并行算法。给出了在YH-1和YH-2向量巨型计算机上运行该算法的模拟结果且获得了15倍左右的向量加速比s/v,体现了该算法的优越性。     

对称矩阵性态数的并行计算

本文针对对称矩阵A建立起性态数的并行计算公式,并通过数值试验得到了矩阵性态数变化对方程组Ax=b的解的误差影响,同时进行了向量和标量计算,计算结果表明:当x大于等于300时,向量计算速度比标量计算速度快17倍。     

基于层间嵌入式多级支持向量机的特征选择

针对多故障样本一次性映射之后分类不理想,研究了多级层次式支持向量机,应用UCI数据仿真,结果表明该方法缩短了训练时间、提升了测试准确率、改善了样本的可分类性。由于误差积累,在此基础上,提出了层间嵌入式多级支持向量机,采用Abalone数据仿真,结果表明分类精度有所提高并减少了分类步骤。结合ReliefF算法,对制导设备的故障特征参数进行了选择。