检索结果-内蒙古大学图书馆

4th European Conference on parallel Virtual Machine and Message Passing Interface, PVM/MPI 1997

作者： Clematis, A. Coda, A. Spagnuolo, M. Mineter, M. Sloan, T. Istituto per la Matematica Applicata CNR Via De Marim 6 Genova16149 Italy Geography Department Drummond Street Edinburgh United Kingdom Edinburgh Parallel Computing Centre King's Buildings Edinburgh United Kingdom

ISBN: (纸本)3540636978

In the application context of spatial data analysis, several parallelisation strategies are proposed for algorithms which are characterized by the non-locality of computation and by the iterative nature of the data processing. Different parallelisation approaches are presented and the methods developed for Cray T3D using the MPI message passing library are briefly compared to a workstation-network solution. The better results in the two environments are obtained following different strategies. The lesson learned is that MPI and other message passing libraries provide valuable help for portability, but the development of efficient and portable parallel software needs the availability of higher level approaches supporting different parallelisation strategies in a simple and effective way. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT MULTICAST WITH TRAFFIC-BALANCING IN HYPERCUBES∗ This work was partially supported by Australia Research Council under its Small Grants Scheme.∗

引用

parallel Algorithms and Applications 1997年第3-4期11卷 287-298页

作者： Hong Shen[a] David J. Evans[b] Jia You[a] [a] School of Computing and Information Technology Griffith University Nathan QLD Australia [b] Parallel Algoritms Research Centre Loughborough University of Technology Leicestershire U.K.

Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps the amount of traffic small, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity ofO(nN) for fault-tolerant multicasting in a hypercube ofN= 2nprocessors containing an arbitrary number of faulty processors.

关键词： Communication fault-tolerance hypercube multicast time traffic

来源：评论

学校读者我要写书评

暂无评论

BULK-SYNCHRONOUS parallel ALGORITHMS FOR QR AND QZ MATRIX FACTORISATION

引用

parallel Algorithms and Applications. 1997年第1-2期11卷 97-112页

作者： RADU CALINESCU DAVID J. EVANS [a] Programming Research Group Oxford University Computing Laboratory Oxford 0X1 3QD UK [b] Parallel Algorithms Research Centre Loughborough University of Technology Loughborough Leicestershire LE11 3TU UK

This paper presents bulk-synchronous parallel (BSP) algorithms for linear system solving through QR and QZ factorisation. The two new algorithms are analysed in terms of the BSP cost model, and portable implementations of the QR and QZ decomposition methods are devised using the Oxford BSP Library. The experimental results obtained on a shared-memory multiprocessor accurately match the theoretical predictions, permitting a thorough comparison of the two algorithms.

关键词： linear system solving QR factorisation QZ factorisation bulk-synchronous parallel model

来源：评论

学校读者我要写书评

暂无评论

A CLASS OF MULTI-PARAMETER RELAXED parallel MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

引用

parallel Algorithms and Applications. 1997年第1-2期11卷 113-127页

作者： ZHONG-ZHI BAI D. J. EVANS DE-REN WANG [a] State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Chinese Academy of Sciences Beijing P.R. China [b] Parallel Algorithms Research Centre Loughborough University of Technology Loughborough Leicestershire LE11 3TU U.K England U.K. [c] Department of Mathematics Shanghai University (Jiading Campus) Shanghai 201800 P.R China

We set up a class of multi-parameter relaxed parallel matrix multisplitting methods for solving the linear complementarity problems on the SIMD multiprocessor systems. This class of methods can not only includes all the existing relaxed methods for the linear complementarity problems, but also can yields a lot of novel ones in the sense of multisplitting. Thus, it is reasonably general. We set up the convergence theory of these relaxed methods under the condition that the system matrix is an H-matrix with positive diagonal elements.

关键词： linear complementarity problem matrix multisplitting relaxation method convergence theory H-matrix

来源：评论

学校读者我要写书评

暂无评论

Using performance analysis to identify candidate operations for GIS software parallelization

引用

Transactions in GIS 1997年第4期2卷 347-360页

作者： Sloan, T.M. Gittings, B.M. Healey, R.G. Edinburgh Parallel Computing Centre JCMB King's Buildings The University of Edinburgh Mayfield Road Edinburgh EH9 3JZ United Kingdom. Department of Geography University of Edinburgh Drummond Street Edinburgh EH8 9XP United Kingdom. Department of Geography University of Portsmouth Buckingham Building Lion Terrace Portsmouth PO1 3HE United Kingdom.

This paper examines the potential impact of parallel computing on the computational performance of GIS. Performance analyses on existing GIS operations, vector topology creation and interpolation, in commerical GIS products in a serial environment are used to work out the critical computational factors that determine elapsed time performance. Analyses reveal that the extraction of all data necessary to perform a GIS operation at a particular geographical locality dominates the I/O and CPU resource usage. For GIS to benefit from parallel computing, the performance of this task must be addressed.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

Design of a distributed software architecture for an intelligent planning system

引用

IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS 1996年第2期143卷 125-131页

作者： Flavell, SJ Winter, SC Wilson, DR Hart, ER Centre for Parallel Computing University of Westminster London United Kingdom

