Proceedings International Parallel and Distributed Processing Symposium最新文献_第4页

An object oriented framework for an associative model of parallel computation 并行计算关联模型的面向对象框架

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213309

Michael Scherger, J. Potter, J. Baker

引用次数: 4

Efficient agent-based multicast on wormhole switch-based irregular networks 基于虫洞交换机的不规则网络中的高效代理组播

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213172

Yi-Fang Lin, Pangfeng Liu

引用次数: 1

Phylogenetic tree inference on PC architectures with AxML/PAxML 基于AxML/PAxML的PC架构系统发育树推断

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213296

A. Stamatakis, T. Ludwig

{"title":"Phylogenetic tree inference on PC architectures with AxML/PAxML","authors":"A. Stamatakis, T. Ludwig","doi":"10.1109/IPDPS.2003.1213296","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213296","url":null,"abstract":"Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work, we have introduced subtree equality vectors (SEV) to significantly reduce the number of required floating point operations during topology evaluation and implemented this method in (P)AxML, which is a derivative of (parallel) fastDNAml. Experimental results show that (P)AxML scales particularly well on inexpensive PC-processor architectures obtaining global run time accelerations between 51% and 65% over (parallel) fastDNAml for large data sets, yet rendering exactly the same output. In this paper, we present an additional SEV-based algorithmic optimization which scales well on PC processors and leads to a further improvement of global execution times of 14% to 19% compared to the initial version of AxML. Furthermore, we present novel distance-based heuristics for reducing the number of analyzed tree topologies, which further accelerate the program by 4% up to 8%. Finally, we discuss a novel experimental tree-building algorithm and potential heuristic solutions for inferring large high quality trees, which for some initial tests rendered better trees and accelerated program execution at the same time by a factor greater than 6.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130256042","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

Extending OpenMP to support slipstream execution mode 扩展OpenMP以支持滑流执行模式

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213119

K. Ibrahim, G. Byrd

{"title":"Extending OpenMP to support slipstream execution mode","authors":"K. Ibrahim, G. Byrd","doi":"10.1109/IPDPS.2003.1213119","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213119","url":null,"abstract":"OpenMP has emerged as a widely accepted standard for writing shared memory programs. Hardware-specific extensions such as data placement are usually needed to improve the scalability of applications based on this standard. This paper investigates the implementation of an OpenMP compiler that supports slipstream execution mode, a new optimization mechanism for CMP-based distributed shared memory multiprocessors. Slipstream mode uses additional processors to reduce communication overhead, rather than to increase parallelism. We discuss how each OpenMP construct can be implemented to take advantage of slipstream mode, and we present a minor extension that allows runtime or compile-time control of slipstream execution. We also investigate the interaction between slipstream mechanisms and OpenMP scheduling. Our implementation supports both static and dynamic scheduling in slipstream mode. We extended the Omni OpenMP compiler to generate binaries that support slipstream mode, and we show the performance of slipstream-enabled codes using OpenMP codes from the NAS Parallel Benchmark suite, running on the SimOS simulator. Our extension to OpenMP allowed the benchmarks to achieve an average performance improvement of 14% with static scheduling. For dynamic scheduling the performance improvement is 12% on average.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134450228","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

A polymorphic hardware platform 多态硬件平台

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213322

P. Beckett

引用次数: 2

A characterisation of optimal channel assignments for wireless networks modelled as cellular and square grids 以蜂窝和方形网格为模型的无线网络的最佳信道分配特性

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213406

M. Shashanka, Amrita Pati, Anil M. Shende

引用次数: 6

Some modular adders and multipliers for field programmable gate arrays 现场可编程门阵列的模块化加法器和乘法器

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213353

Jean-Luc Beuchat

引用次数: 38

Distributed hardware-in-the-loop simulator for autonomous continuous dynamical systems with spatially constrained interactions 具有空间约束相互作用的自主连续动力系统的分布式硬件在环模拟器

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213235

Z. Papp, M. Dorrepaal, D. Verburg

{"title":"Distributed hardware-in-the-loop simulator for autonomous continuous dynamical systems with spatially constrained interactions","authors":"Z. Papp, M. Dorrepaal, D. Verburg","doi":"10.1109/IPDPS.2003.1213235","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213235","url":null,"abstract":"The state-of-the-art intelligent vehicle, autonomous guided vehicle and mobile robotics application domains can be described as collection of interacting highly autonomous complex dynamical systems. Extensive formal analysis of these systems - except special cases - is not feasible, consequently the availability of proper simulation and test tools is of primary importance. This research targets the real-time hardware-in-the-loop (HIL) simulation of vehicle and mobile robot systems. To certain extent distributed virtual environment (DYE) systems are attempting to satisfy similar requirements but a few distinctive features set this approach apart. DVE systems put the emphasis on load balancing and communication overhead. In our case the emphasis is on the temporal predictability and guaranteed, timed execution of the experiment. The paper describes a simulation framework dedicated to HIL simulation of continuous dynamical entities with spatially constrained interactions. The underlying modelling concept is introduced. The runtime infrastructure is described, which allows for distributed execution of the models.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133515000","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}

引用次数: 25

Routing on meshes in optimum time and with really small queues 在最优时间和非常小的队列中在网格上路由

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213148

Bogdan S. Chlebus, J. F. Sibeyn

引用次数: 3

Dynamic organization schemes for cooperative proxy caching 协同代理缓存的动态组织方案

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213136

S. Bakiras, Thanasis Loukopoulos, I. Ahmad

{"title":"Dynamic organization schemes for cooperative proxy caching","authors":"S. Bakiras, Thanasis Loukopoulos, I. Ahmad","doi":"10.1109/IPDPS.2003.1213136","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213136","url":null,"abstract":"In a generic cooperative caching architecture, web proxies form a mesh network. When a proxy cannot satisfy a request, it forwards the request to the other nodes of the mesh. Since a local cache cannot fulfill the majority of the arriving requests (typical values of the local hit ratio are about 30-50%), the volume of queries diverted to neighboring nodes can substantially grow and may consume considerable amount of system resources. A proxy does not need to cooperate with every node of the mesh due to the following reasons: (i) the traffic characteristics may be highly diverse; (ii) the contents of some nodes may extensively overlap; (iii) the inter-node distance might be too large. Furthermore, organizing N proxies in a mesh topology introduces scalability problems, since the number of queries is of the order of N/sup 2/. Therefore, restricting the number of neighbors for each proxy to k < N - 1 will likely lead to a balanced trade-off between query overhead and hit ratio, provided cooperation is done among useful neighbors. For a number of reasons the selection of useful neighbors is not efficient. An obvious reason is that web access patterns change dynamically. Furthermore, availability of proxies is not always globally known. This paper proposes a set of algorithms that enable proxies to independently explore the network and choose the k most beneficial (according to local criteria) neighbors in a dynamic fashion. The simulation experiments illustrate that the proposed dynamic neighbor reconfiguration schemes significantly reduce the overhead incurred by the mesh topology while yielding higher hit ratios compared to the static approach.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115901517","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