Experiences with a parallel algorithm for data flow analysis

We have designed a family of parallel data flow analysis algorithms for execution on distributed-memory MIMD machines, based on general-purpose, hybrid algorithms for data flow analysis [Marlowe and Ryder 1990]. We exploit a natural partitioning of the hybrid algorithms and explore a static mapping, dynamic scheduling strategy. Alternative mapping-scheduling choices and refinements of the flow graph condensation used are discussed. Our parallel hybrid algorithm family is illustrated on Reaching Definitions, although parallel algorithms also exist for many interprocedural (e.g., Aliasing) and intraprocedural (e.g., Available Expressions) problems [Marlowe 1989]. We have implemented the parallel hybrid algorithm for Reaching Definitions on an Intel iPSC/2. Our empirical results suggest the practicality of parallel hybrid algorithms.An earlier version of this paper was presented at Supercomputing '90.The research reported here was supported, in part, by the New Jersey Commission on Science and Technology and the CAIP Center's Industrial Members, by Siemens Research Corporation and by National Science Foundation grant CCR-8920078.     

基于小波包和包络分析的滚动轴承故障自动诊断方法

提出了一种基于峭度-小波包-包络分析的滚动轴承故障自动诊断方法。首先用峭度系数判断是否出现故障,再针对故障轴承振动信号非平稳和调幅的特点,用小波包将信号分解到不同的节点上。然后将不同节点的重构信号做包络谱分析,将谱峰处的频率同滚动轴承内圈、外圈、滚珠、保持架等的故障频率进行对比分析,在此基础上,运用最小距离判别法则自动获得故障原因,从而实现滚动轴承故障的自动诊断。通过对实验中采集到的轴承振动信号进行分析,证明了该方法在轴承早期故障诊断中的有效性。     

天生桥梯级水电站联合调度决策支持系统建设经验

决策支持系统是水库优化调度实用化的发展方向，对于提高水电站生产效益和水库调度管理水平具有重要意义。结合国电公司重点科技项目“天生桥梯级水电站联合调度决策支持系统”的开发，阐述了开发水电调度决策支持系统实现水库调度实用化的经验:正确反映用户需求、增强用户对系统的控制、用模拟仿真弥补优化调度的不足、用数据库技术扩展水库优化调度实用化功能。     

A classification of predictive-reactive project scheduling procedures

The vast majority of the project scheduling research efforts over the past several years have concentrated on the development of workable predictive baseline schedules, assuming complete information and a static and deterministic environment. During execution, however, a project may be subject to numerous schedule disruptions. Proactive-reactive project scheduling procedures try to cope with these disruptions through the combination of a proactive scheduling procedure for generating predictive baseline schedules that are hopefully robust in that they incorporate safety time to absorb anticipated disruptions with a reactive procedure that is invoked when a schedule breakage occurs during project execution. In this paper we discuss the results obtained by a large experimental design set up to evaluate several predictive-reactive resource-constrained project scheduling procedures under the composite objective of maximizing both the schedule stability and the timely project completion probability.     

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines

We consider the scheduling of orders in an environment with m uniform machines in parallel. Each order requests certain amounts of k different product types. Each product type can be produced by any one of the m machines. No setup is required if a machine switches over from one product type to another. Different product types intended for the same order can be produced at the same time (concurrently) on different machines. Each order is released at time zero and has a positive weight. Preemptions are allowed. The completion time of an order is the finish time of the product type that is completed last for that order. The objective is to minimize the total weighted completion time. We propose heuristics for the non-preemptive as well as the preemptive case and obtain worst case bounds that are a function of the number of machines as well as the differences in the speeds of the machines. Even though the worst-case bounds we showed for the two heuristics are not very tight, our experimental results show that they yield solutions that are very close to optimal.     

Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.     

CDMA2000 1xEV-DO中的分组调度算法

移动通信系统需要更好地支持分组数据业务，并满足高速分组数据业务的服务质置要求。这可以通过采用好的调度算法提高平均业务速率和系统整体稳定性实现。针对CDMA2000 1x EV-DO系统的有代表性的调度算法有3种：正比公平算法、速率受限的最大载干比算法、加权公平排队-正比公平（WFQ-PF）联合算法。正比公平调度算法是一种算法简单实用的调度方案，但不能满足用户的服务质景保证；速率受限的最大载干比算法具有比正比公平算法更高的平均吞吐量，可方便地在吞吐量和公平性之间获得很好的折衷；WFQ-PF联合算法具有良好的综合性能，但算法较复杂。     

Integration of batching and scheduling for hot rolling production in the steel industry

This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic has been developed and tested on instances collected from practical production data. The experimental results show that the proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional serial method.     

Modeling and performance analysis of IP access interface in optical transmission networks with packet switching

The article analyzes the influence of the Internet Protocol (IP) access interface on the packet loss probability and delay times in the optical packet switched network. The network and node model have been proposed, and the structure of the IP access interface, including assembler and holder, have been included in the analysis. It has been shown that the increase of the maximum optical packet sizes, as well as use of the holding feature as contention resolution mechanism, decrease the packet loss probability, but introduce delays at the optical network access points. Modeling and analysis were based on the discrete event simulation assuming self-similar traffic sources. IP packet lengths were modeled using empirical data. This work has been conducted while the author was affiliated with the Telecommunication Laboratory, Swiss Federal Institute of Technology (EPFL-STI-ITOP-TCOM), Lausanne, Switzerland     

Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy

This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.