PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...最新文献
{"title":"Unsteady Separated Flow Simulations Using a Cluster of Workstations","authors":"A. Modi, L. Long, R. Hansen","doi":"10.2514/6.2000-272","DOIUrl":"https://doi.org/10.2514/6.2000-272","url":null,"abstract":"The possibility of predicting the full three-dimensional unsteady separated flow around complex ship and helicopter geometries is explored using unstructured grids with a parallel flow solver. The flow solver used is a modified version of the Parallel Unstructured Maritime Aerodynamics (PUMA) software, which was written by Dr. Christopher Bruner as part of his doctoral thesis at the Virginia Polytechnic Institute and State University. The efficiency and accuracy of PUMA at resolving several steady state solutions and a fully three-dimensional unsteady separated flow around a sphere were studied in order to determine if it was a suitable platform to base future work on. The COst effective COmputing Array (COCOA), a powerful 50-processor Beowulf cluster, was also built and tested as a part of the effort to make all this possible at a very economic cost. Unstructured grids were utilized in order to maximize the number of cells in the area of interest, while minimizing cells in the far field. A high level of clustering is required to solve viscous unsteady problems, and unstructured grids offer the least expensive method to ensure this. NASA’s VGRID package was used to generate the unstructured grids.","PeriodicalId":93135,"journal":{"name":"PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...","volume":"9 1","pages":"786-792"},"PeriodicalIF":0.0,"publicationDate":"2000-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79885587","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}
Torsten Kuberka, A. Kugel, R. Männer, H. Singpiel, R. Spurzem
{"title":"AHA-GRAPE: Adaptive Hydrodynamic Architecture - GRAvity PipE","authors":"Torsten Kuberka, A. Kugel, R. Männer, H. Singpiel, R. Spurzem","doi":"10.1007/978-3-540-48302-1_47","DOIUrl":"https://doi.org/10.1007/978-3-540-48302-1_47","url":null,"abstract":"","PeriodicalId":93135,"journal":{"name":"PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...","volume":"17 1","pages":"417-424"},"PeriodicalIF":0.0,"publicationDate":"1999-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86935694","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}
{"title":"An Agent-Based Framework for the Transparent Distribution of Computations","authors":"Markus Straßer, J. Baumann, M. Schwehm","doi":"10.18419/OPUS-2432","DOIUrl":"https://doi.org/10.18419/OPUS-2432","url":null,"abstract":"A mobile agent based framework for the transparent distribution and concurrent execution of computations is presented. The framework uses design patterns like the master-slave, abstract factory or the strategy pattern. The architecture of the framework is built on top of a mobile agent system. A performance model allows to identify performance bottlenecks and unbalanced situations within the framework. The framework has been implemented and tested on top of the mobile agent system Mole.","PeriodicalId":93135,"journal":{"name":"PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...","volume":"27 1","pages":"376-382"},"PeriodicalIF":0.0,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77805855","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}
{"title":"The True Limitations of Shared Memory Programming","authors":"D. Pressel, M. Behr, S. Thompson","doi":"10.21236/ada373358","DOIUrl":"https://doi.org/10.21236/ada373358","url":null,"abstract":"Abstract : Shared memory parallel computers have the reputation for being the easiest type of parallel computers to program. At the same time, they are frequently regarded as being the least scalable type of parallel computer. In particular, shared memory parallel computers are frequently programmed using a form of loop-level parallelism (usually based on some combination of compiler directives and automatic parallelization). However, in discussing this form of parallelism, the experts in the field routinely say that it will not scale past 4-16 processors (the number varies among experts). This report investigates what the true limitations are to this type of parallel programming. The discussions are largely based on the experiences that the authors had in porting the Implicit Computational Fluid Dynamics Code (F3D) to numerous shared memory systems from SGI, Cray, and Convex.","PeriodicalId":93135,"journal":{"name":"PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...","volume":"22 1","pages":"2048-2054"},"PeriodicalIF":0.0,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87747392","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}
{"title":"Deductive Query Processing With an Objective-oriented Semantic Network in a Massively Parallel Environment","authors":"S. Oh, W. Lee","doi":"10.2316/JOURNAL.202.2004.2.202-1266","DOIUrl":"https://doi.org/10.2316/JOURNAL.202.2004.2.202-1266","url":null,"abstract":"Most research related to parallel query processing has concentrated on how to properly partition and schedule operation-by-operation and tuple-by-tuple query processing jobs to available processors. As a result, because these operations should perform complex query optimization, tremendous overhead can be involved, especially in a massively parallel system with thousands of processors. Furthermore, there exist unnecessary dependencies among operations allocated in different processors, and a large amount of intermediate data must be exchanged among processors. This article proposes an effective deductive query processing method in a massively parallel system. For this, the facts and deductive rules of a deductive database are partitioned into fine-grain semantic elements based on the concepts of an object-oriented model. These semantic elements are used to construct an object-oriented semantic network (OOSN). Because all facts and deductive rules are mapped to the OOSN statically, a query can be evaluated effectively in a distributed manner without any complex query optimization.","PeriodicalId":93135,"journal":{"name":"PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...","volume":"15 1","pages":"1182-1188"},"PeriodicalIF":0.0,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90147161","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}
A. Hoferichter, T. Lippert, K. Schilling, P. Palazzari
{"title":"Hyper-Systolic Routing for SIMD Systems","authors":"A. Hoferichter, T. Lippert, K. Schilling, P. Palazzari","doi":"10.1016/S0927-5452(98)80057-9","DOIUrl":"https://doi.org/10.1016/S0927-5452(98)80057-9","url":null,"abstract":"","PeriodicalId":93135,"journal":{"name":"PDPTA '19 : proceedings of the 2019 International Conference on Parallel & Distributed Processing Techniquess & Applications. International Conference on Parallel and Distributed Processing Techniques and Applications (2019 : Las Vegas,...","volume":"3 1","pages":"451-454"},"PeriodicalIF":0.0,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88332845","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}