Pub Date : 1900-01-01DOI: 10.1137/1.9780898719659.ch3
M. Mascagni
{"title":"Parallel Weiner Integral Methods for Elliptic BVPs: A Tale of Two Architectures","authors":"M. Mascagni","doi":"10.1137/1.9780898719659.ch3","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch3","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126824541","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch1
A. L. Sargent, J. Almlöf, M. Feyereisen
{"title":"Massively Parallel Algorithms for Electronic Structure Calculations in Quantum Chemistry","authors":"A. L. Sargent, J. Almlöf, M. Feyereisen","doi":"10.1137/1.9780898719659.ch1","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch1","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125633","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch11
I. Beichl, F. Sullivan
{"title":"Parallelizing Computational Geometry: First Steps","authors":"I. Beichl, F. Sullivan","doi":"10.1137/1.9780898719659.ch11","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch11","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125108147","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch17
C. Douglas
Multigrid methods originated earlier this century, in the personnel computing era. Someone who needed to compute an approximation to the solution of a partial di erential equation during that era would ll a room with people. After using very simple mechanical calculators to compute parts of the approximation, these people would pass their parts to the other people in the room who needed them. Except for the very di erent time scales and approximate solution accuracy, this process is similar to computing on today's distributed memory parallel computers. The most basic model problem for elliptic boundary value problems in multigrid has always been, e ectively, the two dimensional Poisson equation
{"title":"A Review of Numerous Parallel Multigrid Methods","authors":"C. Douglas","doi":"10.1137/1.9780898719659.ch17","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch17","url":null,"abstract":"Multigrid methods originated earlier this century, in the personnel computing era. Someone who needed to compute an approximation to the solution of a partial di erential equation during that era would ll a room with people. After using very simple mechanical calculators to compute parts of the approximation, these people would pass their parts to the other people in the room who needed them. Except for the very di erent time scales and approximate solution accuracy, this process is similar to computing on today's distributed memory parallel computers. The most basic model problem for elliptic boundary value problems in multigrid has always been, e ectively, the two dimensional Poisson equation","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131148496","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch29
J. Mulvey
{"title":"Robust Optimization on PC Supercomputers","authors":"J. Mulvey","doi":"10.1137/1.9780898719659.ch29","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch29","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"48 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114042492","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch22
C. Douglas, A. Ern, M. Smooke
Not too long ago, anyone wanting to solve large science or engineering problems had to rst get access to a supercomputer costing millions of dollars. Quite recently, a new breed of relatively inexpensive work stations became widely available. These machines have scalar peak speeds of 30{275 mega ops with ones on the horizon of 400 or more (which compares rather favorably with vector supercomputers of not so long ago). While these rates are only seen for simple problems like dense matrix{matrix multiplication, the rates seen for many problems are quite high. In this article, we describe a class of problems which can now be solved on machines individuals can a ord to own rather than just on ones costing millions of dollars. Of course, the problem with using a single one of these machines is that the option of connecting a collection of machines together or buying a parallel version of the work station becomes more and more tantalizing. In fact, during the course of two years we did all of the above. We started on a single machine with a 100 mega op peak rate (an IBM RISC System/6000 model 560 computer). Then we used a farm of the IBM's, an IBM SP1, and nally an SP2. Due to a nice feature of the communications' library we used (EUIH), the executables worked on the ethernet at Yale or on the fast switches in the SP1/SP2's without either recompiling or relinking.
{"title":"Numerical Simulation of Laminar Diffusion Flames","authors":"C. Douglas, A. Ern, M. Smooke","doi":"10.1137/1.9780898719659.ch22","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch22","url":null,"abstract":"Not too long ago, anyone wanting to solve large science or engineering problems had to rst get access to a supercomputer costing millions of dollars. Quite recently, a new breed of relatively inexpensive work stations became widely available. These machines have scalar peak speeds of 30{275 mega ops with ones on the horizon of 400 or more (which compares rather favorably with vector supercomputers of not so long ago). While these rates are only seen for simple problems like dense matrix{matrix multiplication, the rates seen for many problems are quite high. In this article, we describe a class of problems which can now be solved on machines individuals can a ord to own rather than just on ones costing millions of dollars. Of course, the problem with using a single one of these machines is that the option of connecting a collection of machines together or buying a parallel version of the work station becomes more and more tantalizing. In fact, during the course of two years we did all of the above. We started on a single machine with a 100 mega op peak rate (an IBM RISC System/6000 model 560 computer). Then we used a farm of the IBM's, an IBM SP1, and nally an SP2. Due to a nice feature of the communications' library we used (EUIH), the executables worked on the ethernet at Yale or on the fast switches in the SP1/SP2's without either recompiling or relinking.","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114254560","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch7
D. Beazley, P. Lomdahl
{"title":"Large-Scale Molecular Dynamics on MPPs: Part I","authors":"D. Beazley, P. Lomdahl","doi":"10.1137/1.9780898719659.ch7","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch7","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125720382","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch30
Jianping Zhu
{"title":"History Matching of Multiphase Reservoir Models on Hypercubes","authors":"Jianping Zhu","doi":"10.1137/1.9780898719659.ch30","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch30","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128265905","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 : 1900-01-01DOI: 10.1137/1.9780898719659.ch25
R. Bixby, J. Dennis, Zhi-jun Wu
{"title":"Solving Nonlinear Integer Programs with a Subgradient Approach on Parallel Computers","authors":"R. Bixby, J. Dennis, Zhi-jun Wu","doi":"10.1137/1.9780898719659.ch25","DOIUrl":"https://doi.org/10.1137/1.9780898719659.ch25","url":null,"abstract":"","PeriodicalId":287486,"journal":{"name":"Applications on Advanced Architecture Computers","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132321454","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：