发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Towards the Generation of Correct Java Programs (Research Poster) 生成正确的Java程序(研究海报)
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00166
Jolan Philippe, F. Loulergue
{"title":"Towards the Generation of Correct Java Programs (Research Poster)","authors":"Jolan Philippe, F. Loulergue","doi":"10.1109/HPCS.2018.00166","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00166","url":null,"abstract":"Proof assistants such as Coq [1] can be used to develop very high assurance software such as a verified C compiler [2] and verified high performance computing programs [3]. Even when not used for a full system, using such a proof assistant to develop critical parts of a system could be interesting, for example security monitors [4] or the reconfiguration mechanism of a component based system.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127941148","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
Fault Tolerant Routing Methodology for Mesh-of-Tree based Network-on-Chips using Local Reconfiguration 基于树状网格的片上网络局部重构容错路由方法
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00096
Mohit Upadhyay, Monil Shah, P. V. Bhanu, J. Soumya, Linga Reddy Cenkeramaddi
{"title":"Fault Tolerant Routing Methodology for Mesh-of-Tree based Network-on-Chips using Local Reconfiguration","authors":"Mohit Upadhyay, Monil Shah, P. V. Bhanu, J. Soumya, Linga Reddy Cenkeramaddi","doi":"10.1109/HPCS.2018.00096","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00096","url":null,"abstract":"Increase in the processing elements in a System-on- Chip (SoC) has led to an increasing complexity between the cores in the entire network. This communication bottleneck led to rise in the new paradigm called Network-on-Chip (NoC). These NoC are very much susceptible to various types of faults which can be transient, intermittent or permanent. This paper presents a fault-tolerant routing technique which can route the packets from a source to a destination in presence of permanent faults in the leaf routers of Mesh-of-Tree topology where cores are connected. This is achieved by using reconfiguration in the local ports of the leaf routers by inserting multiplexers as a layer between the leaf routers and cores in the topology. The results consider the impact of the reconfiguration on the performance of NoC in presence of faults. Experimental results have shown improvements in terms of information reaching their respective destination in presence of router faults.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117023046","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
An Ensemble-Based P2P Framework for the Detection of Deviant Business Process Instances 基于集成的P2P异常业务流程实例检测框架
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00034
Francesco Folino, G. Folino, L. Pontieri
{"title":"An Ensemble-Based P2P Framework for the Detection of Deviant Business Process Instances","authors":"Francesco Folino, G. Folino, L. Pontieri","doi":"10.1109/HPCS.2018.00034","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00034","url":null,"abstract":"The problem of discriminating \"deviant\" traces (i.e. traces diverging from normal/desired outcomes, such as frauds, faults) in the execution log of a business process can be faced by extracting a classification model for the traces, after mapping them onto some suitable feature space. An ensemble-learning approach was recently proposed that trains multiple base learners on different vector-space views of the given log, and a probabilistic meta-model that combines the predictions of the discovered base classifiers. However, the sequential centralised implementation of this learning approach makes it unsuitable for real applications, where large volumes of traces are produced continuously, while both deviant and normal behaviours tend to change over the time. We here propose an online deviance detection framework that leverages a novel incremental learning scheme, which extracts different base models from different chunks of a trace stream, and dynamically combines them in an ensemble model. Notably, the system is based on a p2p architecture that allows it to distribute the entire learning procedure among multiple nodes and to exploit the power of HPC resources (e.g. cloud computing environments). Preliminary tests on a real-life log confirmed the validity of the approach, in terms of both effectiveness and efficiency.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120946743","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
Towards an Integrated Geographic Routing Approach using Estimated Sensors Position in WSNs 基于传感器位置估计的集成地理路由方法研究
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00149
Abdelali Hadir, K. Zine-dine, M. Bakhouya, J. E. Kafi, D. E. Ouadghiri
{"title":"Towards an Integrated Geographic Routing Approach using Estimated Sensors Position in WSNs","authors":"Abdelali Hadir, K. Zine-dine, M. Bakhouya, J. E. Kafi, D. E. Ouadghiri","doi":"10.1109/HPCS.2018.00149","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00149","url":null,"abstract":"Geographic routing protocols have been developed to increase the effectiveness and the usefulness of wireless sensor networks in many emerging applications. In these protocols, the routing decision, at each sensor node, is based only on the positions of the destination node and forwarding node's neighbors. However, these protocols are based on exact sensors position, assuming that sensors are equipped with a geographic positioning or a localization-based technique. Recently, several techniques, such DV-Hop, have been proposed for estimating sensors' positions. This paper introduces an integrated geographic routing protocol by integrating both sensors' position estimation and geographic routing techniques. We have mainly combined DV-Hop for estimating sensors position and the greedy perimeter stateless protocol for data forwarding and routing. Simulations have been carried out and results are reported to show the efficiency of the proposed hybrid geographic routing protocol in WSNs.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123314120","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
Comparison of Clang Abstract Syntax Trees using String Kernels 使用字符串核的Clang抽象语法树的比较
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00032
Raul Torres, T. Ludwig, J. Kunkel, M. F. Dolz
{"title":"Comparison of Clang Abstract Syntax Trees using String Kernels","authors":"Raul Torres, T. Ludwig, J. Kunkel, M. F. Dolz","doi":"10.1109/HPCS.2018.00032","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00032","url":null,"abstract":"Abstract Syntax Trees (ASTs) are intermediate representations widely used by compiler frameworks. One of their strengths is that they can be used to determine the similarity among a collection of programs. In this paper we propose a novel comparison method that converts ASTs into weighted strings in order to get similarity matrices and quantify the level of correlation among codes. To evaluate the approach, we leveraged the corresponding strings derived from the Clang ASTs of a set of 100 source code examples written in C. Our kernel and two other string kernels from the literature were used to obtain similarity matrices among those examples. Next, we used Hierarchical Clustering to visualize the results. Our solution was able to identify different clusters conformed by examples that shared similar semantics. We demonstrated that the proposed strategy can be promisingly applied to similarity problems involving trees or strings.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124243112","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
Task Assignment in a Virtualized GPU Enabled Cloud 虚拟化GPU云中的任务分配
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00143
Hari Sivaraman, Uday Kurkure, Lan Vu
{"title":"Task Assignment in a Virtualized GPU Enabled Cloud","authors":"Hari Sivaraman, Uday Kurkure, Lan Vu","doi":"10.1109/HPCS.2018.00143","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00143","url":null,"abstract":"Cloud computing vendors are beginning to offer GPU based high performance computing as a service. One approach uses virtual machines (VM), running in a hypervisor like VMware vSphere, equipped with virtual GPUs like Nvidia's vGPU solution. In this approach, multiple VMs running concurrently can share a single GPU. The number of VMs that share the GPU can be configured by the user/system administrator. Further, VMs can be re-assigned to GPUs, if more than one is available, dynamically. This approach allows tasks/jobs that use GPUs to run in individual VMs guaranteeing isolation whilst sharing resources. In a typical cloud environment with multiple servers each with one or more GPUs, finding an efficient, fast solution to the problem of placing VMs (i.e. VM-placement) on GPUs and moving them around as needed is extremely important to achieve high throughput of tasks while maximizing server utilization and minimizing task wait times. In this paper, we present the simulator we built to compare different solutions to the problem of VM-placement together with some early results.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115739693","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
A Scalable Framework for Online Power Modelling of High-Performance Computing Nodes in Production 生产中高性能计算节点在线功率建模的可扩展框架
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00058
Federico Pittino, Francesco Beneventi, Andrea Bartolini, L. Benini
{"title":"A Scalable Framework for Online Power Modelling of High-Performance Computing Nodes in Production","authors":"Federico Pittino, Francesco Beneventi, Andrea Bartolini, L. Benini","doi":"10.1109/HPCS.2018.00058","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00058","url":null,"abstract":"Power and thermal design and management are critical components of high performance computing (HPC) systems, due to their cutting-edge position in terms of high power density and large total power consumption. Many HPC power manage¬ment strategies rely on the availability of accurate compact power models, capable of predicting power consumption and tracking its sensitivity to workload parameters and operating points. In this paper we describe a methodology and a framework for training power models derived with two of the best-in-class procedures directly on the online in production nodes and without requiring dedicated training instances. The compact power models are obtained using an online regression-based approach which can track non-stationary workloads and hardware variability. Our experiments on a real-life HPC system demonstrate that the models achieve very high accuracy over all operating modes. We also demonstrate the scalability of our approach and the small amount of resources needed for the online modeling, for both the training and inference phases.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115983318","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
A Modular Framework for Verifying Versatile Distributed Systems 多用途分布式系统验证的模块化框架
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00121
Florent Chevrou, A. Hurault, P. Quéinnec
{"title":"A Modular Framework for Verifying Versatile Distributed Systems","authors":"Florent Chevrou, A. Hurault, P. Quéinnec","doi":"10.1109/HPCS.2018.00121","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00121","url":null,"abstract":"Putting independent components together is a common design practice of distributed systems. Besides, there exists a wide range of interaction protocols that dictate how these components interact, which impacts their compatibility. However, the communication model itself always consists in a monolithic description of the rules and properties of the communication. In this paper, we propose a mechanized framework for the compatibility checking of compositions of peers where the interaction protocol can be fine tuned through assembly of individual properties on the communication. These include whether the communication is point-to-point or multicast, which ordering-policies are to be applied, applicative priorities, bounds on the number of messages in transit, and so on. Among these properties, we focus on a generic description of multicast communication that encompasses point-to-point and one-to-all communication as special cases. Eventually we provide theoretical views on the relations between ordering-policies through the lenses of multicast communication.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131508827","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
Evaluation of Performance Saturation Using the Hadoop Framework 基于Hadoop框架的性能饱和评估
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00164
R. S. Ferreira, B. Batista, Rafael M. D. Frinhani, B. Kuehne, Dionisio Machado Leite Filho, M. Peixoto
{"title":"Evaluation of Performance Saturation Using the Hadoop Framework","authors":"R. S. Ferreira, B. Batista, Rafael M. D. Frinhani, B. Kuehne, Dionisio Machado Leite Filho, M. Peixoto","doi":"10.1109/HPCS.2018.00164","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00164","url":null,"abstract":"It is estimated that about 2.5 exabytes of data are produced daily. This large volume of data has brought new possibilities of applications, however, to manage this large volume of data, new technologies were needed. One of the most prominent technologies is the Hadoop framework, which implements a parallel task processing paradigm. The aim of this paper is to present the results of our group's research which analyzed the performance of the Hadoop framework for Big Data processing. The performance evaluation focused on finding the saturation point of Hadoop performance by varying the number of nodes in the cluster applying two benchmarks - TeraSort and Pi. The analysis was performed using a real infrastructure, implementing the system in a physical cluster, providing a general approach of performance analysis in the Hadoop framework for developers and researchers.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130942538","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
Machine Learning for Optimal Compression Format Prediction on Multiprocessor Platform 多处理器平台上最优压缩格式预测的机器学习
2018 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2018-07-01 DOI: 10.1109/HPCS.2018.00047
Ichrak Mehrez, O. Hamdi-Larbi, T. Dufaud, N. Emad
{"title":"Machine Learning for Optimal Compression Format Prediction on Multiprocessor Platform","authors":"Ichrak Mehrez, O. Hamdi-Larbi, T. Dufaud, N. Emad","doi":"10.1109/HPCS.2018.00047","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00047","url":null,"abstract":"Many scientific applications handle large size sparse matrices which can be stored using special compression formats to reduce memory space and processing time. The choice of the Optimal Compression Format (OCF) is a critical process that involves several criteria. In this paper, we propose to use machine learning approach to predict the OCF (among CSR, CSC, ELL and COO) for SMVP kernel on multiprocessor platform. Our goal is not only to reach high accuracy values but also to minimize the LUBS (Loss Under Best Selection). Our main contribution consists in using data parallel model to extract features dataset. Experimental results show that we achieve more than 95% accuracy","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122902001","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信