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

Cleaning MapReduce Workflows 清理MapReduce工作流

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.22

Matteo Interlandi, Julien Lacroix, Omar Boucelma, F. Guerra

引用次数: 0

A Modular-Logarithmic Coprocessor Concept 模对数协处理器概念

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.93

I. Osinin

引用次数: 3

The RE-SEARCH ALPS (Research Laboratories in the Alpine Area) Project “阿尔卑斯研究实验室”项目

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.20

F. Guerra, M. Russo, Marco Fontana, Matteo Paganelli, F. Bancilhon, Christian Frisch, Lo c Petit, A. Giorgi, Emanuela Zilio

{"title":"The RE-SEARCH ALPS (Research Laboratories in the Alpine Area) Project","authors":"F. Guerra, M. Russo, Marco Fontana, Matteo Paganelli, F. Bancilhon, Christian Frisch, Lo c Petit, A. Giorgi, Emanuela Zilio","doi":"10.1109/HPCS.2017.20","DOIUrl":"https://doi.org/10.1109/HPCS.2017.20","url":null,"abstract":"The paper describes the RE-SEARCH ALPS project, which aims to gather, consolidate, harmonize and make available to different targets (public and private bodies working at local, regional and national level) data about laboratories, research and innovation centers which are active in particular in the regions of seven countries which constitute the Alpine Area (France, Italy, Switzerland, Austria, Germany, Liechtenstein and Slovenia). The project is complemented with a search engine which allows the users to directly query the dataset and to obtain geo referenced data as result. The data will be properly visualized thanks a visualizer developed in the project. From a research perspective, the project has to address hot and challenging Big Data issues, such as big data integration (to join data sources), entity recognition and linkage in large amount of data (to discover the same Institution represented in different sources), data cleaning and reconciliation (to address issues related to different representation of the same real object). The project has been applied in a call for the cration of Open Datasets promoted by the European Innovation and Networks Executive Agency through the Connecting Europe Facility (CEF) funding instrument. The project has been recently approved (AGREEMENT No INEA/CEF/ICT/A2016/1296967): it lasts two years and will start on July 2017.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124218704","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

Post-Quantum Cryptographic Schemes Based on Codes 基于码的后量子密码方案

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.151

M. Baldi

引用次数: 3

Advanced VLSI Circuits Simulation 高级VLSI电路仿真

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.84

Filip Kocina, J. Kunovsky

引用次数: 0

An Efficient Codec for Image Compression Based on Spline Wavelet Transform and Improved SPIHT Algorithm 基于样条小波变换和改进SPIHT算法的高效图像压缩编解码器

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.124

Rania Boujelbene, Y. Jemaa, M. Zribi

引用次数: 5

A Fast CUDA-Based Implementation for the Euclidean Distance Transform 基于cuda的欧氏距离变换快速实现

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.123

F. Zampirolli, Leonardo Filipe

引用次数: 9

A Parallel Library for Social Media Analytics 社交媒体分析的并行库

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.105

Loris Belcastro, F. Marozzo, D. Talia, Paolo Trunfio

引用次数: 5

Extending OpenACC for Efficient Stencil Code Generation and Execution by Skeleton Frameworks 通过骨架框架扩展OpenACC以实现高效的模板代码生成和执行

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.110

Alyson D. Pereira, M. Castro, M. Dantas, Rodrigo C. O. Rocha, L. F. Góes

引用次数: 7

Reducing Randomization in the Power of Two Choices Load Balancing Algorithm 减少随机化的两种选择负载均衡算法

2017 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2017-07-01 DOI: 10.1109/HPCS.2017.62

Félix García Carballeira, A. Calderón

{"title":"Reducing Randomization in the Power of Two Choices Load Balancing Algorithm","authors":"Félix García Carballeira, A. Calderón","doi":"10.1109/HPCS.2017.62","DOIUrl":"https://doi.org/10.1109/HPCS.2017.62","url":null,"abstract":"This paper proposes a new version of the Power of Two Choices, SQ(d), load balancing algorithm that improves the performance of the classical model based on the power of two choices randomized load balancing. This model considers jobs that arrive to a dispatcher as a Poisson stream of rate λn, λ 1, at a set of n servers. Using the power of two choices, the dispatcher chooses for each job some d constant independently and uniformly from the n servers in a random way, and sends the job to the server with the fewest number of jobs. This algorithm offers advantage over the load balancing based on shortest queue discipline, because it offers a good performance, and reduces the overhead over the servers and over the communication network. In this paper, we propose a new version, Shortest Queue of d with Randomization and Round Robin Policies, SQ-RR(d), that combines randomization techniques and static local balancing based on round robin policy. In this new version the dispatcher chooses the d servers as follows: one is selected using round robin policy and the d - 1 servers are chosen independently and uniformly in a random way from the η servers. Then, the dispatcher sends the job to the server with the fewest number of jobs. We demonstrate with an analytical approximation of this approach, that this new version improves the performance obtained with the classical solution for d 2, and obtains similar results for d 2, included systems at 99 percent of capacity. Furthermore, we provide simulations that demonstrate the analytical approximation developed and show the behavior of this algorithm with realistic workloads based on Google datacenter traces.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896596","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