首页 > 最新文献

Proceedings Scalable High Performance Computing Conference SHPCC-92.最新文献

英文 中文
Scalable parallel molecular dynamics on MIMD supercomputers 在MIMD超级计算机上的可扩展并行分子动力学
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232635
S. Plimpton, G. Heffelfinger
Presents two parallel algorithms suitable for molecular dynamics simulations over a wide range of sizes, from a few hundred to millions of atoms. One of the algorithms is optimally scalable, offering performance proportional to N/P where N is the number of atoms (or molecules) and P is the number of processors. Their implementation on three MIMD parallel computers (nCUBE2, Intel Gamma, and Intel Delta) and performance on a standard benchmark problem as compared to vector and SIMD implementations is discussed. The authors also briefly describe the integration of one of the algorithms into a widely-used code appropriate for modeling defect dynamics in metals via the embedded atom method.<>
提出了两种并行算法,适用于分子动力学模拟的大范围尺寸,从几百到数百万的原子。其中一种算法具有最佳可扩展性,提供与N/P成比例的性能,其中N是原子(或分子)的数量,P是处理器的数量。讨论了它们在三台MIMD并行计算机(nCUBE2、Intel Gamma和Intel Delta)上的实现,以及与矢量和SIMD实现相比,在标准基准测试问题上的性能。作者还简要描述了将其中一种算法集成到一个广泛使用的代码中,该代码适用于通过嵌入原子方法对金属中的缺陷动力学进行建模。
{"title":"Scalable parallel molecular dynamics on MIMD supercomputers","authors":"S. Plimpton, G. Heffelfinger","doi":"10.1109/SHPCC.1992.232635","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232635","url":null,"abstract":"Presents two parallel algorithms suitable for molecular dynamics simulations over a wide range of sizes, from a few hundred to millions of atoms. One of the algorithms is optimally scalable, offering performance proportional to N/P where N is the number of atoms (or molecules) and P is the number of processors. Their implementation on three MIMD parallel computers (nCUBE2, Intel Gamma, and Intel Delta) and performance on a standard benchmark problem as compared to vector and SIMD implementations is discussed. The authors also briefly describe the integration of one of the algorithms into a widely-used code appropriate for modeling defect dynamics in metals via the embedded atom method.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"50 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114020918","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}
引用次数: 17
Intercube communication for the iPSC/860 iPSC/860的立方体间通信
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232627
E. Barszcz
In this paper, new functions that enable efficient intercube communication on the Intel iPSC/860 are introduced. Communication between multiple cubes (power-of-two number of processor nodes) within the Intel iPSC/860 is a desirable feature to facilitate the implementation of interdisciplinary problems such as the grand challenge problems of the High Performance Computing and Communications Project (HPCCP). Intercube communication allows programs for each discipline to be developed independently on the hypercube and then integrated at the interface boundaries using intercube communication.<>
本文介绍了在Intel iPSC/860上实现高效立方体间通信的新功能。在Intel iPSC/860中,多个多维数据集(处理器节点数量的2的幂)之间的通信是促进跨学科问题实现的理想特性,例如高性能计算和通信项目(HPCCP)的重大挑战问题。立方体间通信允许每个学科的程序在超立方体上独立开发,然后使用立方体间通信在接口边界上集成。
{"title":"Intercube communication for the iPSC/860","authors":"E. Barszcz","doi":"10.1109/SHPCC.1992.232627","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232627","url":null,"abstract":"In this paper, new functions that enable efficient intercube communication on the Intel iPSC/860 are introduced. Communication between multiple cubes (power-of-two number of processor nodes) within the Intel iPSC/860 is a desirable feature to facilitate the implementation of interdisciplinary problems such as the grand challenge problems of the High Performance Computing and Communications Project (HPCCP). Intercube communication allows programs for each discipline to be developed independently on the hypercube and then integrated at the interface boundaries using intercube communication.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"337 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122749943","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
Load information distribution via active interconnection networks 通过主动互联网络分配负荷信息
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232652
D. Grunwald
Existing multicomputers typically use passive, dedicated network interfaces. By comparison, an active interconnect network can manipulate the data in messages transitting through a node; these might use existing systolic processors as the network interface. Active interconnects will become increasingly common in distributed memory multicomputers because they can be used to implement a variety of routing algorithms, reduction operators and efficient memory-fetch operations. The authors measures the effectiveness of distributing load information using active interconnection networks. He does not expect the benefits of distributing load information to solely justify the existence of active interconnection networks; rather, he foresees that active networks will shortly be commonplace, and seeks to measure their benefit for tightly coupled distributed operating systems.<>
现有的多计算机通常使用被动的专用网络接口。相比之下,主动互连网络可以操作通过节点传输的消息中的数据;它们可以使用现有的收缩处理器作为网络接口。主动互连将在分布式内存多计算机中变得越来越普遍,因为它们可以用来实现各种路由算法、缩减运算符和高效的内存获取操作。作者测量了利用主动互联网络分配负荷信息的有效性。他并不期望分配负荷信息的好处仅仅证明主动互联网络存在的合理性;相反,他预测主动网络将很快普及,并试图衡量它们对紧密耦合的分布式操作系统的好处
{"title":"Load information distribution via active interconnection networks","authors":"D. Grunwald","doi":"10.1109/SHPCC.1992.232652","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232652","url":null,"abstract":"Existing multicomputers typically use passive, dedicated network interfaces. By comparison, an active interconnect network can manipulate the data in messages transitting through a node; these might use existing systolic processors as the network interface. Active interconnects will become increasingly common in distributed memory multicomputers because they can be used to implement a variety of routing algorithms, reduction operators and efficient memory-fetch operations. The authors measures the effectiveness of distributing load information using active interconnection networks. He does not expect the benefits of distributing load information to solely justify the existence of active interconnection networks; rather, he foresees that active networks will shortly be commonplace, and seeks to measure their benefit for tightly coupled distributed operating systems.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134284705","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
Network-attached storage systems 网络连接存储系统
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232686
R. Katz
With the dramatic shift towards distributed computing, and its associated client-server model of computation, storage facilities are now found attached to file servers and distributed throughout the network. The paper discusses the underlying technology trends that are leading to high performance network-based storage, namely advances in networks, storage devices, and I/O controller and server architectures. It describes a research prototype, developed at Berkeley, that takes a new approach to high performance computing based on network-attached storage.<>
随着向分布式计算及其相关的客户机-服务器计算模型的巨大转变,存储设施现在被附加到文件服务器上,并分布在整个网络中。本文讨论了导致高性能基于网络的存储的基本技术趋势,即网络、存储设备、I/O控制器和服务器架构的进步。它描述了伯克利大学开发的一个研究原型,该原型采用了一种基于网络附加存储的高性能计算新方法。
{"title":"Network-attached storage systems","authors":"R. Katz","doi":"10.1109/SHPCC.1992.232686","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232686","url":null,"abstract":"With the dramatic shift towards distributed computing, and its associated client-server model of computation, storage facilities are now found attached to file servers and distributed throughout the network. The paper discusses the underlying technology trends that are leading to high performance network-based storage, namely advances in networks, storage devices, and I/O controller and server architectures. It describes a research prototype, developed at Berkeley, that takes a new approach to high performance computing based on network-attached storage.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134297772","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}
引用次数: 18
On the influence of programming models on shared memory computer performance 编程模型对共享内存计算机性能的影响
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232630
T. Ngo, L. Snyder
Experiments are presented indicating that on shared-memory machines, programs written in the nonshared-memory programming model generally offer better performance, in addition to being more portable and scalable. The authors study the LU decomposition problem and a molecular dynamics simulation on three shared-memory machines with widely differing architectures, and analyze the results from three perspectives: performance, speedup, and scaling.<>
实验表明,在共享内存机器上,用非共享内存编程模型编写的程序除了具有更强的可移植性和可扩展性外,通常还能提供更好的性能。作者在三台架构各异的共享内存机器上研究了LU分解问题和分子动力学模拟,并从性能、加速和扩展三个角度分析了结果。
{"title":"On the influence of programming models on shared memory computer performance","authors":"T. Ngo, L. Snyder","doi":"10.1109/SHPCC.1992.232630","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232630","url":null,"abstract":"Experiments are presented indicating that on shared-memory machines, programs written in the nonshared-memory programming model generally offer better performance, in addition to being more portable and scalable. The authors study the LU decomposition problem and a molecular dynamics simulation on three shared-memory machines with widely differing architectures, and analyze the results from three perspectives: performance, speedup, and scaling.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114434421","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}
引用次数: 36
Complete exchange on a circuit switched mesh 在电路交换网上完成交换
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232628
S. Bokhari, H. Berryman
The complete exchange ('all-to-all personalized') communication pattern is at the heart of numerous important multicomputer algorithms. Recent research has shown how this pattern can efficiently be performed on circuit-switched hypercubes. However, on circuit-switched meshes, this pattern is difficult to perform efficiently because the sparsity of the mesh interconnect leads to severe link contention. The authors develop a family of algorithms that proceed by recursively carrying out a series of contention-free exchanges on subdivisions of the mesh. Each member of this family is useful for some range of the parameters: mesh size, message size, startup time, and data transmission and permutation rates. The authors describe the performance of their algorithms on the Touchstone Delta mesh.<>
完全交换(“所有对所有个性化”)通信模式是许多重要的多计算机算法的核心。最近的研究表明,这种模式可以有效地在电路切换的超立方体上执行。然而,在电路交换的网格上,这种模式很难有效地执行,因为网格互连的稀疏性导致了严重的链路争用。作者开发了一系列算法,通过递归地在网格的细分上执行一系列无争用的交换来进行。这个家族的每个成员对于某些参数范围都是有用的:网格大小、消息大小、启动时间、数据传输和排列速率。作者描述了他们的算法在Touchstone Delta网格上的性能。
{"title":"Complete exchange on a circuit switched mesh","authors":"S. Bokhari, H. Berryman","doi":"10.1109/SHPCC.1992.232628","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232628","url":null,"abstract":"The complete exchange ('all-to-all personalized') communication pattern is at the heart of numerous important multicomputer algorithms. Recent research has shown how this pattern can efficiently be performed on circuit-switched hypercubes. However, on circuit-switched meshes, this pattern is difficult to perform efficiently because the sparsity of the mesh interconnect leads to severe link contention. The authors develop a family of algorithms that proceed by recursively carrying out a series of contention-free exchanges on subdivisions of the mesh. Each member of this family is useful for some range of the parameters: mesh size, message size, startup time, and data transmission and permutation rates. The authors describe the performance of their algorithms on the Touchstone Delta mesh.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116178507","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}
引用次数: 78
A parallel implementation of the chemically reacting CFD code, SPARK 一个并行实现的化学反应CFD代码,SPARK
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232674
J. C. Otto
Describes a parallel version of the two-dimensional, chemically reacting CFD code, SPARK. The sequential code has been ported to run on the Intel iPSC/860-based parallel computers. Routines have been added to the code which partition the problem based on the global mesh, and then assign the resulting subdomains across the processors. Two subdomain mappings have been considered. The routines which compute spatial derivatives and the routine which adds artificial viscosity to the discretization were modified to handle the subdomain boundaries interior to the global domain, and an effort has been made to overlap the required communication/computation. Measurements of the performance of the code have been made for two test problems exercising all of the available options of the parallel code thus far. While the parallel efficiency of the code is quite good, the single-node performance has been much lower than expected for this architecture.<>
描述了一个平行版本的二维,化学反应的CFD代码,SPARK。顺序代码已被移植到基于Intel iPSC/860的并行计算机上运行。代码中添加了基于全局网格划分问题的例程,然后跨处理器分配结果子域。考虑了两个子域映射。改进了计算空间导数的程序和在离散化过程中加入人工粘性的程序,以处理全局域内部的子域边界,并努力使所需的通信/计算重叠。到目前为止,已经对两个测试问题进行了代码性能的度量,这些测试问题使用了并行代码的所有可用选项。虽然代码的并行效率相当好,但单节点性能远低于该架构的预期。
{"title":"A parallel implementation of the chemically reacting CFD code, SPARK","authors":"J. C. Otto","doi":"10.1109/SHPCC.1992.232674","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232674","url":null,"abstract":"Describes a parallel version of the two-dimensional, chemically reacting CFD code, SPARK. The sequential code has been ported to run on the Intel iPSC/860-based parallel computers. Routines have been added to the code which partition the problem based on the global mesh, and then assign the resulting subdomains across the processors. Two subdomain mappings have been considered. The routines which compute spatial derivatives and the routine which adds artificial viscosity to the discretization were modified to handle the subdomain boundaries interior to the global domain, and an effort has been made to overlap the required communication/computation. Measurements of the performance of the code have been made for two test problems exercising all of the available options of the parallel code thus far. While the parallel efficiency of the code is quite good, the single-node performance has been much lower than expected for this architecture.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124884633","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
Evaluation of distributed hierarchical scheduling with explicit grain size control 具有显式粒度控制的分布式分级调度的评价
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232649
R. Hofman, W. Vree
Distributed control, in this case for scheduling, is a necessity for scalable multiprocessors. Distributed control suffers from incomplete knowledge about the system state: knowledge about remote nodes is outdated, and knowledge is often limited to a neighbourhood. Distributed hierarchical scheduling algorithms suffer less from this information bottleneck. The programming discipline of the authors' Parallel Reduction Machine allows the system to do an estimate of new tasks' execution time and inherent parallelism. The authors use these to derive a consistent load metric and a sophisticated allocation criterion. A natural mapping of new tasks on scheduler levels is found. From simulation studies, the authors find that the performance of their algorithm depends strongly on the quality of the task time estimate. If this estimate is good, their algorithm yields higher speed-ups than the well-known distributed scheduling algorithms that they use as a reference. The number of messages exchanged is much smaller for the authors' hierarchical algorithm.<>
分布式控制(在本例中用于调度)对于可伸缩的多处理器是必要的。分布式控制的缺点是对系统状态的了解不完全:关于远程节点的知识已经过时,而且这些知识通常局限于邻近区域。分布式分层调度算法受这种信息瓶颈的影响较小。作者的并行约简机的编程原则允许系统对新任务的执行时间和固有并行性进行估计。作者使用这些来推导出一个一致的负载度量和一个复杂的分配准则。找到了调度程序级别上新任务的自然映射。从仿真研究中,作者发现该算法的性能很大程度上取决于任务时间估计的质量。如果这个估计是正确的,那么他们的算法比他们用作参考的众所周知的分布式调度算法产生更高的加速。对于作者的分层算法,交换的消息数量要少得多。
{"title":"Evaluation of distributed hierarchical scheduling with explicit grain size control","authors":"R. Hofman, W. Vree","doi":"10.1109/SHPCC.1992.232649","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232649","url":null,"abstract":"Distributed control, in this case for scheduling, is a necessity for scalable multiprocessors. Distributed control suffers from incomplete knowledge about the system state: knowledge about remote nodes is outdated, and knowledge is often limited to a neighbourhood. Distributed hierarchical scheduling algorithms suffer less from this information bottleneck. The programming discipline of the authors' Parallel Reduction Machine allows the system to do an estimate of new tasks' execution time and inherent parallelism. The authors use these to derive a consistent load metric and a sophisticated allocation criterion. A natural mapping of new tasks on scheduler levels is found. From simulation studies, the authors find that the performance of their algorithm depends strongly on the quality of the task time estimate. If this estimate is good, their algorithm yields higher speed-ups than the well-known distributed scheduling algorithms that they use as a reference. The number of messages exchanged is much smaller for the authors' hierarchical algorithm.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661882","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}
引用次数: 2
Program analysis and transformations for message-passing programs 消息传递程序的程序分析和转换
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232687
M. Gerndt
Discusses dependence analysis and transformations for SPMD programs with collective communication operations. In this context transformations have not only to take into account data dependences but have to be designed carefully not to introduce deadlocks. The work described has been done in the context of SUPERB, an interactive parallelization system.<>
讨论了具有集体通信操作的SPMD程序的依赖分析和转换。在这种情况下,转换不仅要考虑数据依赖性,而且必须仔细设计,以免引入死锁。本文所描述的工作是在一个交互式并行化系统SUPERB中完成的
{"title":"Program analysis and transformations for message-passing programs","authors":"M. Gerndt","doi":"10.1109/SHPCC.1992.232687","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232687","url":null,"abstract":"Discusses dependence analysis and transformations for SPMD programs with collective communication operations. In this context transformations have not only to take into account data dependences but have to be designed carefully not to introduce deadlocks. The work described has been done in the context of SUPERB, an interactive parallelization system.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132210396","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}
引用次数: 2
Application of Linda to molecular modeling Linda在分子建模中的应用
Pub Date : 1992-04-26 DOI: 10.1109/SHPCC.1992.232640
T. Mattson, M. Shifman
Presents a sampling of work applying parallel computation to computational chemistry using the Linda machine-independent parallel programming language. The authors focus on two projects in particular. The first project parallelized the well-known distance geometry program, DGEOM, while the second project looked at a molecular dynamic code. In both cases, the Linda programs were relatively easy to develop and delivered good performance on a variety of MIMD architectures.<>
介绍了使用Linda机器无关的并行编程语言将并行计算应用于计算化学的工作示例。作者特别关注了两个项目。第一个项目并行化了著名的距离几何程序DGEOM,而第二个项目则研究了分子动态代码。在这两种情况下,Linda程序相对容易开发,并且在各种MIMD体系结构上提供了良好的性能
{"title":"Application of Linda to molecular modeling","authors":"T. Mattson, M. Shifman","doi":"10.1109/SHPCC.1992.232640","DOIUrl":"https://doi.org/10.1109/SHPCC.1992.232640","url":null,"abstract":"Presents a sampling of work applying parallel computation to computational chemistry using the Linda machine-independent parallel programming language. The authors focus on two projects in particular. The first project parallelized the well-known distance geometry program, DGEOM, while the second project looked at a molecular dynamic code. In both cases, the Linda programs were relatively easy to develop and delivered good performance on a variety of MIMD architectures.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133191885","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
期刊
Proceedings Scalable High Performance Computing Conference SHPCC-92.
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1