Conference on Hypercube Concurrent Computers and Applications最新文献

Task allocation onto a hypercube by recursive mincut bipartitioning 通过递归最小分割双分区将任务分配到超立方体上

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1990-08-01 DOI: 10.1145/62297.62323

F. Erçal, J. Ramanujam, P. Sadayappan

引用次数: 154

Portable programming within a message-passing model: the FFT as an example 消息传递模型中的可移植编程:以FFT为例

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63100

D. Walker

{"title":"Portable programming within a message-passing model: the FFT as an example","authors":"D. Walker","doi":"10.1145/63047.63100","DOIUrl":"https://doi.org/10.1145/63047.63100","url":null,"abstract":"This paper describes a portable programming environment for MIMD concurrent processors based on an object-oriented, message-passing paradigm. The basis of this environment is the Virtual Machine Loosely Synchronous Communication System (VMLSCS) which is designed to be used for loosely synchronous problems. 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, vm_index. Thus the construction of a portable concurrent FFT rests on the implementation of vm_index on the target machines. In the multi-dimensional algorithm a 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 vm_index on both homogeneous and inhomogeneous hypercubes, and shared memory multiprocessors is discussed.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117340734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Optimal matrix algorithms on homogeneous hypercubes 齐次超立方体上的最优矩阵算法

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63125

G. Fox, W. Furmanski, D. Walker

引用次数: 13

An interactive system for seismic velocity analysis 地震速度分析交互系统

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63067

C. Addison, J. M. Cook, L. R. Hagen

引用次数: 1

Use of the hypercube for symbolic quantum chromodynamics 符号量子色动力学中超立方体的使用

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63097

A. Kolawa, G. Fox

引用次数: 1

Design and implementation of a concurrent image processing workstation based on the Mark III hypercube 基于Mark III超立方体的并行图像处理工作站的设计与实现

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63086

S. Groom, M. Lee, A. Mazer, W. Williams

{"title":"Design and implementation of a concurrent image processing workstation based on the Mark III hypercube","authors":"S. Groom, M. Lee, A. Mazer, W. Williams","doi":"10.1145/63047.63086","DOIUrl":"https://doi.org/10.1145/63047.63086","url":null,"abstract":"Various image processing algorithms have been implemented on the hypercube architecture and many success stories have been reported. However, the traditional approach to programming the hypercube has been to write programs which perform ;I single operation or a fixed set of operations upon data items. This approach has several drawbacks when considered for use in an interactive computing environment. First, it is difficult to process data with a sequence of sim;ple programs in the Mark III Hypercube because the Mark III software does not support sharing of data between successive programs. This means that data must be reloaded into the cube for each individual program. It also implies that programs should be fairly large and complete, to minimize the repeated downloading of large data items for multiple programs. However, the entire program must be able to fit within the hypercube node memory, which limits what a program can do by putting a restriction on its size. Furtbermore, large programs limit the amount of memory available for data, which must also be present in memory if the communications overhead is to be effectively reduced. The development of an interactive image processing workstation based on the: Mark III Hypercube requires satisfactory solutions to these and other problems.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"44 9-10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132286906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Hypercube implementation of the simplex algorithm 超立方体实现的单纯形算法

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63104

C. Stunkel, D. Reed

引用次数: 27

Finite element solution of thermal convection on a hypercube concurrent computer 超立方体并行计算机上热对流的有限元解

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63070

M. Gurnis, A. Raefsky, G. Lyzenga, B. Hager

{"title":"Finite element solution of thermal convection on a hypercube concurrent computer","authors":"M. Gurnis, A. Raefsky, G. Lyzenga, B. Hager","doi":"10.1145/63047.63070","DOIUrl":"https://doi.org/10.1145/63047.63070","url":null,"abstract":"Numerical solutions to thermal convection flow problems \u0000are vital to many scientific and engineering problems. \u0000One fundamental geophysical problem is the thermal convection \u0000responsible for continental drift and sea floor \u0000spreading. The earth's interior undergoes slow creeping \u0000flow (~cm/yr) in response to the buoyancy forces generated \u0000by temperature variations caused by the decay of \u0000radioactive elements and secular cooling. Convection in \u0000the earth's mantle, the 3000 km thick solid layer between \u0000the crust and core, is difficult to model for three reasons: \u0000(1) Complex rheology -- the effective viscosity depends \u0000exponentially on temperature, on pressure (or depth) and \u0000on the deviatoric stress; (2) the buoyancy forces driving \u0000the flow occur in boundary layers thin in comparison to the \u0000total depth; and (3) spherical geometry -- the flow in the \u0000interior is fully three dimensional. Because of these many \u0000difficulties, accurate and realistic simulations of this process \u0000easily overwhelm current computer speed and memory \u0000(including the Cray XMP and Cray 2) and only simplified \u0000problems have been attempted [e.g. Christensen and \u0000Yuen, 1984; Gurnis, 1988; Jarvis and Peltier, 1982]. \u0000 \u0000As a start in overcoming these difficulties, a number of \u0000finite element formulations have been explored on hypercube \u0000concurrent computers. Although two coupled equations \u0000are required to solve this problem (the momentum \u0000or Stokes equation and the energy or advection-diffusion \u0000equation), we will concentrate our efforts on the solution \u0000to the latter equation in this paper. Solution of the former \u0000equation is discussed elsewhere [Lyzenga, et al, 1988]. \u0000We will demonstrate that linear speedups and efficiencies \u0000of 99 percent are achieved for sufficiently large problems.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116003706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Logic fault simulation on a vector hypercube multiprocessor 矢量超立方体多处理器逻辑故障仿真

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63064

F. Özgüner, C. Aykanat, O. Khalid

引用次数: 25

Implementation and performance analysis of parallel assignment algorithms on a hypercube computer 并行分配算法在超立方体计算机上的实现与性能分析

Conference on Hypercube Concurrent Computers and Applications Pub Date : 1989-01-03 DOI: 10.1145/63047.63077

BarryK. Carpenter, IV NathanielJ.Davis

{"title":"Implementation and performance analysis of parallel assignment algorithms on a hypercube computer","authors":"BarryK. Carpenter, IV NathanielJ.Davis","doi":"10.1145/63047.63077","DOIUrl":"https://doi.org/10.1145/63047.63077","url":null,"abstract":"The process of effectively coordinating and controlling resources during a military engagement is known as battle management/command, control, and communications (BM/C3). One key task of BM/C3 is allocating weapons to destroy targets. The focus of this research is on developing parallel computation methods to achieve fast and cost effective assignment of weapons to targets. Using the sequential Hungarian method for solving the assignment problem as a basis, this paper presents the development and the relative performance comparison of four parallel assignment methodologies that have been implemented on the Intel iPSC hypercube computer. The first three approaches are approximations to the optimal assignment solution. The advantage to these is that they are computationally fast and have proven to generate assignments that are very close the optimal assignment in terms of cost. The fourth approach is a parallel implementation of the Hungarian algorithm, where certain subtasks are performed in parallel. This approach produces an optimal assignment as compared to the sub-optimal assignments that result from the first three approaches. The relative performance of the four approaches is compared by varying the number of weapons and targets, the number of processors used, and the size of the problem partitions.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127225418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3