专用汽车Pub Date : 1994-05-02DOI: 10.1109/MPCS.1994.367091
E. Marques, C. Kirner
{"title":"Design of the matching unit of a massively parallel dataflow computing system","authors":"E. Marques, C. Kirner","doi":"10.1109/MPCS.1994.367091","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367091","url":null,"abstract":"This paper describes a Massively Parallel Computing System, named Recursively Structured Parallel Computer-RSPC, designed to work as a dataflow distributed computer, and presents the design of the matching store of each node. That machine, structured as a multicomputer based on hierarchical buses, can have thousands of nodes. Each node, acting as a dataflow processor, can execute a part of a dataflow program, cooperating to solve the overall problem. Several strategies for the matching store implementation are discussed and the analysis of the techniques for highly efficient memory search is presented.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"179 1","pages":"62-74"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73754956","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}
专用汽车Pub Date : 1994-05-02DOI: 10.1109/MPCS.1994.367063
P. Cremonesi
{"title":"Automatic load balancing in parallel direct simulation methods","authors":"P. Cremonesi","doi":"10.1109/MPCS.1994.367063","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367063","url":null,"abstract":"Performing Direct Simulation Monte Carlo (DSMC) calculations on parallel processors may result in a strongly unbalanced distribution of work. This situation affects the performances leading to very low speedups. A method that makes use of adaptive domain decomposition to dynamically distribute the computational work load is presented. The method had been implemented on a Transputer System with up to 8 processors (20 MHz Inmos T800), using the FORTRAN version of Parasoft Express Library for parallel computers. The problems studied were hypersonic flows of a chemically reacting gas in a two-dimensional domain. The adaptive decomposition method worked well in uniformly distributing the computational work over an arbitrary number of processors and reduced the average execution time by over 45% in certain cases.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"42 1","pages":"323-327"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91308925","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}
专用汽车Pub Date : 1994-05-02DOI: 10.1109/MPCS.1994.367031
I. De Falco, R. del Balio, E. Tarantino, R. Vaccaro
{"title":"Parallel tabu search versus parallel evolution strategies","authors":"I. De Falco, R. del Balio, E. Tarantino, R. Vaccaro","doi":"10.1109/MPCS.1994.367031","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367031","url":null,"abstract":"There exists in scientific, industrial and financial communities a very strong request for techniques able to efficiently solve complex optimization problems. Because of this, several techniques are being currently investigated. Among them evolutionary algorithms and tabu search seem very interesting, not only for their intrinsic features but also because they both are easily parallelizable, so that they can take advantage of the parallel machines available on the market. A new parallel approach to tabu search (PTS) is introduced and compared against parallel evolution strategies on classical optimization problems taken from literature. The experimental results have shown the superiority of the PTS in both the solution quality and the convergence time.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"16 1","pages":"564-569"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87187676","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}
专用汽车Pub Date : 1994-05-02DOI: 10.1109/MPCS.1994.367018
Y. Sorel
{"title":"Massively parallel computing systems with real time constraints: the \"Algorithm Architecture Adequation\" methodology","authors":"Y. Sorel","doi":"10.1109/MPCS.1994.367018","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367018","url":null,"abstract":"Massively Parallel Computing Systems (MPCS) provide high performance computing generally used to accelerate numerical computation applications. We present a methodology called \"Algorithm Architecture Adequation\" used to take advantage of the computation power of these systems in the case of real-time applications. With this methodology, the application algorithm as well as the MPCS are specified with graphs, then the implementation of an algorithm on a MPCS in respect with real-time constraints may be formalized in terms of graph transformations. This allows one to optimize the real-time performances of the implementation taking into account critical inter-processor communications. As a result, real-time distributed executives are produced automatically without dead-lock and with minimum overhead. This reduces drastically the development cycle for real-time applications running on MPCS.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"4 1","pages":"44-53"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82059917","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}
专用汽车Pub Date : 1994-05-02DOI: 10.1109/MPCS.1994.367077
L. Bengtsson, K. Nilsson, B. Svensson
{"title":"A high-performance embedded massively parallel processing system","authors":"L. Bengtsson, K. Nilsson, B. Svensson","doi":"10.1109/MPCS.1994.367077","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367077","url":null,"abstract":"A need to apply the massively parallel computing paradigm in embedded real-time systems is foreseen. Such applications put new demands on massively parallel systems, different from those of general purpose computing. For example, time determinism is more important than maximal throughput, physical distribution is often required, size, power, and I/O are important, and interactive development tools are needed. The paper describes an architecture for high-performance, embedded, massively parallel processing, featuring a large number of nodes physically distributed over a large area. A typical node has thousands of processing elements (PEs) organized in SIMD mode and is the size of the palm of a hand, Intermodule communication over a scalable optical network is described. A combination of wavelength division multiplexing (WDM) and time division multiplexing (TDM) is used.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"37 1","pages":"201-206"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85304816","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}
专用汽车Pub Date : 1994-05-02DOI: 10.1109/MPCS.1994.367037
C. Di Napoli, M. Furnari
{"title":"A continuation-based Distributed Lisp System","authors":"C. Di Napoli, M. Furnari","doi":"10.1109/MPCS.1994.367037","DOIUrl":"https://doi.org/10.1109/MPCS.1994.367037","url":null,"abstract":"In this paper we describe an approach to coping with parallelism in symbolic applications. Our purpose is to build a parallel symbolic system suited to homogenous and heterogenous Distributed Memory Parallel Systems. In particular we describe the design criteria and the implementation strategy for a Distributed Lisp System (DLISP) that relies on a client/server model and uses a functional level mechanism to synchronize and to control the processes. The intraprocess and interprocess management are obtained using the notion of continuation of a computation for process context switching and resuming. In this way this system does not rely on any control feature outside the LISP language. The DLISP system is structured in three main layers. The hardware heterogeneity is encapsulated using the Parallel Virtual Machine software package to implement the actual communication among processes.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"5 1","pages":"523-527"},"PeriodicalIF":0.0,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89337160","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}