Concurr. Pract. Exp.最新文献_第8页

Distributed control parallelism in multidisciplinary aircraft design 多学科飞机设计中的分布式并行控制

Concurr. Pract. Exp. Pub Date : 1999-07-01 DOI: 10.1002/(SICI)1096-9128(199907)11:8%3C435::AID-CPE442%3E3.0.CO;2-B

D. T. Krasteva, L. Watson, C. Baker, B. Grossman, W. Mason, R. Haftka

{"title":"Distributed control parallelism in multidisciplinary aircraft design","authors":"D. T. Krasteva, L. Watson, C. Baker, B. Grossman, W. Mason, R. Haftka","doi":"10.1002/(SICI)1096-9128(199907)11:8%3C435::AID-CPE442%3E3.0.CO;2-B","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199907)11:8%3C435::AID-CPE442%3E3.0.CO;2-B","url":null,"abstract":"Multidisciplinary design optimization (MDO) for large-scale engineering problems poses many challenges (e.g., the design of an efficient concurrent paradigm for global optimization based on disciplinary analyses, expensive computations over vast data sets, etc.) This work focuses on the application of distributed schemes for massively parallel architectures to MDO problems, as a tool for reducing computation time and solving larger problems. The specific problem considered here is configuraton optimization of a high speed civil transport (HSCT), and the efficient parallelization of the embedded paradigm for reasonable design space identification. Two distributed dynamic load balancing techniques (random polling and global round robin with message combining) and two necessary termination detection schemes (global task count and token passing) were implemented and evaluated in terms of effectiveness and scalability to large problem sizes and a thousand processors. The effect of certain parameters on execution time was also inspected. Empirical results demonstrated stable performance and effectiveness for all schemes, and the parametric study showed that the selected algorithmic parameters have a negligible effect on performance.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131987737","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}

引用次数: 9

Synthesizing objects 合成对象

Concurr. Pract. Exp. Pub Date : 1999-06-14 DOI: 10.1002/1096-9128(20001210)12:14%3C1347::AID-CPE513%3E3.0.CO;2-N

K. Czarnecki, U. Eisenecker

引用次数: 56

Performance measurement of dynamically compiled Java executions 动态编译Java执行的性能度量

Concurr. Pract. Exp. Pub Date : 1999-06-01 DOI: 10.1145/304065.304093

T. Newhall, B. Miller

{"title":"Performance measurement of dynamically compiled Java executions","authors":"T. Newhall, B. Miller","doi":"10.1145/304065.304093","DOIUrl":"https://doi.org/10.1145/304065.304093","url":null,"abstract":"With the development of dynamic compilers for Java, Java's performance promises to rival that of equivalent C/C++ binary executions. This should ensure that Java will become the platform of choice for ubiquitous Web-based supercomputing. Therefore, being able to build performance tools for dynamically compiled Java executions will become increasingly important. In this paper we discuss those aspects of dynamically compiled Java executions that make performance measurement di cult: (1) some Java application methods may be transformed from byte-code to native code at run-time; and (2), even in native form, application code may interact with the Java virtual machine. We describe Paradyn-J, an experimental version of the Paradyn Parallel Performance Tool that addresses this environment by describing performance data from dynamically compiled executions in terms of the multiple execution forms (interpreted byte-code and directly executed native code) of a method, costs of the dynamic compilation, and costs of residual dependencies of the application on the virtual machine. We use performance data from Paradyn-J to tune a Java application method, and improve its interpreted byte-code execution by 11% and its native form execution by 10%. As a result of tuning just one method, we improve the application's total execution time by 11% when run under Sun's ExactVM (included in the Platform2 release of JDK). The results of our work are a guide to virtual machine designers as to what type of performance data should be available through Java VM performance tool APIs.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125168050","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}

引用次数: 21

Parallelism and recursion in message passing libraries: an efficient methodology 消息传递库中的并行和递归:一种有效的方法

Concurr. Pract. Exp. Pub Date : 1999-06-01 DOI: 10.1002/(SICI)1096-9128(199906)11:7%3C355::AID-CPE429%3E3.0.CO;2-Y

C. Rodríguez, F. D. Sande, C. León, L. García

引用次数: 2

Ajents: towards an environment for parallel, distributed and mobile Java applications 代理:面向并行、分布式和移动Java应用程序的环境

Concurr. Pract. Exp. Pub Date : 1999-06-01 DOI: 10.1145/304065.304089

M. Izatt, Patrick Chan, Tim Brecht

{"title":"Ajents: towards an environment for parallel, distributed and mobile Java applications","authors":"M. Izatt, Patrick Chan, Tim Brecht","doi":"10.1145/304065.304089","DOIUrl":"https://doi.org/10.1145/304065.304089","url":null,"abstract":"The rapid proliferation of the World-Wide Web has been due to the seamless access it provides to information that is distributed both within organizations and around the world. In this paper, we describe the design and implementation of a system, called Ajents, which provides the software infrastructure necessary to support a similar level of seamless access to organization-wide or world-wide heterogeneous computing resources. Ajents introduces class libraries which are written entirely in Java and that run on any standard compliant Java virtual machine. These class libraries implement and combine several important features that are essential to supporting distributed and parallel computing using Java. These features include: the ability to easily create objects on remote hosts, to interact with those objects through either synchronous or asynchronous remote method invocations, and to freely migrate objects to heterogeneous hosts. While some of these features have been implemented in other systems, Ajents provides support for the combination of all of these features using techniques that permit them to operate together in a fashion that is more transparent and/or and less restrictive than existing systems. Our experimental results show that in our test environment: we are able to achieve good speedup on a sample parallel application; the overheads introduced by our implementation do not adversely a ect remote method invocation times; and (somewhat surprisingly) the cost of migration does not greatly impact the execution time of an example application.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131067354","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}

引用次数: 77

Ordinary linear model estimation on a massively parallel SIMD computer 大规模并行SIMD计算机上的普通线性模型估计

Concurr. Pract. Exp. Pub Date : 1999-06-01 DOI: 10.1002/(SICI)1096-9128(199906)11:7%3C323::AID-CPE425%3E3.0.CO;2-I

E. Kontoghiorghes

引用次数: 3

Multiresolution load balancing in curved space: the wavelet representation 弯曲空间中的多分辨率负载平衡:小波表示

Concurr. Pract. Exp. Pub Date : 1999-06-01 DOI: 10.1002/(SICI)1096-9128(199906)11:7%3C343::AID-CPE427%3E3.0.CO;2-A

A. Nakano

引用次数: 29

The gateway system: uniform Web based access to remote resources 网关系统:基于统一的Web访问远程资源

Concurr. Pract. Exp. Pub Date : 1999-06-01 DOI: 10.1145/304065.304085

T. Haupt, E. Akarsu, G. Fox, Choon-Han Youn

引用次数: 41

Prophet: automated scheduling of SPMD programs in workstation networks 先知:在工作站网络中自动调度SPMD程序

Concurr. Pract. Exp. Pub Date : 1999-05-01 DOI: 10.1002/(SICI)1096-9128(199905)11:6%3C301::AID-CPE431%3E3.0.CO;2-4

J. Weissman

{"title":"Prophet: automated scheduling of SPMD programs in workstation networks","authors":"J. Weissman","doi":"10.1002/(SICI)1096-9128(199905)11:6%3C301::AID-CPE431%3E3.0.CO;2-4","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199905)11:6%3C301::AID-CPE431%3E3.0.CO;2-4","url":null,"abstract":"Jon B. Weissman Division of Computer Science University of Texas at San Antonio San Antonio, TX 78249 USA (210-458-5689 voice, 210-458-4437 fax) (jon@cs.utsa.edu) Abstract Obtaining eff icient execution of parallel programs in workstation networks is a difficult problem for the user. Unlike dedicated parallel computer resources, network resources are shared, heterogeneous, vary in availabili ty, and offer communication performance that is still an order of magnitude slower than parallel computer interconnection networks. Prophet, a system that automatically schedules data parallel SPMD programs in workstation networks for the user has been developed. Prophet uses application and resource information to select the appropriate type and number of workstations, divide the application into component tasks and data across these workstations, and assign tasks to workstations. This system has been integrated into the Mentat parallel processing system developed at the University of Virginia. A suite of scientific Mentat applications have been scheduled using Prophet on a heterogeneous workstation network. The results are promising and demonstrate that scheduling SPMD applications can be automated with good performance1.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114393054","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}

引用次数: 39

Evaluating the communications capabilities of the generalized hypercube interconnection network 评估广义超立方体互连网络的通信能力

Concurr. Pract. Exp. Pub Date : 1999-05-01 DOI: 10.1002/(SICI)1096-9128(199905)11:6%3C281::AID-CPE428%3E3.0.CO;2-G

Sotirios G. Ziavras, Sanjay M. Krishnamurthy

{"title":"Evaluating the communications capabilities of the generalized hypercube interconnection network","authors":"Sotirios G. Ziavras, Sanjay M. Krishnamurthy","doi":"10.1002/(SICI)1096-9128(199905)11:6%3C281::AID-CPE428%3E3.0.CO;2-G","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199905)11:6%3C281::AID-CPE428%3E3.0.CO;2-G","url":null,"abstract":"SUMMARY This paper presents results of evaluating the communications capabilities of the generalized hypercube interconnection network. The generalized hypercube has outstanding topological properties, but it has not been implemented on a large scale because of its very high wiring complexity. For this reason, this network has not been studied extensively in the past. However, recent and expected technological advancements will soon render this network viable for massively parallel systems. We first present implementations of randomized manyto-all broadcasting and multicasting on generalized hypercubes, using as the basis the oneto-all broadcast algorithm presented by Fragopoulou et al. (1996). We test the proposed implementations under realistic communication traffic patterns and message generations, for the all-port model of communication. Our results show that the size of the intermediate message buffers has a significant effect on the total communication time, and this effect becomes very dramatic for large systems with large numbers of dimensions. We also propose a modification of this multicast algorithm that applies congestion control to improve its performance. The results illustrate a significant improvement in the total execution time and a reduction in the number of message contentions, and also prove that the generalized hypercube is a very versatile interconnection network. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126973223","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}

引用次数: 24