The paper describes the design of a distributed software architecture for an intelligent planning system based on a process model of cognitive systems (PMCS). PMCS is described in terms of its problem-solving behaviour and structure, and is illustrated through a simple case study in robotics. In the PMCS autonomous knowledge sources, implementing a component of the functionality, co-operate by message-passing in order to maintain a distributed model of the system's environment and to synthesise decisions based on the model. Simulation tools developed at the University of Westminster for the rapid prototyping of parallel systems have been used to simulate the software architecture based on PMCS. Simulation results for the planning case study are presented in order to demonstrate the effectiveness of PMCS in solving planning problems in a distributed manner.

关键词： planning systems high-performance computing distributed processing software architecture co-operating knowledge-based systems computer system simulation

来源：评论

学校读者我要写书评

暂无评论

Progress toward a mining strategy based on mineral leaching with secondary recovery

引用

APPLIED MATHEMATICAL MODELLING 1996年第1期20卷 16-25页

作者： Forbes, LK Centre for Industrial and Applied Mathematics and Parallel Computing (CIAMP) Department of Mathematics University of Queensland Queensland Australia

The leaching of a mineral from the ground is considered using injection and recovery holes drilled into the rock. In this simplified analysis, the holes are arranged vertically and an appropriate caustic leaching fluid is introduced into the uppermost hole. The leaching liquor percolates down through the rock, dissolving the mineral of interest, and is pumped out when it arrives at the second hole. Water is introduced at the bottom hole in an attempt to increase the feasible recovery fraction of mineral-bearing liquor. Tire model problem is solved numerically using a boundary-integral formulation. Maximum feasible recovery fractions for the leaching fluid are obtained and their dependence upon the separation distance between the injection and recovery points and upon the pumping rate for water at the bottom hole are studied The volume of rock inundated by the leaching liquor is assessed, and a possible practical strategy for in situ leaching of low-grade ores is proposed.

关键词： mineral leaching water balloon boundary-integral method

来源：评论

学校读者我要写书评

暂无评论

Real-time speed of a conservative parallel simulation 29

Real-time speed of a conservative parallel simulation

引用

29th Hawaii International Conference on System Sciences, HICSS 1996

作者： Kalantery, N. Centre for Parallel Computing University of Westminster London United Kingdom

ISBN: (纸本)0818673249

Thispaper examines the real time speed of the conservative parallel simulation of a telecommunications network Real time speed isdefinedas the ratio ofthe simulatedtime to the execution time. A generic simulation model o f s 7 networks is executed under the conservative mechanism.A technique used to secure a stable lower bound on the speed of the simulator is introduced and analped Using this technique simulation models ranging in size,$-om16 to 64 nodes, are executed on similarly sized and configured transputer *** data on the real timeperjormance of the system are presented The results confrm that the speed of the simulator is both stable and scalable: independent of work load density and size of the modelled network, simulation of a given period of model activity is achieved within apredeterminedperiod ofreal time. © 1996 IEEE

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

Implementing distributed shared memory on top of MPI: The DSMPI library 4

Implementing distributed shared memory on top of MPI: The DS...

引用

4th Euromicro Workshop on parallel and Distributed Processing, PDP 1996

作者： Silva, L.M. Silva, J.G. Chapple, S. Coimbra Univ. Portugal Edinburgh Parallel Computing Centre United Kingdom

ISBN: (纸本)0818673761

Distributed shared memory has been recognized as an alternative programming model to exploit the parallelism in distributed memory systems since it provides a higher level of abstraction than simple message passing. DSM combines the simple programming model of shared-memory with the scalability of distributed memory machines. This paper presents DSMPI, a parallel library that runs atop of MPI and provides a distributed shared memory abstraction. It provides an easy-To-use programming interface, is flexible, portable and supports heterogeneity. Moreover, it supports different coherence protocols and models of consistency. We present some performance results taken in a network of workstations and in a Cray T3D which show that DSMPI can be competitive with MPI for some applications. © 1996 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Automatic parallelization of the AVL FIRE benchmark for a distributed-memory system 2nd

Automatic parallelization of the AVL FIRE benchmark for a di...

引用

2nd International Workshop on Applied parallel computing in Computations in Physics, Chemistry and Engineering Science, PARA 1995

作者： Brezany, Peter Sipkova, Viera Chapman, Barbara Greimel, Robert Institute for Software Technology and Parallel Systems Austria European Centre for Parallel Computing at Vienna University of Vienna Liechtensteinstrasse 22 ViennaA-1092 Austria AVL List GmbH Kleiststrasse 48 GrazA-8020 Austria

ISBN: (纸本)3540609024

Computational fluid dynamics (CFD) is a Grand Challenge discipline whose typical application areas, like aerospace and automotive engineering, often require enormous amount of computations. parallel processing offers very high performance potential, but irregular problems like CFD have proven difficult to map onto parallel machines. In such codes, access patterns to major data arrays are dependent on some runtime data, therefore runtime preprocessing must be applied on critical code segments. So, automatic parallelization of irregular codes is a challenging problem. In this paper we describe parallelizing techniques we have developed for processing irregular codes that include irregularly distributed data structures. These techniques have been fully implemented within the Vienna Fortran Compilation System. We have examined the AVL FIRE benchmark solver GCCG, to evaluate the influence of different kinds of data distributions on parallel-program execution time. Experiments were performed using the Tjunc dataset on the iPSC/860. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：