2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)最新文献_第2页

Towards a Usage Control Based Video Surveillance Framework 基于使用控制的视频监控框架

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.64

Enrico Carniani, Gianpiero Costantino, Francesco Marino, F. Martinelli, P. Mori

引用次数: 0

Optimal Time and Energy Efficient Work Distributions in Heterogeneous Systems 异构系统中最优时间和能量效率的工作分配

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.68

V. Raca, E. Mehofer, M. Hudec

引用次数: 3

Thread Progress Aware Block Migration for Dynamic NUCA 动态NUCA的线程进度感知块迁移

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.17

Jianhua Li, Xin An, Yiming Ouyang, Wei Wang

{"title":"Thread Progress Aware Block Migration for Dynamic NUCA","authors":"Jianhua Li, Xin An, Yiming Ouyang, Wei Wang","doi":"10.1109/PDP.2016.17","DOIUrl":"https://doi.org/10.1109/PDP.2016.17","url":null,"abstract":"Non-Uniform Cache Architecture (NUCA) is a viable solution for large capacity on-chip caches to manage the increasing wire delay. Dynamic NUCA divides the last-level cache (LLC) into smaller cache banks connected by on-chip network. D-NUCA yields good performance through migrating blocks within bank sets at runtime to harness data locality. Various works have well explored and studied D-NUCA, including block migration, mapping and searching. However, all of the previous D-NUCA design are thread-oblivious. Due to the interference on shared resources, threads often demonstrate unbalanced progress wherein the lagging threads with slow progress are more critical to overall performance. In this paper, we propose a novel D-NUCA design called Thread prOgress aware block Migration (TOM). TOM exploits the dynamic thread criticality information to control block migration. TOM aims at boosting the execution of critical threads through biased block migration. Experimental results show that TOM can effectively reduce the execution time of a set of PARSEC applications with less energy dissipation compared with previous D-NUCA design.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129595298","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

Towards Weather Forecasting in the Cloud 迈向云中的天气预报

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.80

E. Carreño, Eduardo Roloff, P. Navaux

引用次数: 1

A Cluster-as-Accelerator Approach for SPMD-Free Data Parallelism 无spmd数据并行的集群加速方法

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.97

M. Drocco, Claudia Misale, Marco Aldinucci

引用次数: 4

Efficiency Experiments on Hadoop and Giraph with PageRank PageRank在Hadoop和Giraph上的效率实验

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.49

Arne Koschel, Felix Heine, Irina Astrova, Fred Korte, Thomas Rossow, Sebastian Stipkovic

引用次数: 7

Choreography-Based Analysis of Distributed Message Passing Programs 基于编排的分布式消息传递程序分析

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.72

Ramsay G. Taylor, E. Tuosto, Neil Walkinshaw, J. Derrick

引用次数: 3

Parallel Execution of Space-Aware Applications in a Cloud Environment 云环境中空间感知应用程序的并行执行

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.63

F. Cicirelli, Agostino Forestiero, Andrea Giordano, C. Mastroianni, G. Spezzano

{"title":"Parallel Execution of Space-Aware Applications in a Cloud Environment","authors":"F. Cicirelli, Agostino Forestiero, Andrea Giordano, C. Mastroianni, G. Spezzano","doi":"10.1109/PDP.2016.63","DOIUrl":"https://doi.org/10.1109/PDP.2016.63","url":null,"abstract":"This paper analyzes and evaluates the strategies and implications related to the execution of parallel algorithms on a distributed Cloud infrastructure, with the focus on an important class of applications for which the execution is performed on spatial data, dislocated on a bidimensional territory. Applications of interest cover a wide spectrum ranging from Internet of Things to social sciences, geology, swarm-inspired computation etc. The territory is partitioned into regions, and regions are assigned to parallel computational nodes to speed up the execution. Parallel nodes are aligned through the exchange of messages in order to ensure a coherent and efficient execution. The paper offers an analysis of the parallelization cost in this context, especially in terms of communication overhead, which is essential to estimate the impact of porting the computation onto a Cloud environment. More in particular, the paper evaluates two different strategies for space partitioning, i.e., linear partitioning and bidimensional partitioning, with a specific focus on scalability analysis, and compares the two strategies when both options are exploitable.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130031834","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}

引用次数: 4

Dynamical Calculation of Security Metrics for Countermeasure Selection in Computer Networks 计算机网络对策选择安全度量的动态计算

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.96

Igor Kotenko, E. Doynikova

引用次数: 18

Enhancing the Scalability and Memory Usage of Hashsieve on Multi-core CPUs 增强Hashsieve在多核cpu上的可扩展性和内存使用

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-04-04 DOI: 10.1109/PDP.2016.31

Artur Mariano, C. Bischof

{"title":"Enhancing the Scalability and Memory Usage of Hashsieve on Multi-core CPUs","authors":"Artur Mariano, C. Bischof","doi":"10.1109/PDP.2016.31","DOIUrl":"https://doi.org/10.1109/PDP.2016.31","url":null,"abstract":"The Shortest Vector Problem (SVP) is a key problem in lattice-based cryptography and cryptanalysis. While the cryptography community has accumulated a vast knowledge of SVP-solvers from a theoretical standpoint, the practical performance of these algorithms is commonly not well understood. This gap in knowledge poses many challenges to cryptographers, who are oftentimes confronted with algorithms that perform worse in practice then expected from theory. This is a problem because the asymptotic complexity of the best algorithms plays a key role in the construction of cryptosystems, but only practically appealing, validated algorithms are accounted for in this process. Thus, if one cannot extract the full potential of theoretically strong algorithms in practice, efficient algorithms might be ruled out and wrong assumptions are made when constructing cryptosystems. In this paper, we take a step forward to fill this gap, by providing a computational analysis of HashSieve, the most practical sieving SVP-solver to date, and showing how its performance can be enhanced in practice. To this end, we revisit the parallel generation of random numbers, memory allocation and memory access patterns. Employing scalable random sampling, object memory pools, scalable memory allocators and aggressive memory prefetching, we were able to improve the best current implementation of HashSieve by factors of 3x and 4x, depending on the lattice dimension, and set new records for the HashSieve algorithm, thereby shrinking the gap between its theoretical complexity and its performance in practice.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356142","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