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

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1993年第4期6卷 299-304页

作者： TAN, CC FUSCO, VF The Queen's University of Belfast Department of Electrical & Electronic Engineering Ashby Building Stranmillis Road Belfast BT9 5AH U.K. Chun Chia Tan obtained a first-class honours degree from The Queen's University of Belfast. He was awarded an IEE prize for best final-year project. His current research interests include the modelling of electromagnetic fields using parallel processing techniques. At present Mr Tan is working as an electrical engineer in Malaysia. Vincent F. Fusco was educated at The Queen's University of Belfast where he obtained the degree of Ph.D. He has worked as a research engineer on short-range radar and radio telementry systems. Currently he is a Reader in Microwave Commnications in the School of Electrical Engineering and Computer Science The Queen's Univeristy of Belfast. His current research interests include non-linear microwave circuit simulation and concurrent programming techniques for electromagnetic field problems. He has acted as consultant to a number of major companies and has published numerous research papers in these areas. He is author of the bookMicrowave Circuits Analysis and Computer Aided Design(Prentice Hall 1987). Dr Fusco is a Chartered Electrical Engineer and a Member of the Institute of Electrical Engineers.

A major limitation of the transmission-line matrix (TLM) method used to solve Maxwell's equations is the long computation time required. The TLM scattering calculations involved can, however, be viewed as parallel in nature. This paper describes an effort to reduce computational time by using an SIMD, DAP multiprocessor computer employed to solve a two-dimensional TLM electromagnetic field formulation. A parallel algorithm based on the TLM scattering algorithm is designed and implemented using FORTRAN-PLUS Enhanced on an AMT DAP 510 machine. Here the connectivity of the DAP is exploited to simulate the intrinsic scattering behaviour on which the TLM algorithm relies. The results show that parallel processing on an SIMD machine such as the DAP is advantageous, especially for higher-order mesh sizes.

关键词： Electric lines

来源：评论

学校读者我要写书评

暂无评论

THE SHARED MEMORY HYPERCUBE

引用

parallel COMPUTING 1988年第2期6卷 235-245页

作者： BROOKS, ED Parallel Processing Project CP-Division Lawrence Livermore National Laboratory Livermore CA 94550 U.S.A.

We investigate the use of a hypercube packet switching network as a shared memory server for vector multiprocessors. Using the generalization of a high performance switch node introduced in an earlier paper, we develop a packet switched memory server capable of providing high bandwidth vector access to a shared memory. The network exhibits adaptive behavior, absorbing conflicts as a vector operation proceeds, and delivers full vector bandwidth to all processors simultaneously. In addition to its vector performance, the hypercube has another feature that makes it attractive as a shared memory server. The memory words are not equidistant from the processors. A hierarchy of distances occurs. By taking advantage of this one can provide segments of fast access memory within the global shared memory environment. This makes the shared memory hypercube very promising as a general purpose parallel computer.

关键词： Hypercubes memory bandwidth multiprocessor memories packet switched networks shared memory multiprocessors vector multiprocessors

来源：评论

学校读者我要写书评

暂无评论

THE INDIRECT K-ARY N-CUBE FOR A VECTOR processing ENVIRONMENT

引用

parallel COMPUTING 1988年第3期6卷 339-348页

作者： BROOKS, ED Parallel Processing Project C.P. Division Lawrence Livermore National Laboratory Livermore CA 94550 U.S.A.

In an earlier paper we introduced an indirect binary n -cube memory server network which has adaptive properties making it useful in a parallel vector processing environment. The memory server network, due to a special choice in the design of the basic switch node, has the property that N vector processors issuing vector fetches with similar strides are forced into lock step after an initial startup investment. In this paper we extend this work to the case of the indirect k -any n -cube. As this network has a more favorable memory latency scaling of log k N , one expects that the short vector performance will be improved as k is increased for a given N . We find this to be the case. We also find that the cost of the memory server system scales in a manner which prefers modest values of k above 2.

关键词： memory bandwidth multiprocessor memories packed switched networks Shared memory multiprocessors vector multiprocessors

来源：评论

学校读者我要写书评

暂无评论

A BUTTERFLY PROCESSOR-MEMORY INTERCONNECTION FOR A VECTOR processing ENVIRONMENT

引用

parallel COMPUTING 1987年第1期4卷 103-110页

作者： BROOKS, ED Parallel Processing Project Lawrence Livermore National Laboratory Livermore CA 94550 U.S.A.

A fundamental hurdle impeding the development of large N common memory multiprocessors is the performance limitation incurred in the switch connecting the processors to the memory modules. Multistage networks currently considered for this connection have a memory latency which grows like α log 2 N . For scientific computing, it is natural to look for a multiprocessor architecture that will enable the use of vector operations to mask memory latency. The problem to be overcome here is the chaotic behavior introduced by conflicts occurring in the switch. In this paper we examine the performance of the butterfly or indirect binary n -cube network in a vector processing environment. We describe a simplemodification of the standard 2 × 2 switch node used in such networks. This local modification to the switch node endows the network with a surprising global property. It adaptively removes chaotic behavior during a vector operation.

