Parallelism in ILU-preconditioned GMRES

A parallel implementation of the preconditioned GMRES method is described. The method is used to solve the discretized incompressible Navier–Stokes equations. A parallel implementation of the inner product is given, which appears to be scalable on a massively parallel computer. The most difficult part to parallelize is the ILU-preconditioner. We parallelize the preconditioner using ideas proposed by Bastian and Horton (P. Bastian, G. Horton, SIAM. J. Stat. Comput. 12 (1991) 1457–1470). Contrary to some other parallel methods, the required number of iterations is independent of the number of processors used. A model is presented to predict the efficiency of the method. Experiments are done on the Cray T3D, computing the solution of a two-dimensional incompressible flow. Predictions of computing time show good correspondence with measurements.     

PROVOX系统在间歇反应聚丙烯装置上的应用

本文简要介绍了费希尔－罗斯蒙特公司的ＰＯＶＯＸ系统特点，以及在间歇反应聚丙烯装置中的应用。     

The column protocol: A high availability and low message cost solution for managing replicated data

This paper presents a quorum-based replica control protocol which is resilient to network partitioning. In the best case, the protocol generates quorums of a constant size. When some replicas are inaccessible, the quorum size increases gradually and may be as large as O(n), where n is the number of replicas. However, the expected quorum size is shown to remain constant as n grows. This is a desirable property since the message cost for accessing replicated data is directly proportional to the quorum size. Moreover, the availability of the protocol is shown to be comparably high. With the two properties—constant expected quorum size and comparably high availability—the protocol is thus practical for managing replicated data.     

一种用户行为分析的动态备份机制

目前大多数分布式存储系统采用静态备份机制保证系统的高可靠性,灵活性差,不适合系统规模及用户访问量不断变化的存储系统．因此提出一种基于用户行为分析的动态备份机制,通过分析用户行为获得相关信息来动态改变备份数量及确定备份位置,具有较强的灵活性,适合大规模的分布式存储系统;实现动态备份系统将其应用于已建立的科技信息数据中心．通过实验分析表明,该动态备份机制能提高系统的可靠性。     

Semi-automated user agents in distributed change management

Flexible integration of distributed design and manufacturing activities is one of the key issues in applying just-in-time principles along the logistics chain. The potential of AI based approaches in this field is clear, but the inherent asynchrony, concurrency, and inconsistency of distributed operations has reduced enthusiasm so far.This paper discusses coordination in the context of geographically distributed manufacturing of one-of-a-kind products. Cooperation of partners is based on semi-automated user agents which operate as an integrative layer between more dedicated tools and systems. The management of order changes in elevator manufacture is used as a case example.The work reported here is part of the DIMUN project (DIMUN, 1989) in the RACE program.     

Mathematical model and discrete artificial Bee Colony algorithm for distributed integrated process planning and scheduling

With the development of the globalization of economy and manufacturing industry, distributed manufacturing mode has become a hot topic in current production research. In the context of distributed manufacturing, one job has different process routes in different workshops because of heterogeneous manufacturing resources and manufacturing environments in each factory. Considering the heterogeneous process planning problems and shop scheduling problems simultaneously can take advantage of the characteristics of distributed factories to finish the processing task well. Thus, a novel network-based mixed-integer linear programming (MILP) model is established for distributed integrated process planning and scheduling problem (DIPPS). The paper designs a new encoding method based on the process network and its OR-nodes, and then proposes a discrete artificial bee colony algorithm (DABC) to solve the DIPPS problem. The proposed DABC can guarantee the feasibility of individuals via specially-designed mapping and switching operations, so that the process precedence constraints contained by the network graph can be satisfied in the entire procedure of the DABC algorithm. Finally, the proposed MILP model is verified and the proposed DABC is tested through some open benchmarks. By comparing with other powerful reported algorithms and obtaining new better solutions, the experiment results prove the effectiveness of the proposed model and DABC algorithm successfully.     

Randomized function evaluation on a ring

LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:

Screening model for assessing ‘cost’ of minimum flow requirements in the Svartå River,Sweden

The minimum flow requirements in the Svartå River in Sweden are directed at maintaining fishlife and providing suitable dilution for waste flows. The implications of varying the minimum flow requirements in the river are examined using a mixed integer optimisation model. The model is formulated as a modified method-of-weights technique with the economic issues of hydro-electricity generation, irrigation and urban water supply placed in the objective function and the minimum flows specified within the constraint set. The integer component of the model is required to model the operating policy at the major flow regulation facility in the system and the restricted validity of the irrigation permits. Application of the model shows that in dry years where competition between minimum flow levels and the other economic uses, is most intense, the levels achieved by the various economic objectives are only slightly reduced even with significant increases in the minimum flow requirements. Variations in minimum flow requirements of up to 45% only produce changes of 10% or less in the economic objectives. The lack of sensitivity of the objective levels is due primarily to the level of control exerted indirectly on the whole system in dry years by the release regulation policy and the restricted validity of the irrigation permits. In normal to wet years these policies are not as restrictive and more choice is available. In such years, however, there is generally sufficient water to satisfy all requirements and allocation is not a critical issue. The model itself is formulated generally so that a range of scenarios beyond those examined specifically in the paper can be considered.     

Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.