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

LATTICE SPIN MODELS AND NEW ALGORITHMS — A REVIEW OF MONTE CARLO COMPUTER SIMULATIONS

International Journal of Modern Physics C 1990年第1期1卷 91-117页

作者： CLIVE F. BAILLIE Concurrent Computation Project California Institute of Technology Pasadena CA 91125 USA

We review Monte Carlo computer simulations of spin models — both discrete and continuous. We explain the phenomenon of critical slowing which seriously degrades the efficiency of standard local Monte Carlo algorithms such as the Metropolis algorithm near phase transitions. We then go onto describe in detail the new algorithms which ameliorate the problem of critical slowing down, and give their dynamical critical exponent values.

关键词： Spin Models Monte Carlo Metropolis Over-relaxed Cluster Critical Slowing Down

来源：评论

学校读者我要写书评

暂无评论

CODE GENERATION BY A GENERALIZED NEURAL NETWORK - GENERAL-PRINCIPLES AND ELEMENTARY EXAMPLES

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1989年第2期6卷 388-410页

作者： FOX, GC KOLLER, JG Caltech Concurrent Computation Project Caltech 158-79 Pasadena California 91125 USA

We discuss the possibility of using neural network optimization to perform optimized code generation, and list possible benefits. The approach used by Hopfield and Tank to treat the traveling salesman is extended to cover the motion of abstract quantities through a computer. A simple general method for constructing complicated syntactic constraints is introduced, applicable to both sequential and parallel target architectures. We test the approach on some very elementary examples of sequential code, by simulation.

关键词： Systems Science and Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Portable programming within a message-passing model: The FFT as an example 3

Portable programming within a message-passing model: The FFT...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Walker, David W. Concurrent Computation Project 206-49 Caltech PasadenaCA91 125 United States

ISBN: (纸本)0897912780

This paper describes a portable programming environment for MIMD concurrent processors based on an object-oriented, message-passing para digm. The basis of this environment is the Virtual Machine Loosely Synchronous Communication System (VMLSCS) which is designed to be used for loosely synchronous prcblems. VMLSCS is structured to make efficient use of hierarchical memory, and permits communication and calculation to be overlapped on certain concurrent processors. As an example, the use of VMLSCS in performing both one-dimensional and multi-dimensional fast Fourier transforms (FFTs) on concurrent multiprocessors is described. It is shown that all necessary interprocessor communication can be performed by a single routine, vmindex. Thus the construction of a portable concurrent FFT rests on the implementation of vmindex on the target machines. In the multidimensional algorithm at strip decomposition is applied to each of the directions in turn so that each of the FFTs performed in a particular direction are done in one processor. This allows fast sequential one-dimensional FFTs to be exploited. The implementation of vmindex on both homogeneous and inhomogeneous hypercubeis, and shared memory multiprocessors is discussed. © ACM 1988 0-89791-278-0/88/0007/1592.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

concurrent multiple target tracking 3

Concurrent multiple target tracking

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Gottschalk, Thomas D. Caltech Concurrent Computation Project California Institute of Technology PasadenaCA91125 United States

ISBN: (纸本)0897912780

A concurrent algorithm for multiple target tracking is presented. The underlying tracking formalism is first described by way of a sequential program, and the issues in generalizing the tracker for efficient concurrent implementations are discussed in detail. Typical tracking results on the Mark III hypercube are presented. © ACM 1988.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

DIME: A programming environment for unstructured triangular meshes on a distributed-memory parallel processor 3

DIME: A programming environment for unstructured triangular ...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Williams, Roy D. Concurrent Computation Project California Institute of Technology 356-48 PasadenaCA91125 United States

ISBN: (纸本)0897912780

DIME (Distributed Irregular Mesh Environment) is a user environment written in C for manipulation of an unstructured triangular mesh in two dimensions. The mesh is distributed among the separate memories of the processors, and communication between processors is handled by DIME;thus the user writes C-code referring to the elements and nodes of the mesh and need not be unduly concerned with the parallelism. A tool is provided for the user to make an initial coarse triangulation of a region, which may then be adaptively refined and loadbalanced. DIME provides many graphics facilities for examining the mesh, including contouring and a Postscript hard-copy interface. DIME also runs on sequential machines. © ACM 1988 0-89791-278-0/88/0007/1592.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Chemical reaction dynamics: Integration of coupled sets of ordinary differential equations on the Caltech hypercube 3

Chemical reaction dynamics: Integration of coupled sets of o...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Hipes, Paul G. Mattson, Tim Wu, Mark Y.-S. Kuppermann, Aron Caltech Concurrent Computation Project 206-49 California Institute of Technology PasadenaCA91125 United States

