A bandwidth latency tradeoff for broadcast and reduction

The “fractional tree” algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns—sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.     

Simulation based on learning methods

The use of simulation technology as a tool for planning and control is of increasing significance in most fields of production. The main part of the expenditure concerning simulation analyses is the modelling of the considered production. Despite the use of modern building-block-oriented modelling technology, this modelling can often not be done by the user, but only by external experts. Against this backdrop, an adaptive simulation system is being developed by the Institute for Industrial Manufacturing and Management (IFF) at the University of Stuttgart. It independently adapts to real production processes, i.e. it learns about the interdependencies of production processes, and, in this way, supports the user in constructing and maintaining the model. In terms of information technology, the research in the field of artificial intelligence, especially in the subdomain of machine learning, is the basis for the realization of such adaptive systems.     

Parallel finding all initial palindromes and periods of a string on reconfigurable meshes

Given a string of lengthn, this short paper first presents anO(1)-time parallel algorithm for finding all initial palindromes and periods of the string on ann×n reconfigurable mesh (RM). Then, under the same cost (= time × the number of processors =O(n ²)), we provide a partitionable strategy when the RM doesn’t offer sufficient processors; this overcomes the hardware limitation and is very suitable for VLSI implementation. Prof. Chung was supported in part by the National Science Council of R. O. C. under contracts NSC87-2213-E011-001 and NSC87-2213-E011-003.     

火电厂多代理控制系统

针对火电厂非线性、多变量和多控制目标的特点,设计了一个火电厂多代理控制系统(PPMACS).在PP MACS中,前馈控制代理(FFCAs)采用神经模糊系统进行决策,反馈控制代理(FBCAs)采用基于遗传算法的模糊系统进行决策.优化任务分解代理(OTDAs)通过一个优化代理和一个分解代理来进行多目标优化分解PPMACS的任务.协调代理根据运行条件协调PPMACS的各个代理.仿真结果显示了火电厂多代理控制系统能够实现火电单元机组的多目标运行和大范围负荷跟踪.神经网络、模糊逻辑和遗传算法是PPMACS中的智能代理进行决策的有效工具.     

城市主干路交通流多目标优化控制

提出一种城市主干路交通流多目标优化控制方法 ,分析了多目标优化的性能指标及其约束条件 .用线性预估方法预估单个交叉路口下一周期的车流量 ,模糊推算单个路口周期大小 ,用遗传算法优化平均车辆延误 ,获得每个路口的绿信比 ,在此基础上 ,再用遗传算法优化整条主干路的交通流量 ,获得主干路统一周期 ,最后 ,将周期的值根据绿信比分配到每个路口的各个相位 ,控制信号灯的转换 .仿真结果表明该方法优化性能良好 ,性能稳定     

Optimal design of unit hydrographs using probability distribution and genetic algorithms

A nonlinear optimization model is developed to transmute a unit hydrograph into a probability distribution function (PDF). The objective function is to minimize the sum of the square of the deviation between predicted and actual direct runoff hydrograph of a watershed. The predicted runoff hydrograph is estimated by using a PDF. In a unit hydrograph, the depth of rainfall excess must be unity and the ordinates must be positive. Incorporation of a PDF ensures that the depth of rainfall excess for the unit hydrograph is unity, and the ordinates are also positive. Unit hydrograph ordinates are in terms of intensity of rainfall excess on a discharge per unit catchment area basis, the unit area thus representing the unit rainfall excess. The proposed method does not have any constraint. The nonlinear optimization formulation is solved using binary-coded genetic algorithms. The number of variables to be estimated by optimization is the same as the number of probability distribution parameters; gamma and log-normal probability distributions are used. The existing nonlinear programming model for obtaining optimal unit hydrograph has also been solved using genetic algorithms, where the constrained nonlinear optimization problem is converted to an unconstrained problem using penalty parameter approach. The results obtained are compared with those obtained by the earlier LP model and are fairly similar.     

点雨量和面雨量的最优估计

降雨量系随空间位置变化的一种区域化变量,既有随机性,又有一定的结构性。本文应用克里格法对点雨量和面雨量进行了最优估计。由该法得到的估计值符合无偏性,且估计方差最小,因此它比传统常规方法具有较高的可靠性。     

Fat-tree routing and node ordering providing contention free traffic for MPI global collectives

As the size of High Performance Computing clusters grows, so does the probability of interconnect hot spots that degrade the latency and effective bandwidth the network provides. This paper presents a solution to this scalability problem for real life constant bisectional-bandwidth fat-tree topologies. It is shown that maximal bandwidth and cut-through latency can be achieved for MPI global collective traffic. To form such a congestion-free configuration, MPI programs should utilize collective communication, MPI-node-order should be topology aware, and the packet routing should match the MPI communication patterns. First, we show that MPI collectives can be classified into unidirectional and bidirectional shifts. Using this property, we propose a scheme for congestion-free routing of the global collectives in fully and partially populated fat trees running a single job. The no-contention result is then obtained for multiple jobs running on the same fat-tree by applying some job size and placement restrictions. Simulation results of the proposed routing, MPI-node-order and communication patterns show no contention which provides a 40% throughput improvement over previously published results for all-to-all collectives.     

An efficient distributed algorithm for generating and updating multicast trees

As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distributed technique for dynamically updating the multicast tree. The approach proposed has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that the distributed algorithm performs as well as the centralized version, providing good levels of convergence time and communication complexity.     

Next-Generation Grade and Survival Expression Biomarkers of Human Gliomas Based on Algorithmically Reconstructed Molecular Pathways

In gliomas, expression of certain marker genes is strongly associated with survival and tumor type and often exceeds histological assessments. Using a human interactome model, we algorithmically reconstructed 7494 new-type molecular pathways that are centered each on an individual protein. Each single-gene expression and gene-centric pathway activation was tested as a survival and tumor grade biomarker in gliomas and their diagnostic subgroups (IDH mutant or wild type, IDH mutant with 1p/19q co-deletion, MGMT promoter methylated or unmethylated), including the three major molecular subtypes of glioblastoma (proneural, mesenchymal, classical). We used three datasets from The Cancer Genome Atlas and the Chinese Glioma Genome Atlas, which in total include 527 glioblastoma and 1097 low grade glioma profiles. We identified 2724 such gene and 2418 pathway survival biomarkers out of total 17,717 genes and 7494 pathways analyzed. We then assessed tumor grade and molecular subtype biomarkers and with the threshold of AUC > 0.7 identified 1322/982 gene biomarkers and 472/537 pathway biomarkers. This suggests roughly two times greater efficacy of the reconstructed pathway approach compared to gene biomarkers. Thus, we conclude that activation levels of algorithmically reconstructed gene-centric pathways are a potent class of new-generation diagnostic and prognostic biomarkers for gliomas.