关键词： butterfly interconnection Multiprocessor architecture switching network vector processing

来源：评论

学校读者我要写书评

暂无评论

Industrial machine vision: lessons and challenges

引用

Optics News 1987年第2期13卷 12-17页

作者： Steven W. Holland Robert B. Tilove STEVEN W. HOLLAND is an assistant department head in the Computer Science Dept. of General Motors Research Laboratories (GMR). He is responsible for research projects involving computer vision robotics mobile robotics process planning knowledge systems natural language advanced programming environments parallel processing and statistics. ROBERT B. TILOVE is senior staff research scientist and project leader of the machine perception project at GMR. His research interests include geometric modeling model-based programming and control of intelligent automation systems.

No abstract available.

关键词： Integral imaging Machine vision Measurement and metrology Optical systems Sensors Statistics

来源：评论

学校读者我要写书评

暂无评论

EFFECTS OF SYNCHRONIZATION BARRIERS ON MULTIPROCESSOR PERFORMANCE

引用

parallel COMPUTING 1986年第2期3卷 129-140页

作者： AXELROD, TS Parallel Processing Project Lawrence Livermore National Laboratory Livermore CA 94550 U.S.A.

Synchronization barriers are frequently required by numerical algorithms for multiprocessors. When the number of processors becomes large these barriers may cause significant performance degradation. This paper examines the performance of two alternative types of synchronization barriers using simulation tools. It is found that the performance of a recently proposed ‘butterfly’ barrier is significantly higher than the more traditional ‘two lock’ barrier.

关键词： butterfly barrier MIMD computer performance analysis synchronization barrier two lock barrier

来源：评论

学校读者我要写书评

暂无评论

parallelIZING CONJUGATE-GRADIENT FOR THE CRAY X-MP

引用

parallel COMPUTING 1986年第1期3卷 35-47页

作者： SEAGER, MK Parallel Processing Project University of California Lawrence Livermore National Laboratory Livermore CA 94550 U.S.A.

A standard preconditioned conjugate gradient algorithm for the solution of symmetric linear systems is studied in the context of multiprocessing. A totally parallel approach is taken based on a computational model of an MIMD machine with shared global memory. In order to assure mathematical correctness of the algorithm, four barrier syncs are required during each iteration. Large linear systems are solved with this parallel adaptation of conjugated gradient and efficiencies near one observed on the CRAY X-MP24 running COS 1.13. Further, segments of the code which could be considered independent (i.e. between syncs) clocked in at speedups very close to the number of tasks. The latter indicates that the loss efficiency in this implementation of the algorithm on the X-MP24 is connected with the cost of barrier syncs. On the CRAY X-MP48 running COS 1.15 similar results are observed utilizing two CPU's. When all four CPU's execute parallel tasks in vector mode memory bank conflicts cause a 30% loss of overall speedup.

关键词： conjugate gradient CRAY X-MP multiprocessor parallel algorithm speed-up analysis

来源：评论

学校读者我要写书评

暂无评论

OVERHEAD CONSIDERATIONS FOR parallelIZING CONJUGATE-GRADIENT

引用

COMMUNICATIONS IN APPLIED NUMERICAL METHODS 1986年第3期2卷 273-279页

作者： SEAGER, MK Parallel Processing Project University of California Lawrence Livermore National Laboratory Livermore California U.S.A.

A standard preconditioned conjugate gradient (PCG) algorithm for the solution of symmetric linear systems is studied in the context of multi-processing. It has been observed that the overheads associated with parallel processing can be expensive. Several alternative approaches are taken in order to try to minimize this cost. Examples are given for Cray X-MP class machines using CRI's standard multitasking library and a new micro-tasking compiler preprocessor. These approaches to utilizing multiple CPU's are discussed and overhead measurements given. The quite different PCG implementations under multitasking and micro-tasking are discussed and compared.

关键词： Computer systems, Digital

来源：评论

学校读者我要写书评

暂无评论

FLAT IS NOT NECESSARILY GOOD.

FLAT IS NOT NECESSARILY GOOD.

引用

Computers in Engineering 1985, Proceedings of the 1985 ASME International Computers in Engineering Conference and Exhibition.

作者： Balaban, D.J. Nelson, D.O. Lawrence Livermore Natl Lab Parallel Processing Project Livermore CA USA Lawrence Livermore Natl Lab Parallel Processing Project Livermore CA USA

The disciplines of software engineering and expert system building seem very different from each other. The software engineer describes a system in terms of its interactions with a simplified version of the world around it. The expert system builder describes a system in terms of knowledge acquired from an available expert and strategies for exploiting that knowledge. This perceived difference is due in large part to a difference in the complexity of the world being modeled. We explore the relationship between these two disciplines and describe means by which new AI techniques can be directly used to extend software engineering methodologies without also importing deficiencies inherent in rule-based expert systems.

关键词： COMPUTER SOFTWARE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：