ISBN: (纸本)0897912780

Use of the Caltech/JPL hypercube multicomputer to solve problems in chemical dynamics is the subject of this paper. The specific application is quantum mechanical atom diatomic molecule reactive scattering. One methodology for solving this dynamics problem on a sequential computer is based on symmetrized hyperspherical coordinates. We will discuss our strategy for implementing the hyperspherical coordinate methodology on the hypercube. In particular, the performance of a parallel integrator for the special system of ordinary differential equations which arises in this application is discussed. © ACM 1988.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

Statistical gravitational lensing on the Mark III hypercube 3

Statistical gravitational lensing on the Mark III hypercube

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Apostolakis, John Kochanek, Christopher S. Caltech Concurrent Computation Project Cultech256-48 United States Theoretical Astrophysics Caltech 130-33 PasadenaCA91125 United States

ISBN: (纸本)0897912780

We describe a parallel algorithm for the nonlinear optics problem of gravitational lensing. The method is a "ray-tracing" method which studies the statistical properties of the image population associated with a gravitational lens. A parallel computer is needed because the spatial resolution requirements of the problem make the program too large to run on conventional machines. The program is implemented on the Mark III hypercube to take maximum advantage of this machine's 128 Mbytes of memory. The concurrent implementation uses a scattered domain decomposition and the CrOS III communications routines. The communications in the problem are so irregular that no completely satisfactory implementation was made in terms of the execution time of the program: the maximum speed-up relative to a sequential implementation is a factor of 4 on a 32 node machine. However, the goal of efficiently using all of the Mark III's memory was achieved, and the execution time was not the limiting factor in the problem. If the crystal router were used, the implementation would be much more efficient. Development of the program was terminated at this stage, however, because we were able to extract the physics of interest without the more sophisticated communications routines. © ACM 1988.

关键词： Population statistics

来源：评论

学校读者我要写书评

暂无评论

The flux-corrected transport algorithm on the NCUBE hypercube 3

The flux-corrected transport algorithm on the NCUBE hypercub...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Walker, David W. Fox, Geoffrey C. Moritry, Gary R. Concurrent Computation Project 206-49 California Institute of Technology PasadenaCA91 125 United States Sandia National Laboratory AlbuquerqueNM87185 United States

ISBN: (纸本)0897912780

This work describes the implementation of a finite-difference algorithm, incorporating the flux-corrected transport technique, on the NCUBE hypercube. The algorithm is used to study twodimensional, convectively-dominated fluid flows, and as a sample problem the onset and growth of the Kelvin-Helmholta instability is investigated. Timing results are presented for a number of different sized problems on hypercubes of dimension up to 9. These results are interpreted by means of a simple performance model. The extension of the algorithm to the three-dimensional case is also discussed. © ACM 1988.

关键词： Flow of fluids

来源：评论

学校读者我要写书评

暂无评论

Gauss-Jordan inversion with pivoting on the caltech mark II hypercube 3

Gauss-Jordan inversion with pivoting on the caltech mark II ...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Hipes, Paul G. Kuppermann, Aron Caltech Concurrent Computation Project 206-49 California Institute of Technology PasadenaCA91125 United States Arthur Amos Noyes Laboratory of Chemical Physics 127-72 California Institute of Technology PasadenaCA91125 United States

ISBN: (纸本)0897912780

The performance of a parallel Gauss-Jordan matrix inversion1,2 algorithm on the Mark II hypercube3 at Caltech is discussed. We will show that parallel Gauss-Jordan inversion is superior to parallel Gaussian elimination for inversion, and discuss the reasons for this. Empirical and theoretical efficiencies for parallel Gauss-Jordan inversion as a function of matrix dimension for different numbers and configurations of processors are presented. The theoretical efficiencies are in quantiLzz agreement with the empirical efficiencies. © ACM 1988 0-89791-278-0/88/0007/1592.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Supersonic fluid flow in parallel with an unstructured mesh

引用

Concurrency: Practice and Experience 1989年第1期1卷 51-62页

作者： Williams, Roy D. Concurrent Computation Project California Institute of Technology Pasadena California 91125 United States

An algorithm has been implemented for time‐accurate solutions of the two‐dimensional compressible Euler equations using an irregular triangular mesh. The code runs on distributed or shared memory or sequential machines, and is written using the Distributed Irregular Mesh Environment (DIME). DIME is a programming environment for calculations with such meshes, with adaptive mesh refinement and dynamic load balancing. Results are presented for an example of a Mach 3 flow over a step, computed with a 32‐processor NCUBE hypercube. Copyright © 1989 John Wiley & Sons, Ltd

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：