一种求解多处理机调度问题的a-平坦化调度算法

在分析多处理机调度问题的基础上,提出了α-平坦的概念,并将其引入到多处理机调度问题中;基于此,提出了一种新的基于α-平坦的求解多处理机调度问题的算法。算法首先对作业集合做平坦化处理,然后再对处理后所得的新问题进行求解,最终获得原调度问题的一个近似解。实验结果表明,通过该算法可以求得较好的结果,相对于其它启发式算法,该算法具有较好的稳定性。     

High-Order Two-Dimension Cluster Competitive Activation Mechanisms Used for Performing Symbolic Logic Algorithms of Problem Solving

This paper presents a neural network approach,based on high-order twodimension temporal and dynamically clustering competitive activation mechanisms,to implement parallel searching algorithm and many other symbolic logic algorithms.This approach is superior in many respects to both the common sequential algorithms of symbolic logic and the common neural network used for optimization problems.Simulations of problem solving examples prove the effectiveness of the approach.     

An Improved Algorithm for Finding the Closest Pair of Points

As early as in 1975, Shamos and Hoey first gave an O（n lg n）-time divide-and-conquer algorithm （Stt algorithm in short） for the problem of finding the closest pair of points. In one process of combination, the Euclidean distances between 3n pairs of points need to be computed, so the overall complexity of computing distance is then 3n lgn. Since the computation of distance is more costly compared with other basic operation, how to improve SH algorithm from the aspect of complexity of computing distance is considered. In 1998, Zhou, Xiong and Zhu improved SH algorithm by reducing this complexity to 2n lg n. In this paper, we make further improvement. The overall complexity of computing distances is reduced to （3n lg n）/2, which is only half that of SH algorithm.     

Algorithm for Solving the Cauchy Problem for a Two-Dimensional Difference Equation with Initial Data Defined in a “Strip”

Programming and Computer Software - In this paper, we propose an algorithm for solving the Cauchy problem for a two-dimensional difference equation with constant coefficients at a point, based on...     

Design of Scheduling Decision Mechanism for Agile Manufacturing System

Design of scheduling decision mechanism is a key issue of scheduling decision method and strategy for agile manufacturing system. Effective scheduling decision mechanism helps to improve the operational agility of manufacturing system. Several scheduling decision mechanisms are discussed, including scheduling forecasting mechanism, cooperation mechanism and cell scheduling mechanism. Also soft decision mechanism is put forward as a promising prospect for agile manufacturing system, and some key techniques in soft decision mechanism are introduced.     

K-Dimensional Optimal Parallel Algorithm for the Solution of a General Class of Recurrence Equations

This paper proposes a parallel algorithm,called KDOP (K-Dimensional Optimal Parallel algorithm),to solve a general class of recurrence equations efficiently.The KDOP algorithm partitions the computation into a series of subcomputations,each of which is executed in the fashion that all the processors work simultaneously with each one executing an optimal sequential algorithm to solve a subcomputation task.The algorithm solves the equations in O(N/P) steps in EREW PRAM model (Exclusive Read Exclusive Write Parallel Random Access Machine model) using p≤N^1-∈ processors,where N is the size of the problem,and ∈ is a given constant.This is an optimal algorithm (its sepeedup is O(p)) in the case of p≤N^1-∈.Such an optimal speedup for this problem was previously achieved only in the case of p≤N^0.5.The algorithm can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems.     

K-Dimensional Optimal Parallel Algorithm for the Solution of a General Class of Recurrence Equations

1IntroductionAlgorithmshavebeenproposedtosolvelinearrecurrencesinparallell1-13].Someofthemsupposeunlimitednumberofprocessorsbeingusedwhileothersuselimitednumberofprocessors.P-M.KoggeandH.S.Stoneproposedarecursivedou-blingalgorithmforthesolutionofageneraJclassofrecuxrenceequationsl1].Itisthefastestalgorithm(thetimeisO(log,N))whenthenumberofprocessingelemelltspiseqllaltoN.Howeveritisnotoptimalintermsofefficiency:itsspeedupisO(de),whileitsefficiencyisO(wt).TherecursivedoublingapproachcanPro…     

Generalization of the Firm’s Profit Maximization Problem: An Algorithm for the Analytical and Nonsmooth Solution

In this paper we present a generalization of the classic Firm’s profit maximization problem, using the linear model for the production function, considering a non constant price and maximum constraints for the inputs. We formulate the problem by previously calculating the analytical minimum cost function. This minimum cost function will be calculated for each production level via the infimal convolution of quadratic functions and the result will be a piecewise quadratic function. To solve this family of optimization problems, we present an algorithm of quasi-linear complexity. Moreover, the resulting cost function in certain cases is not $C^{1}$ and the profit maximization problem will be solved within the framework of nonsmooth analysis. Finally, we present a numerical example.     

Dynamic I/O-Aware Scheduling for Batch-Mode Applications on Chip Multiprocessor Systems of Cluster Platforms简

Efficiency of batch processing is becoming increasingly important for many modern commercial service centers, e.g., clusters and cloud computing datacenters. However, periodical resource contentions have become the major performance obstacles for concurrently running applications on mainstream CMP servers. I/O contention is such a kind of obstacle, which may impede both the co-running performance of batch jobs and the system throughput seriously. In this paper, a dynamic I/O-aware scheduling algorithm is proposed to lower the impacts of I/O contention and to enhance the co-running performance in batch processing. We set up our environment on an 8-socket, 64-core server in Dawning Linux Cluster. Fifteen workloads ranging from 8 jobs to 256 jobs are evaluated. Our experimental results show significant improvements on the throughputs of the workloads, which range from 7% to 431%. Meanwhile, noticeable improvements on the slowdown of workloads and the average runtime for each job can be achieved. These results show that a well-tuned dynamic I/O-aware scheduler is beneficial for batch-mode services. It can also enhance the resource utilization via throughput improvement on modern service platforms.     

The study of chiral recognition between β-cyclodextrin and α-cyclohexyl-mandelic acid stereisomers by computer simulation

运用量子力学PM3方法模拟α-环己基扁桃酸((R/S)-CHMA)与β-环糊精(β-CD)的主客体相互作用,探讨(R/S)-CHMA在β-CD上的手性识别机理.模拟结果能够准确预测色谱出峰顺序从而能从原子层次上对手性识别机制给予理论解释.PM3方法的计算结果表明:(S)-CHMA与β-CD形成的结合物比(R)-CHMA与β-CD形成的结合物稳定.从模拟包结物的构型可以看出(R/S)-CHMA与β-CD结合方式完全不同:(R)-CHMA是将苯环插入β-CD空腔形成包结物,而(S)-CHMA是将环己基插入β-CD空腔形成包结物.此外,(S)-CHMA除了自身的分子内氢键外,与β-CD分子之间还存在分子间氢键作用;而(R)-CHMA与β-CD之间没有分子间氢键作用.从而说明疏水作用以及弱的分子间氢键作用是造成手性识别的主要驱动力.