Rank order filters and priority queues

Summary A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency. Anne Kaldewaij received an M.Sc. degree in Mathematics from the University of Utrecht (The Netherlands) and a Ph.D. degree in Computing Science from the Eindhoven University of Technology. Currently, he is associate professor in Computing Science at Eindhoven University. His research includes parallel programming and the design of algorithms and data structures. He enjoys teaching and he has written a number of textbooks on mathematics and programming. Jan Tijmen Udding received an M.Sc. degree in Mathematics in 1980 and a Ph.D. degree in Computing Science in 1984 from Eindhoven University of Technology. Currently, he is associate professor at Groningen University. His main research interests are mathematical aspects of VLSI, program derivation and correctness, and functional programming.     

Performance comparison of some discrete service time systems

This paper analyzes and compares the slotted time operation and the non-slotted time operation of a singleserver system with deterministic service time. These two operations are commonly used to model discrete service time systems in computer or digital communications. But due to the similarity in their operations and performance, the two models may be mixed up with each other. This paper examines by means of queueing analysis the performance of a few classes of systems that differ in the service order of their customers. The means and variances of the queue lengths, waiting times and interdeparture times of FCFS systems using the slotted time operations are first obtained from their respective LST and generating function equations. These are then used for comparison with those in non-slotted time systems. The results show that although the slotted time operation in the FCFS systems can be approximated by the non-slotted time operations under heavy traffic condition, the performances under other regions and service disciplines (e.g., the LCFS and the priority systems) may deviate significantly. They must be properly adjusted if one wishes to use the simpler equations of the non-slotted time operations to approximate the slotted time operations. The comparison graphs provided in this paper supply adjustments guidelines for the careful designers.     

云计算中一种多DAG工作流可抢占式调度策略

为解决多用户工作流调度过程中的公平性问题,提高资源利用率,满足不同用户DAG工作流的不同QoS需求,提出了抢占式多DAG工作流动态调度模型。该算法将DAG工作流按照QoS需求进行优先级划分,采用高优先级作业优先占有资源的原则调度作业。相同优先级DAG工作流的任务依据带有启发性信息的slowdown进行资源抢占,进一步提高了作业调度的公平性;对于不同优先级的作业调度,提出了基于阈值的回填算法,该算法在保证作业调度公平的同时提高了资源利用率。     

CSCW环境下协同设计并发控制算法的研究

并发控制是CSCW环境下协同设计中复杂而又关键的问题之一,分析几何信息模型对象特征之间的联系,建立特征之间的相交和约束关系。运用模糊数学分析方法,提出一种优先权限分配算法,给出版本管理的解决方案。设计和实现针对共享对象协同操作的一致性维护和并发控制算法,并通过实例验证算法有效性。     

基于节点优先权和兴趣数据筛选的传感器网络分簇算法

无线传感器节点工作时仅由自身携带的电池供电,因此高效控制节点能耗可以延长整个网络生命周期,提高网络整体利用率。针对环境监测类场景,提出了一种基于节点优先权和兴趣数据筛选的分簇算法,该算法同时考虑了节点分布距离和剩余能量,将这两个属性换算成簇头选举的优先权权值。此外,在簇头确定后簇头通过相应的数据筛选方法对每一轮子节点发来的数据进行处理,有选择地将数据传到基站。仿真结果表明,该算法在能量控制方面有较好的表现,明显地延长了网络生命周期。     

Group decision making based on incomplete multiplicative and fuzzy preference relations

The main aim of this paper is to investigate the group decision making on incomplete multiplicative and fuzzy preference relations without the requirement of satisfying reciprocity property. This paper introduces a new characterization of the multiplicative consistency condition, based on which a method to estimate unknown preference values in an incomplete multiplicative preference relation is proposed. Apart from the multiplicative consistency property among three known preference values, the method proposed also takes the multiplicative consistency property among more than three values into account. In addition, two models for group decision making with incomplete multiplicative preference relations and incomplete fuzzy preference relations are presented, respectively. Some properties of the collective preference relation are further discussed. Numerical examples are provided to make a discussion and comparison with other similar methods.     

回归测试方法的研究与分析

在整个软件的测试过程中,回归测试是其重要的组成部分,它总是在发现错误并更改软件后进行。根据回归测试的目的及意义,详细描述四种回归测试方法,并对各种方法进行比较分析,从而获得根据不同情况优先选择测试方法的回归测试策略,更好地实现回归测试。     

Linux2．6进程调度策略分析

分析了Linux2．6进程调度密切相关的一些数据结构,详细描述了进程调度的时机、调度的策略和调度的算法上的策略,这些改进使得Linux2．6进程调度程序实现了O（1）调度算法,支持抢占式调度,并且增强了对实时任务和SMP的支持。     

基于粒子群优化的交叉口公交优先控制研究

以四相位单交叉口为研究对象,计算推导交叉口的延误计算模型,包括公交优先相位减少的延误以及非公交优先相位增加的延误。模型以减少人总延误最大为控制目标,采用粒子群算法优化求解,从而得到最优的绿信比,并通过仿真算例验证算法的有效性。