Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing最新文献_第2页

Cluster computing vs. Cray T3E-a case study from numerical field theory 集群计算vs. Cray t3e -一个来自数值场理论的案例研究

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905077

G. Arnold, N. Eicker, T. Lippert, K. Schilling

引用次数: 1

Towards ubiquitous awareness: the PRAVTA prototype 走向无处不在的意识:PRAVTA原型

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905036

Tom Gross

引用次数: 12

A parallel compact genetic algorithm for multi-FPGA partitioning 多fpga分区的并行紧凑遗传算法

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905033

R. Baraglia, R. Perego, J. Hidalgo, J. Lanchares, F. Tirado

引用次数: 20

History-based weighted average voter: a novel software voting algorithm for fault-tolerant computer systems 基于历史的加权平均投票人:一种新的容错计算机系统软件投票算法

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905068

G. L. Shabgahi, J. Bass, S. Bennett

引用次数: 48

Dynamic code management on a Java multicomputer Java多计算机上的动态代码管理

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905025

P. Sage, P. Milligan, A. Bouridane

引用次数: 1

Regular d-neighbours topologies 规则的d邻居拓扑

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905004

R. Trobec, Uros Jovanovic

引用次数: 2

Modeling the behaviour of linear algebra algorithms with message-passing 用消息传递对线性代数算法的行为进行建模

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905054

J. Cuenca, D. Giménez, José González

{"title":"Modeling the behaviour of linear algebra algorithms with message-passing","authors":"J. Cuenca, D. Giménez, José González","doi":"10.1109/EMPDP.2001.905054","DOIUrl":"https://doi.org/10.1109/EMPDP.2001.905054","url":null,"abstract":"Modeling the behaviour of linear algebra algorithms is very suitable for designing linear algebra software for high performance computers. This modelization would enable us to predict the execution time of the routines depending on a number of parameters. There are two groups of parameters, in the first, there are the parameters whose values can be chosen by the user: number of processors, processors grid configuration, distribution of data in the system, block size; and in the second, we have the parameters that specify the characteristics of a target architecture: arithmetic cost and start-up and word-sending cost of a communication operation. Thus, a linear algebra library could be designed in such a way that each routine takes the values of the parameters of the first group that provide the expected optimum execution time, and solves the problem. This library could, therefore be employed by a non-expert user to solve scientific or engineering problems, because the user does not need to determine the values of these parameters. The design methodology is analysed with one-sided block Jacobi methods to solve the symmetric eigenvalue problem. Variants for a logical ring and a logical rectangular mesh of processors are considered. An analytical model of the algorithm is developed, and the behaviour of the algorithm is analysed with message-passing using MPI in a SGI Origin 2000. With the parameters chosen by our model, the execution time is reduced from about 50% higher than the optimal to just 2%.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116772614","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}

引用次数: 13

Message-passing computing with Java: performance evaluation and comparisons 使用Java的消息传递计算:性能评估和比较

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905040

V. Getov, M. Williams, Quanming Lu, M. Thomas

{"title":"Message-passing computing with Java: performance evaluation and comparisons","authors":"V. Getov, M. Williams, Quanming Lu, M. Thomas","doi":"10.1109/EMPDP.2001.905040","DOIUrl":"https://doi.org/10.1109/EMPDP.2001.905040","url":null,"abstract":"The development of Java has seen increasing attention as the most popular platform for distributed computing. However, despite Java's advantages in the area of portability and rapid prototyping, its efficiency is unavoidably compromised through its commitment to portability. In this paper we present performance analysis and comparisons of evaluation results for both Java and C/Fortran on three different message-passing parallel platforms-a shared memory multi-processor (Sun E4000), a Linux cluster, and a distributed memory computer (IBM SP-2). The NAS Embarrassingly Parallel and Integer Sort benchmarks were selected for this evaluation. Both the original Fortran/C codes and Java versions of these two kernels were used for obtaining the performance measurements as part of our project. The evaluation results demonstrate the feasibility of message-passing computing with Java on a wide range of computer platforms. Depending on the system and the software components installed, significant impact on the message-passing performance will have the efficiency of the native MPI library and the version of the Java platform.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130442282","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}

引用次数: 8

Probabilistic communication optimizations and parallelization for distributed-memory systems 分布式内存系统的概率通信优化和并行化

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905042

E. Mehofer, Bernhard Scholz

{"title":"Probabilistic communication optimizations and parallelization for distributed-memory systems","authors":"E. Mehofer, Bernhard Scholz","doi":"10.1109/EMPDP.2001.905042","DOIUrl":"https://doi.org/10.1109/EMPDP.2001.905042","url":null,"abstract":"In high-performance systems execution time is of crucial importance justifying advanced optimization techniques. Traditionally, optimization is based on static program analysis. The quality of program optimizations, however, can be substantially improved by utilizing runtime information. Probabilistic data-flow frameworks compute the probability with what data-flow facts may hold at some program point based on representative profile runs. Advanced optimizations can use this information in order to produce highly efficient code. In this paper we introduce a novel optimization technique in the context of High Performance Fortran (HPF) that is based on probabilistic data-flow information. We consider statically undefined attributes which play an important role for parallelization and compute for those attributes the probabilities to hold some specific value during runtime. For the most probable attribute values highly-optimized, specialized code is generated. In this way significantly better performance results can be achieved. The implementation of our optimization is done in the context of VFC, a source-to-source parallelizing compiler for HPF/F90.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"447 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134311973","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}

引用次数: 3

Prediction of communication performance for wide area computing systems 广域计算系统通信性能预测

Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing Pub Date : 2001-02-07 DOI: 10.1109/EMPDP.2001.905078

Jörg Schulz, C. Hochberger, D. Tavangarian

引用次数: 4