{"title":"Adapted discrete-based entropy cache replacement algorithm","authors":"Filipe Scoton, J. Kobayashi, M. Marino","doi":"10.1109/HPCSim.2012.6266969","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266969","url":null,"abstract":"It is fundamental to predict cache line reuse in order to improve miss rates and consequently performance. In order to estimate cache line reuse, we assume that a sequence of cache line addresses can be treated randomly as characters in an arbitrary language such as proposed by the Information Theory. In this theory, the occurrence of each character previously occurred in a message composed by a sequence of characters can be used as a measurement of information - named entropy. The computation of the entropy of a program working set helps to estimate the chances of line reuse. We propose Adapted Discrete-based Entropy Algorithm (ADEA), a novel cache line replacement inspired by the Information Entropy which measures the discrete entropy by capturing the referential locality of programs by estimating the chances of cache line reuse. Furthermore, ADEA presents functions that control the essency and recency of memory access to avoid cache pinning. We present ADEA circuit complexity and show that it is comparable to other implementations. By modeling and evaluating ADEA using Simple Scalar for an L2 cache of an OOO processor, results show that ADEA's miss rate is up to 60% lower than LRU and 36% compared to adaptive policies Least Recently Used Insertion Policy (LIP) and Bimodal Insertion Policy (BIP). Furthermore, the use of ADEA's decay functions improves its miss rates up to 46% by avoiding pinning.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130430533","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}
{"title":"Parallel batch pattern training of neural networks on computational clusters","authors":"V. Turchenko, L. Grandinetti, A. Sachenko","doi":"10.1109/HPCSim.2012.6266912","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266912","url":null,"abstract":"The research of a parallelization efficiency of a batch pattern training algorithm of a multilayer perceptron on computational clusters is presented in this paper. The multilayer perceptron model and the usual sequential batch pattern training algorithm are theoretically described. An algorithmic description of the parallel version of the batch pattern training method is presented. The efficiency of parallelization of the developed algorithm is investigated on the progressive increasing the dimension of the parallelized problem. The results of the experimental researches show that (i) the cluster with Infiniband interconnection shows better values of parallelization efficiency in comparison with general-purpose parallel computer with cc numa architecture due to lower communication overhead and (ii) the parallelization efficiency of the algorithm is high enough for its appropriate usage on general-purpose clusters and parallel computers available within modern computational grids.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127832207","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}
Jhan Yuler De la Pava Torres, Claudia Jiménez-Guarín
{"title":"MagosCloud Secure: A secure, highly scalable platform for services in an opportunistic environment","authors":"Jhan Yuler De la Pava Torres, Claudia Jiménez-Guarín","doi":"10.1109/HPCSim.2012.6266890","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266890","url":null,"abstract":"Application developers require cloud solutions that offer a highly scalable and secure development environment. Some Platform-as-a-Service (PaaS) solutions fail to meet the security requirements of developers, administrators, and final users in a satisfactory and flexible manner. While some providers do offer secure cloud solutions, users are obliged to redesign and adapt their applications in order to conform to the provided environment. The present work introduces MagosCloud Secure, a highly-scalable, opportunistic, declarative, and secure solution constructed on the basis of MagosCloud[1], designed to meet the needs of traditional and e-science application developers. It allows the deployment of a variety of platforms, providing an access control model whereby developers may declaratively state how they wish their data and application resources to be automatically shared with other users. It relies on the concept of `separation of concerns', such that developers need only be concerned with creating their applications, entrusting MagosCloud Secure with the responsibility of providing a secure, highly scalable platform. Finally, the results of tests concerning the automatic generation of secure platforms, as well as run time considerations, are analyzed.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264130","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}
{"title":"MalikStone — A context-aware light-weight benchmark for P2P computing","authors":"M. S. Awan, S. Jarvis","doi":"10.1109/HPCSim.2012.6266936","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266936","url":null,"abstract":"Benchmarking has been used by performance engineers for over three decades to gain better insight into system performance. Numerous benchmarks are used in industry to characterize the performance of standalone systems on the one hand, to measure the computational efficiency of massively parallel systems such as clusters, grids and supercomputers, on the other hand. One of the common features of performance evaluation of small or large standalone systems is that performance engineers have direct and full control over these systems. The peer-to-peer (P2P) paradigm, which involves volunteer participation for execution of lengthy and complex scientific computations, operates in an uncontrolled environment. The performance evaluation of participating nodes operating in an uncontrolled P2P environment is a challenging task. Currently, two traditional synthetic benchmarks (Dhrystone and Whetstone) are used as part of Berkeley Open Infrastructure for Network Computing (BOINC)'s Accounting System for granting credits to the participating nodes. The analysis of the performance data obtained from running Dhrystone and Whetstone on general purpose computers has highlighted the limitations of these benchmarks. This study proposes a new synthetic light-weight benchmark - MalikStone, which is representative of large P2P projects and has been specifically designed in view the dynamic nature and challenges of the P2P paradigm. The benchmark integrates the strengths of existing synthetic benchmarks and provides more detailed insight into system performance by capturing the context in which the benchmarking was performed. The results of this newly designed benchmark have been found to be encouraging. Compared with existing synthetic benchmarks, Dhrystone and Whetstone, and the SPEC CPU2006 benchmarking suite, we highlight MalikStone's superiority in characterizing system performance in P2P settings.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"os-42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127783462","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}
{"title":"Improving user experience of submitting jobs to HPC resources","authors":"G. Stewart, W. Vanderbauwhede","doi":"10.1109/HPCSim.2012.6266985","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266985","url":null,"abstract":"The growth of e-science and grid computing has presented new opportunities to researchers for whom access to large computational and data-storage resources is essential, offering a choice of resources on which to conduct such work. The selection of an appropriate resource, or resources, can have a significant impact on the rate of progress of such work, but only if all relevant properties of a job's structure are taken into consideration; this is not the case with currently-used resource brokering systems. This paper proposes a method by which resource-brokering can be improved for real-world engineering jobs comprising many constituent tasks, and demonstrates through means of simulation the improvement that such a method offers, which in some cases reduces average execution times of individual tasks by over thirty percent.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114582859","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}
J. Reynolds-Barredo, D. Newman, R. Sánchez, L. Berry
{"title":"Modelling parareal convergence in 2D drift wave plasma turbulence","authors":"J. Reynolds-Barredo, D. Newman, R. Sánchez, L. Berry","doi":"10.1109/HPCSim.2012.6267004","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6267004","url":null,"abstract":"Parareal [1] is a recent time parallelization algorithm based on a predictor-corrector scheme. On the predictor stage, a fast coarse solver gives an approximate solution for all the simulation time. On the correction stage, the fine solver is used for correcting the result. The process is iterated until convergence. A successful application of parareal to an specific problem depend strongly on finding a good coarse solver. In particular, the algorithm has been successfully applied by some of the authors to fully developed two dimensional drift wave plasma turbulence [2]. Here we study the convergence of the parareal for that turbulence case from a physical point of view [3]. As a second stage, it is built a framework for studying the convergence. The framework is strongly based on the physics of the problem, and aims to generalize the knowledge to other problems. The final objective is to help on the process of finding an adequate coarse solver for similar problems or give new ideas for other cases.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117088356","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}
Doohyun Ko, Dongwan Kim, Beomjin Kim, Sungjun Kim, Jonghun Jang, Sunshin An
{"title":"WiMoS: Wise mobile sensor networks a study on design of infrastructure for supporting mobile WSNs in wide area","authors":"Doohyun Ko, Dongwan Kim, Beomjin Kim, Sungjun Kim, Jonghun Jang, Sunshin An","doi":"10.1109/HPCSim.2012.6266954","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266954","url":null,"abstract":"We propose a network infrastructure, called wise mobile sensor network (WiMoS), for supporting mobile WSNs in wide area. WiMoS has been developed to integrate conventional WSN systems and provide efficient location based services (LBSs), and has been designed by the open structure which has standard interfaces to support machine to machine (M2M) and internet of things (IoT). This paper introduces the system architecture, functions, implementation, and standardization issues for WiMoS.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910278","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}
Zaina Afoulki, Aline Bousquet, Jérémy Briffaut, Jonathan Rouzaud-Cornabas, C. Toinard
{"title":"MAC protection of the OpenNebula Cloud environment","authors":"Zaina Afoulki, Aline Bousquet, Jérémy Briffaut, Jonathan Rouzaud-Cornabas, C. Toinard","doi":"10.1109/HPCSim.2012.6266895","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266895","url":null,"abstract":"Mandatory Access Control is really poorly supported by Cloud environments. Our paper proposes extensions of the OpenNebula Cloud software in order to provide an advanced MAC protection of the virtual machines hosted by the different nodes of the Cloud. Thus, unique SELinx security labels are associated with the virtual machines and their resources. The instantiations and migrations of the virtual machines maintain those unique security labels. Moreover, PIGA-Virt provides an unified way to control the information flows within a virtual machine but also between multiple virtual machines. SELinux controls the direct flows. PIGA-Virt adds advanced controls. Thus, a PIGA protection rule can control several direct and indirect flows and allows the administrator to express high level security properties. The benchmarks of PIGA-Virt show that our Trusted OpenNebula Cloud is efficient regarding the quality of the protection.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129210341","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}
{"title":"Transparent fault tolerance middleware at user level","authors":"Marcela Castro-León, Dolores Rexachs, E. Luque","doi":"10.1109/HPCSim.2012.6266974","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266974","url":null,"abstract":"We present a design of a transparent fault tolerance middleware for message passing applications. The approach consists in transforming the interconnections used by the application in reliable ones and support log-based rollback recovery protocol. When one of the nodes of the cluster fails, the processes are recovered in a new one and the connections are reestablished. All this work is made automatically and in a transparent way for the application. This service can be optionally activated at runtime at user level. The models used for protection and recovering application and detection of failures are based on RADIC architecture. We have tested this middleware by executing a master-worker (M/W) and SPMD applications which follow different communication patterns.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130927638","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}
M. Bakhouya, A. Chariete, J. Gaber, M. Wack, S. Niar, E. Coatanéa
{"title":"Performance evaluation of a flow control algorithm for Network-on-Chip","authors":"M. Bakhouya, A. Chariete, J. Gaber, M. Wack, S. Niar, E. Coatanéa","doi":"10.1109/HPCSIM.2012.6266925","DOIUrl":"https://doi.org/10.1109/HPCSIM.2012.6266925","url":null,"abstract":"Network-on-chip (NoC) has been proposed for SoC (System-on-Chip) as an alternative to on-chip bus-based interconnects to achieve better performance and lower energy consumption. Several approaches have been proposed to deal with NoCs design and can be classified into two main categories, design-time approaches and run-time approaches. Design-time approaches are generally tailored for an application domain or a specific application by providing a customized NoC. All parameters, such as routing and switching schemes, are defined at design time. Run-time approaches, however, provide techniques that allow a NoC to continuously adapt its structure and its behavior (i.e., at runtime). In this paper, performance evaluation of a flow control algorithm for congestion avoidance in NoCs is presented. This algorithm allows NoC elements to dynamically adjust their inflow by using a feedback control-based mechanism. Analytical and simulation results are reported to show the viability of this mechanism for congestion avoidance in NoCs.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125602160","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}