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

筛选
英文 中文
Design of Cache Backend Using Remote Memory for Network File System 基于远程内存的网络文件系统缓存后端设计
Eunji Lim, Shinyoung Ahn, Youngho Kim, Gyuil Cha, Wan-Sik Choi
{"title":"Design of Cache Backend Using Remote Memory for Network File System","authors":"Eunji Lim, Shinyoung Ahn, Youngho Kim, Gyuil Cha, Wan-Sik Choi","doi":"10.1109/HPCS.2017.131","DOIUrl":"https://doi.org/10.1109/HPCS.2017.131","url":null,"abstract":"In supporting high-performance data processing, performance gap between the computation device and storage prevents the full utilization of the computation resource and causes a system bottleneck. In addition, some big-data applications which require interactive, real-time, and complicated computation need faster data I/O than distributed file systems. So we propose a new cache backend facility called CacheDM for network file system, which utilizes the distributed memory as a cache media in the cluster environment where computing nodes are connected via high speed network. CacheDM can provide low-latency and high-speed cache by supporting direct memory copy based access to the cached data by using RDMA. CacheDM is designed as a cache backend of the FS-Cache, therefore users can use CacheDM and gain its performance advantage without modification of existing application and NFS.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"36 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":"134043745","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}
引用次数: 3
Integrating Heterogeneous Weather-Sensors Data into a Smart-City App 将异构天气传感器数据集成到智能城市应用程序中
A. Quarati, A. Clematis, Luca Roverelli, Gabriele Zereik, D. D'Agostino, G. Mosca, M. Masnata
{"title":"Integrating Heterogeneous Weather-Sensors Data into a Smart-City App","authors":"A. Quarati, A. Clematis, Luca Roverelli, Gabriele Zereik, D. D'Agostino, G. Mosca, M. Masnata","doi":"10.1109/HPCS.2017.33","DOIUrl":"https://doi.org/10.1109/HPCS.2017.33","url":null,"abstract":"Current weather information is one of the facilities supplied to the users by most travel and mobility systems. Most of them relies on one provider, who can deliver a more or less satisfactory coverage on different geographical areas. In this paper, we present the approach and discuss the rationale that drove the design and development of a mashup service for providing meteorological information within the research project TCUBE (“Transport Territory and Tourism“). TCUBE aims at the creation of a platform of services for travel and mobility in urban territory, with initial focus on Genoa metropolitan area. The goal of the project is to study, develop and validate technologies and solutions for the implementation, deployment, and management of advanced information services for citizens and visitors based on enabling technologies and methodologies such as: Open Data; crowd sourcing and social sharing; sensor infrastructures and services based on spatial data. The mashup service presented herein is able to exploit and integrate weather sensor data provided by the free contributions of citizen scientists' Personal Weather Stations belonging to heterogeneous Weather Networks. Design and technical details of our approach are supplied, thus to make it replicable in other similar urban contexts.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"43 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":"131766658","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}
引用次数: 11
Workload-Driven Database Optimization for Cloud Applications 面向云应用的工作负载驱动的数据库优化
C. Diamantini, Alex Mircoli, D. Potena, Valentina Tempera, Matteo Moretti
{"title":"Workload-Driven Database Optimization for Cloud Applications","authors":"C. Diamantini, Alex Mircoli, D. Potena, Valentina Tempera, Matteo Moretti","doi":"10.1109/HPCS.2017.94","DOIUrl":"https://doi.org/10.1109/HPCS.2017.94","url":null,"abstract":"The performance of modern data-intensive applications is closely related to the speed of data access. However, a physical database optimization by design is often infeasible, due to the presence of large databases and time-varying workloads. In this paper we introduce a novel methodology for physical database optimization which allows for a quick and dynamic selection of indexes through the analysis of database logs. The application of the technique to cloud applications, which use a pay-per-use model, results in immediate cost savings, due to the presence of elastic resources. In order to demonstrate the effectiveness of the approach, we present the case study Nuvola, a SaaS multitenant application for schools that is characterized by heavy workloads. Experimental results show that the proposed technique leads to a 52.1% reduction of query execution time for a given workload. A comparative analysis of database performance before and after the optimization is also performed through a M/M/1 queue model and the results are discussed.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"2 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":"121218100","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
Massive MIMO Design for 5G Networks: An Overview on Alternative Antenna Configurations and Channel Model Challenges 5G网络的大规模MIMO设计:替代天线配置和信道模型挑战概述
H. M. E. Misilmani, Ahmad M. El-Hajj
{"title":"Massive MIMO Design for 5G Networks: An Overview on Alternative Antenna Configurations and Channel Model Challenges","authors":"H. M. E. Misilmani, Ahmad M. El-Hajj","doi":"10.1109/HPCS.2017.52","DOIUrl":"https://doi.org/10.1109/HPCS.2017.52","url":null,"abstract":"With the growth of mobile data application and the ultimate expectations of 5G technology, the need to expand the capacity of the wireless networks is inevitable. Massive MIMO technique is currently taking a major part of the ongoing research, and expected to be the key player in the new cellular technologies. This papers presents an overview of the major aspects related to massive MIMO design including, antenna array general design, configuration, and challenges, in addition to advanced beamforming techniques and channel modeling and estimation issues affecting the implementation of such systems.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1 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":"129307115","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}
引用次数: 26
StochSoCs: High Performance Biocomputing Simulations for Large Scale Systems Biology 随机soc:大规模系统生物学的高性能生物计算模拟
E. Manolakos, Elias Kouskoumvekakis
{"title":"StochSoCs: High Performance Biocomputing Simulations for Large Scale Systems Biology","authors":"E. Manolakos, Elias Kouskoumvekakis","doi":"10.1109/HPCS.2017.156","DOIUrl":"https://doi.org/10.1109/HPCS.2017.156","url":null,"abstract":"The stochastic simulation of large-scale biochemical reaction networks is of great importance for systems biology since it enables the study of inherently stochastic biological mechanisms at the whole cell scale. Stochastic Simulation Algorithms (SSA) allow us to simulate the dynamic behavior of complex kinetic models, but their high computational cost makes them very slow for many realistic size problems. We present a pilot service, named WebStoch, developed in the context of our StochSoCs research project, allowing life scientists with no high-performance computing expertise to perform over the internet stochastic simulations of large-scale biological network models described in the SBML standard format. Biomodels submitted to the service are parsed automatically and then placed for parallel execution on distributed worker nodes. The workers are implemented using multi-core and many-core processors, or FPGA accelerators that can handle the simulation of thousands of stochastic repetitions of complex biomodels, with possibly thousands of reactions and interacting species. Using benchmark LCSE biomodels, whose workload can be scaled on demand, we demonstrate linear speedup and more than two orders of magnitude higher throughput than existing serial simulators.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"22 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":"116371169","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
Location and Mobility Aware Resource Management for 5G Cloud Radio Access Networks 5G云无线接入网络的位置和移动性感知资源管理
Uladzimir Karneyenka, Khushbu Mohta, M. Moh
{"title":"Location and Mobility Aware Resource Management for 5G Cloud Radio Access Networks","authors":"Uladzimir Karneyenka, Khushbu Mohta, M. Moh","doi":"10.1109/HPCS.2017.35","DOIUrl":"https://doi.org/10.1109/HPCS.2017.35","url":null,"abstract":"Cloud Radio Access Network (C-RAN) has recently gained much attention for 5G and Long Term Evolution — Advanced (LTE-A) cellular networks. The recent technology advancement in network virtualization function and software defined radio has enabled virtualization of Baseband Units (BBU) and sharing of underlying general purpose processing infrastructure. All these advancements have made C-RAN feasible and practical. This paper proposes new algorithms for clustering towers based on location and for packing BBU clusters based on the prediction of mobility and traffic patterns and analyzes their complexities. Unlike existing C-RAN studies that compared their performance with that of traditional distributed RAN methods, we evaluate and compare the performance with that of existing C-RAN strategies, based on real cellular tower maps provided by the FCC. The proposed combined clustering and packing algorithms have achieved up to 34.8% better QoS while using only up to 5.8% most towers and 7.4% most hosts than other methods. We believe that the proposed combination of clustering and packing algorithms for C-RAN would be significant for the success of emerging 5G networks.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"29 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":"128025273","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}
引用次数: 30
An Efficient Hardware Implementation of TimSort and MergeSort Algorithms Using High Level Synthesis 基于高级综合的时间排序和归并排序算法的高效硬件实现
Yomna Ben Jmaa, Karim M. A. Ali, D. Duvivier, M. B. Jemaa, R. B. Atitallah
{"title":"An Efficient Hardware Implementation of TimSort and MergeSort Algorithms Using High Level Synthesis","authors":"Yomna Ben Jmaa, Karim M. A. Ali, D. Duvivier, M. B. Jemaa, R. B. Atitallah","doi":"10.1109/HPCS.2017.92","DOIUrl":"https://doi.org/10.1109/HPCS.2017.92","url":null,"abstract":"Sorting algorithms are one of the most commonly used in computer science. They can be seen as a pillar for some applications such as decision support systems, path planning, etc. However, sorting large number of elements needs high computation rate. Consequently, accelerating sorting algorithms using hardware implementation is an interesting solution to speed up computations. The purpose of this paper is to develop a hardware accelerated version of TimSort and MergeSort algorithms from high level descriptions. The algorithms are implemented using Zynq-7000 xilinx platform as part of real time decision support for avionic applications. As experimental results, we compare the performance of two algorithms in terms of execution time and resource utilization. We showed that TimSort ranges from 1.07x to 1.16x faster than MergeSort when optimized hardware is used.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"33 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":"127289882","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}
引用次数: 5
Algorithmic Quantification of Skull Bone Density 颅骨骨密度的算法量化
V. Zeljkovic, C. Tameze, I. Vucenik, J. Stains, C. Druzgalski, P. Mayorga
{"title":"Algorithmic Quantification of Skull Bone Density","authors":"V. Zeljkovic, C. Tameze, I. Vucenik, J. Stains, C. Druzgalski, P. Mayorga","doi":"10.1109/HPCS.2017.119","DOIUrl":"https://doi.org/10.1109/HPCS.2017.119","url":null,"abstract":"It is estimated that over 200 million people worldwide experience a decrease in bone strength associated with osteoporosis. This causes increased susceptibility to fracture which represents one of the critical challenges of aging population. Therefore, novel approaches in assessing overall bone integrity are introduced. These approaches included the use of micro CT scan of skull bone images of mouse which allow to study a new mouse model with gap junction protein mutation, and compare normal and diseased animals. We propose skull bone detection algorithm capable of successfully detecting skull bone density. The proposed method has two functions: visual and numerical. Visual function is expressed through detection and indication of the potential bone tissue by marking it in a different color and distinguishing it from the background. Numerical function enables quantification of the amount of detected skull bone by calculating its numerical content equivalent.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"3 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":"125199082","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
An Hierarchical Labeling Technique for Interactive Computation of Watersheds 流域交互计算的分层标注技术
K. Bourgeois, S. Robert, Sébastien Limet, V. Essayan
{"title":"An Hierarchical Labeling Technique for Interactive Computation of Watersheds","authors":"K. Bourgeois, S. Robert, Sébastien Limet, V. Essayan","doi":"10.1109/HPCS.2017.24","DOIUrl":"https://doi.org/10.1109/HPCS.2017.24","url":null,"abstract":"The watershed computation is a prevalent task in the geographical information systems. It is used, among other purposes, to forecast the pollutant concentration and its impact on the water quality. The algorithm to compute the watershed can be hard to parallelize and with the increasingly data growth, the need for parallel computation increases. In this paper we propose a new method to parallelize the watershed computation. Our algorithm is decomposed into two tasks, the parallel watershed segmentation into a hierarchy that allows in a second task to retrieve randomly large watersheds at run-time in interactive time.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1 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":"131311792","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
SOPJ: A Scalable Online Provenance Join for Data Integration SOPJ:用于数据集成的可伸缩在线来源连接
Song Zhu, G. Fiameni, Giovanni Simonini, S. Bergamaschi
{"title":"SOPJ: A Scalable Online Provenance Join for Data Integration","authors":"Song Zhu, G. Fiameni, Giovanni Simonini, S. Bergamaschi","doi":"10.1109/HPCS.2017.23","DOIUrl":"https://doi.org/10.1109/HPCS.2017.23","url":null,"abstract":"Data integration is a technique used to combine different sources of data together to provide an unified view among them. MOMIS[1] is an open-source data integration framework developed by the DBGroup1. The goal of our work is to make MOMIS be able to scale-out as the input data sources increase without introducing noticeable performance penalty. In particular, we present a full outer join method capable to efficiently integrate multiple sources at the same time by using data streams and provenance information. To evaluate the scalability of this innovative approach, we developed a join engine employing a distributed data processing framework. Our solution is able to process input data sources in the form of continuous stream, execute the join operation on-the-fly and produce outputs as soon as they are generated. In this way, the join can return partial results before the input streams have been completely received or processed optimizing the entire execution. Encouraging results of adopting the proposed approach on real datasets closes the paper.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"18 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120845955","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}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信