2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing最新文献

[Title page iii] [标题页iii]

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2019-08-01 DOI: 10.1109/ancs.2011.2

Los Alamitos, C. Washington, bullet Tokyo

引用次数: 0

Towards Modeling Interconnection Networks of Exascale Systems with OMNet++ 基于omnet++的百亿亿级系统互连网络建模

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.36

P. Yébenes, J. Escudero-Sahuquillo, P. García, F. Quiles

{"title":"Towards Modeling Interconnection Networks of Exascale Systems with OMNet++","authors":"P. Yébenes, J. Escudero-Sahuquillo, P. García, F. Quiles","doi":"10.1109/PDP.2013.36","DOIUrl":"https://doi.org/10.1109/PDP.2013.36","url":null,"abstract":"One of the objectives of the decade for High-Performance Computing systems is to reach the exascale level of computing power before 2018, hence this will require strong efforts in their design. In that sense, High-speed low-latency interconnection networks are essential elements for exascale HPC systems. Indeed, the performance of the whole system depends on that of the interconnection network. In order to develop and test new techniques, suited to exascale HPC systems, software-based networks simulators are commonly used. As developing a network simulator from scratch is a difficult task, several platforms help the developers, OMNeT++ being one of the most popular. In this paper, we propose a new generic network simulator, exploiting the features of the OMNeT++ framework. The proposed tool is the first step to model HPC high-performance interconnection networks of exascale HPC systems: the message switching layer, routing and arbitration algorithms and buffer organizations have been modeled according to the current and expected characteristics of these systems. In addition, the tool has been designed so that it is possible to simulate networks of large size. Simulation results, validated against real systems, show the accuracy of the model.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121058616","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}

引用次数: 32

Core Mapping into an Irregular Network on Chip - Features Extraction System for Automatic Speech Recognition Case Study 芯片上不规则网络特征提取系统的核心映射与自动语音识别案例研究

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.79

P. Dziurzański, T. Maka

引用次数: 0

A Comprehensive Approach for a Power Efficient General Purpose Supercomputer 一种高效通用超级计算机的综合方法

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.55

M. Bach, J. Cuveland, H. Ebermann, D. Eschweiler, J. Gerhard, S. Kalcher, M. Kretz, V. Lindenstruth, H. Ludde, Manfred Pollok, D. Rohr

{"title":"A Comprehensive Approach for a Power Efficient General Purpose Supercomputer","authors":"M. Bach, J. Cuveland, H. Ebermann, D. Eschweiler, J. Gerhard, S. Kalcher, M. Kretz, V. Lindenstruth, H. Ludde, Manfred Pollok, D. Rohr","doi":"10.1109/PDP.2013.55","DOIUrl":"https://doi.org/10.1109/PDP.2013.55","url":null,"abstract":"Computers are essential in research and industry, but they are also significant contributors to the worldwide power consumption. The LOEWE-CSC supercomputer addresses this problem by setting new standards in environmental compatibility as well as energy and cooling efficiency for high-performance and general-purpose computing. Designing a pervasively energy efficient compute center requires improvements in multiple fields. The hosting low-loss compute-center operates at a cooling overhead below 8% of the computer power. General purpose graphics processing units provide more compute performance per watt than standard processors. A balanced hardware configuration ensures that most of the compute power is available to the user when he employs optimized applications. Clever algorithms enable the user to fully exploit the computational potential and avoids to waste power when the processors idles, which is often a cause of inefficient programming. The LOEWE-CSC operated at 740MFlops/W during a Linpack benchmark run, by using commodity servers and ranked place 8 in the Green500 list of November 2010. These innovations provide a fundamental step towards cost-effective, environment-friendly exascale computing and IT operation.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115988341","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

Cost-Efficient Project Management Based on Distributed Processing Model 基于分布式处理模型的成本效益项目管理

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.30

Grzegorz Pawinski, K. Sapiecha

引用次数: 6

An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems 一种用于崩溃恢复系统的有效领导者选举算法的评估

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.33

Carlos Gómez-Calzado, M. Larrea, Iratxe Soraluze Arriola, A. Lafuente, Roberto Cortiñas

{"title":"An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems","authors":"Carlos Gómez-Calzado, M. Larrea, Iratxe Soraluze Arriola, A. Lafuente, Roberto Cortiñas","doi":"10.1109/PDP.2013.33","DOIUrl":"https://doi.org/10.1109/PDP.2013.33","url":null,"abstract":"This paper presents an evaluation of three communication-efficient algorithms implementing the Omega class of failure detectors, which provides an eventual leader election functionality, in distributed systems where processes can crash and recover. Communication efficiency means that eventually only a correct process, i.e., the elected leader, keeps sending a message periodically to the rest of processes. The first algorithm relies on the use of stable storage to store the identity of the leader and an incarnation number. The second algorithm does not use stable storage, but requires a majority of correct processes. Also, it is near-communication-efficient, since besides the leader, unstable processes, i.e., those that crash and recover infinitely often, may send messages periodically before they receive a message from the leader. Finally, the third algorithm does neither use stable storage nor require a majority of correct processes, but assumes that each process has access to a nondecreasing and persistent local clock. Using the OMNeT++ network simulation framework, we evaluate the performance and the quality of service provided by these algorithms, in terms of the number of messages exchanged among processes and the capability of the failure detector to provide a single leader, respectively.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121388378","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}

引用次数: 6

Pairwise Sequence Alignment Method for Distributed Shared Memory Systems 分布式共享内存系统的成对序列对齐方法

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.69

Alberto Montañola, C. Roig, P. Hernández

引用次数: 6

Distributed Iterative Solution of Numerical Simulation Problems on Infiniband and Ethernet Clusters via the P2PSAP Self-Adaptive Protocol 基于P2PSAP自适应协议的Infiniband和以太网集群数值模拟问题的分布式迭代解

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.25

S. R. Tembo, Nguyen The Tung, D. E. Baz

引用次数: 4

Consistency Check through O-GEHL Predictors 通过O-GEHL预测器进行一致性检查

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.39

E. Atoofian

引用次数: 3

Scalability and Efficiency of Database Queries on Future Many-Core Systems 未来多核系统中数据库查询的可扩展性和效率

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.14

P. Petrides, Andreas Diavastos, C. Christofi, P. Trancoso

{"title":"Scalability and Efficiency of Database Queries on Future Many-Core Systems","authors":"P. Petrides, Andreas Diavastos, C. Christofi, P. Trancoso","doi":"10.1109/PDP.2013.14","DOIUrl":"https://doi.org/10.1109/PDP.2013.14","url":null,"abstract":"Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that process large data sets. Traditionally, DSS queries have been accelerated using large-scale multiprocessors. In this work we exploit the benefits of using future many-core architectures, more specifically on-chip clustered many-core architectures. To achieve this goal we propose different representative data parallel versions of the original database scan and join algorithms. We also study the impact on the performance when on-chip memory, shared among all cores, is used as a prefetching buffer. For our experiments we study the behaviour of three queries from the standard DSS benchmark TPC-H executing on the Intel Single chip Cloud Computer experimental processor (Intel SCC). Our results show that parallelism can be well exploited by such architectures and how important it is to have a balance between computation and data intensity. Moreover, from our experimental results we show that performance improvement of 5x and 10x for the corresponding query implementation without data prefetching. Finally we show how we could efficiently use the system in order to achieve high power-performance efficiency when using the proposed prefetching buffer.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131293751","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}

引用次数: 2