The Sixth Distributed Memory Computing Conference, 1991. Proceedings最新文献_第2页

Performance Of Mulitprocessor Structures For Fast Digital Sar Processing 快速数字Sar处理的多处理器结构性能研究

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633345

R. Albrizio, G. Aloisio, A. Mazzone, P. Messina, N. Veneziani

引用次数: 2

Virtual Processors Considered Harmful 被认为有害的虚拟处理器

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633096

Peter Christy

引用次数: 10

An Evolutionary Approach to Load Balancing Parallel Computations 负载平衡并行计算的进化方法

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633124

N. Mansour, Geoffrey Fox

引用次数: 6

A Parallel Multi-Phase Implementation of Simulated Annealing for the Traveling Salesman Problem 旅行商问题的模拟退火并行多阶段实现

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633303

D.R. Mallampati, P. Mutalik, R. L. Wainwright

{"title":"A Parallel Multi-Phase Implementation of Simulated Annealing for the Traveling Salesman Problem","authors":"D.R. Mallampati, P. Mutalik, R. L. Wainwright","doi":"10.1109/DMCC.1991.633303","DOIUrl":"https://doi.org/10.1109/DMCC.1991.633303","url":null,"abstract":"This paper describes and unulyses a new parallel algorithm using simulated annealing forfinding a good solution to the Traveling Salesman Problem. This algorithm combines the strong points of three recent implementations [ I ,251 with some new features. An initial tour is generated and partitioned among a ring of processors. Each processor receives two disconnected parts (tiers) of the tour. The algorithm is subdivided into three phases. In phase one, 2-opting is performed separately within each of the two tiers of the tour. During the secondphase remoteswapping is performed between cities from the two diflerent tiers of the tour. During phase three, synchronization of the cities is accomplished by each processor shifting a quarter of its cities in a clock-wise direction to its neighboring node. This is called a quarter-spin. Results show this algorithm is superior over recent implementations. For the datasets tested, this algorithm yielded improvements ranging from 32% to 56% compared to three recent implementations. The signiBcance of this algorithm is the manner in which cities from different parts of the tour are combined to form new tours. The multiple phases within the algorithm allows for a better mixture of cities compared to previous algorithms.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"55 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131965914","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}

引用次数: 7

High-Performance Adaptive Routing in Multicomputers Using Dynamic Virtual Circuits 基于动态虚拟电路的多机高性能自适应路由

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633176

Y. Tamir, Yoshio Turner

引用次数: 10

Message Routing On Irregular 2d-meshes And Tori 不规则二维网格和Tori上的消息路由

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633115

T. Stricker

{"title":"Message Routing On Irregular 2d-meshes And Tori","authors":"T. Stricker","doi":"10.1109/DMCC.1991.633115","DOIUrl":"https://doi.org/10.1109/DMCC.1991.633115","url":null,"abstract":"Wormhole message routing is supported by the communication hardware of several distributed memory machines. This particular method of message routing has numerous advantages but creates the problem of a routing deadlock. When long messages compete for the same channels in the network, some messages will be blocked until the the first message is fully consumed by the processor at the destination of the message. A deadlock occurs if a set of messages mutually blocks, and no message can progress towards its destination. Most deadlock free routing schemes previously known are designed to work on regular binary hypercubes. Regular hypercubes and meshes are just a special case of networks. However, these routing schemes do not provide enough flexibility to deal with irregular 2-D-tori and with attached auxiliary cells, which can be found on many newer parallel systems. To handle irregular topologies elegantly, a simple proof is necessary to verify the router code. The new proof given in this report is carried out directly on the network graph. It is constructive in the sense that it reveals the design options to deal with irregularities and shows how additional flexibility can be used to achieve better load balancing. Based on the modified routing model, a set of deadlock free router functions relevant to the iWarp system configurations are described and proven to be correct.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125921645","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}

引用次数: 6

Parallel Solutions to the Phase Problem in X-Ray Crystallography: An Update x射线晶体学中相问题的平行解:更新

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633318

G. DeTitta, H. Hauptman, R. Miller, M. Pagels, T. Sabin, P. Thuman, C. Weeks

引用次数: 3

The Touchstone 30 Gigaflop DELTA Prototype 试金石30千兆次浮点DELTA原型机

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633353

S. Lillevik

引用次数: 87

Resource Management in a Large Reconfigurable Transputer-based System 大型可重构传输器系统中的资源管理

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633072

Halsur V. Sreekantaswamy, N. Goldstein, A. Wagner, S. Chanson

{"title":"Resource Management in a Large Reconfigurable Transputer-based System","authors":"Halsur V. Sreekantaswamy, N. Goldstein, A. Wagner, S. Chanson","doi":"10.1109/DMCC.1991.633072","DOIUrl":"https://doi.org/10.1109/DMCC.1991.633072","url":null,"abstract":"This paper describes two of the intijor components of TIPS, a Transputer-based Iiirteractive Parallelizing System, under development at UBC. The system runs on a 74 node transpuier system iiilercorinectcd by crossbar switches with inulliple liiihs to ike host, a SUN-4. It uses Trollaus with the Logical Syslems C compiler. The first component described is TMRP, a topology independent mapping facility. TMAP’s objective is to automate the mapping process, and muhe it independent from changes an the underlying architecture. It integrates two large pieces of soft,ware, Trollivs and Prep-p. We describe its design and discuss specific problems in trying to achieve a machine iudependent environment. The second com.poiient described is TRES, a higher level reso’urce managernelit facility. TRES is based on parameterized models of coniputation which are used 20 predict perforni.nnce and optimize the use of machine resources. The user need only specify the model (i.e. prograinmin,g paradigm) and the computational task to be performed. TRES determines the optimal topology and number of processors to use. This inforniation is used by the TMAP system.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127931834","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}

引用次数: 0

On Embedding Permutations in Hypercubes 关于超立方体中的嵌入置换

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633347

Arun Kumar Somani, Sangbang Choi

引用次数: 6