2012 International Conference on High Performance Computing & Simulation (HPCS)最新文献_第7页

Rectangular vs. triangular minimal routing and performance study 矩形与三角形最小路由和性能研究

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266917

D. Désérable, R. Hoffmann

{"title":"Rectangular vs. triangular minimal routing and performance study","authors":"D. Désérable, R. Hoffmann","doi":"10.1109/HPCSim.2012.6266917","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266917","url":null,"abstract":"This paper presents a comparative study of the XY-routing protocol in the square grid “S” examined herein with the XYZ protocol in the triangular grid “T ” examined elsewhere, both with toroidal connections and N nodes. The routing problem (also called multiple target searching) is performed in a partitioned cellular automata network with agents (or messages) moving from sources to targets, preferably on their minimal routes. The network in S consists of N nodes with 4 buffers per node. Buffers with the same names are connected to their neighboring nodes via unidirectional links. Each buffer may host an agent and each agent situated in a buffer has a computed direction defining the new buffer in the adjacent node. Two scenarios are examined: (i) N-1 agents are moving to a common target (also called “all-to-one gathering”) (ii) N/2 agents are moving to N/2 targets. It is shown that in both cases the T grid is 1.5 times faster than the S grid. - The deterministic minimal routing protocols were also randomized, with agents choosing a random direction in order to cope with congestion and deadlocks. It is shown that randomization can slightly shorten the transfer time in case of congestion, but, more important, deadlocks can be resolved.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124022428","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}

引用次数: 0

High performance smart expression template math libraries 高性能智能表达式模板数学库

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266939

Klaus Iglberger, G. Hager, Jan Treibig, U. Rüde

引用次数: 36

Bid writing: Is project management different? What is appropriate? 投标撰写:项目管理不同吗?什么是合适的?

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266949

A. Bochenkov, C. Maple, P. Sant

引用次数: 0

Automated validation of trust and security of service-oriented architectures with the AVANTSSAR platform 使用AVANTSSAR平台自动验证面向服务的体系结构的信任和安全性

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266956

L. Viganò

{"title":"Automated validation of trust and security of service-oriented architectures with the AVANTSSAR platform","authors":"L. Viganò","doi":"10.1109/HPCSim.2012.6266956","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266956","url":null,"abstract":"Cutting-edge network infrastructures such as Service-Oriented Architectures (SOAs) or, more generally, the Internet of Services (IoS) entail a major paradigm shift in the way ICT systems and applications are designed, implemented, deployed and consumed: they are no longer the result of programming components in the traditional meaning but are built by composing services that are distributed over the network and reconfigured and consumed dynamically in a demand-driven, flexible way. However, the new opportunities opened by the IoS will only materialize if concepts, techniques and tools are provided to ensure security. In fact, deploying services in such network infrastructures entails a wide range of trust and security issues, but solving them is extremely hard since making the service components trustworthy is not sufficient: composing services leads to new, subtle and dangerous, vulnerabilities due to interference between component services and policies, the shared communication layer, and application functionality. Thus, one needs validation of both the service components and their composition into secure service architectures.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125737027","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

Mapping the PRAM model onto the Intel SCC many-core processor 将PRAM模型映射到英特尔SCC多核处理器上

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266943

Carsten Clauss, Stefan Lankes, T. Bemmerl

引用次数: 2

Large electromagnetic problem on large scale parallel computing systems 大规模并行计算系统中的大型电磁问题

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266968

M. Alexandru, T. Monteil, F. Coccetti, H. Aubert, P. Lorenz

引用次数: 2

Workflows orchestration in distributed computing infrastructures 分布式计算基础设施中的工作流编排

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266982

M. Plóciennik, T. Zok, A. Gómez-Iglesias, Francisco Castejón-Magaña, Andrés Bustos, M. Pascual, Jose Luis Velasco

引用次数: 0

Parallel computations in Java with PCJ library 用PCJ库实现Java中的并行计算

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSIM.2012.6266941

Marek Nowicki, P. Bała

{"title":"Parallel computations in Java with PCJ library","authors":"Marek Nowicki, P. Bała","doi":"10.1109/HPCSIM.2012.6266941","DOIUrl":"https://doi.org/10.1109/HPCSIM.2012.6266941","url":null,"abstract":"In this paper we present PCJ - a new library for parallel computations in Java inspired by the partitioned global address space approach. We present design details together with the examples of usage for basic operations such as a point-point communication, synchronization or broadcast. The PCJ library is easy to use and allows for a fast development of the parallel programs. It allows to develop distributed applications in easy way, hiding communication details which allows user to focus on the implementation of the algorithm rather than on network or threads programming. The objects and variables are local to the program threads however some variables can be marked shared which allows to access them from different nodes. For shared variables PCJ offers one-sided communication which allows for easy access to the data stored at the different nodes. The parallel programs developed with PCJ can be run on the distributed systems with different Java VM running on the nodes. In the paper we present evaluation of the performance of the PCJ communication on the state of art hardware. The results are compared with the native MPI implementation showing good performance and scalability of the PCJ.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130308310","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}

引用次数: 20

Algorithmic strategies for optimizing the parallel reduction primitive in CUDA CUDA中并行约简原语优化的算法策略

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266966

Pedro J. Martín, Luis F. Ayuso, Roberto Torres, Antonio Gavilanes

{"title":"Algorithmic strategies for optimizing the parallel reduction primitive in CUDA","authors":"Pedro J. Martín, Luis F. Ayuso, Roberto Torres, Antonio Gavilanes","doi":"10.1109/HPCSim.2012.6266966","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266966","url":null,"abstract":"Many general-purpose applications exploit Graphics Processing Units (GPUs) by executing a set of well-known dataparallel primitives. Those primitives are usually invoked from the host many times, so their throughput has a great impact on the performance of the overall system. Thus, the study of novel algorithmic strategies to optimize their implementation on current devices is an interesting topic to the GPU community. In this paper we focus on optimizing the reduction primitive, which merely reduces a data sequence into a single value using a binary associative operator. Although tree-based and sequential-based algorithms have been already implemented on GPUs, a comparison of both algorithm performance had not been carried out yet. Thus, our first contribution is to present an experimental study of state-of-the-art reduction algorithms on CUDA. Next we introduce two algorithmic optimizations that are integrated into the fastest solution (a sequential-based algorithm), improving its throughput even more. Finally, we replicate this methodology to the segmented version of the primitive, which applies when the input is composed of several independent segments. In this case, it is not clear which algorithm exhibits the best performance, since throughput deeply depends on the distribution of segments along the input. According to our results, tree-based algorithms run faster for small segments, while sequential methods are better for medium and large ones.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132547569","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}

引用次数: 31

Evolutionary power-aware routing in VANETs using Monte-Carlo simulation 基于蒙特卡罗仿真的vanet中进化功率感知路由

2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266900

J. Toutouh, Sergio Nesmachnow, E. Alba

引用次数: 9