{"title":"Parallization of Adaboost Algorithm through Hybrid MPI/OpenMP and Transactional Memory","authors":"Kun Zeng, Yuhua Tang, Fudong Liu","doi":"10.1109/PDP.2011.97","DOIUrl":"https://doi.org/10.1109/PDP.2011.97","url":null,"abstract":"This paper proposes a parallelization of the Adaboost algorithm through hybrid usage of MPI, OpenMP, and transactional memory. After detailed analysis of the Adaboost algorithm, we show that multiple levels of parallelism exists in the algorithm. We develop the lower level of parallelism through OpenMP and higher level parallelism through MPI. Software transactional memory are used to facilitate the management of shared data among different threads. We evaluated the Hybrid parallelized Adaboost algorithm on a heterogeneous PC cluster. And the result shows that nearly linear speedup can be achieved given a good load balancing scheme. Moreover, the hybrid parallelized Adaboost algorithm outperforms Purely MPI based approach by about 14% to 26%.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127670239","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":"Energy-Aware Task Allocation for Network-on-Chip Based Heterogeneous Multiprocessor Systems","authors":"Jia Huang, C. Buckl, A. Raabe, A. Knoll","doi":"10.1109/PDP.2011.10","DOIUrl":"https://doi.org/10.1109/PDP.2011.10","url":null,"abstract":"Energy-efficiency is becoming one of the most critical issues in embedded system design. In Network-on-Chip (NoC) based heterogeneous Multiprocessor Systems, the energy consumption is influenced dramatically by task allocation schemes. Although various approaches are proposed to allocate tasks in an energy-efficient way, existing work does not well explore the tradeoff between the two major power consumers, namely the processors and network links, resulting in sub optimal mappings from a system point of view. In this paper, we first extend the existing Integer Linear Programming (ILP) formulation to take both processing and communication energy into account. Thereafter, we propose a Simulated Annealing with Timing Adjustment (SA-TA) heuristic to accelerate the optimization process. While the SA-TA algorithm achieves performance very close to the global optimum, significant improvement in computation speed is observed.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129529656","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}
Matthias Schmidt, Lars Baumgärtner, Pablo Graubner, David Böck, Bernd Freisleben
{"title":"Malware Detection and Kernel Rootkit Prevention in Cloud Computing Environments","authors":"Matthias Schmidt, Lars Baumgärtner, Pablo Graubner, David Böck, Bernd Freisleben","doi":"10.1109/PDP.2011.45","DOIUrl":"https://doi.org/10.1109/PDP.2011.45","url":null,"abstract":"The commercial success of Cloud Computing and recent developments in Grid Computing have brought platform virtualization technology into the field of high performance computing. Virtualization offers both more flexibility and security through custom user images and user isolation. In this paper, we present an approach for combined malware detection and kernel root kit prevention in virtualized Cloud Computing environments. All running binaries in a virtual instance are intercepted and submitted to one or more analysis engines. Besides a complete check against a signature database, live introspection of all system calls is performed to detect yet unknown exploits or malware. Furthermore, to prevent that an intruder retains persistent control over a running instance after a successful compromise, an in-kernel root kit prevention approach is proposed. Only authorized and thus trusted kernel modules are allowed to be loaded during runtime, loading of unauthorized modules is no longer possible. Finally, the performance of the presented solutions is evaluated.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"71 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131302","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. Pascual, A. J. Rubio-Montero, R. Mayo, Andrés Bustos, Francisco Castejón-Magaña, I. Llorente
{"title":"More Efficient Executions of Monte Carlo Fusion Codes by Means of Montera: The ISDEP Use Case","authors":"M. Pascual, A. J. Rubio-Montero, R. Mayo, Andrés Bustos, Francisco Castejón-Magaña, I. Llorente","doi":"10.1109/PDP.2011.46","DOIUrl":"https://doi.org/10.1109/PDP.2011.46","url":null,"abstract":"ISDEP (Integrator of Stochastic Differential Equations for Plasmas) is a Monte Carlo code that solves the plasma dynamics in a fusion device and perfectly scales on distributed computing platforms. Montera is a recent framework developed for achieving Grid efficient executions of Monte Carlo applications, as ISDEP is. In this work, the improvement of performing the calculations of ISDEP with Montera, which rise up to 34.9%, is shown as well as an analysis on the implications it could have, which aim to show to the fusion research community the benefits of using Montera.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123177544","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":"Simultaneous Anomaly and Misuse Intrusion Detections Based on Partial Approximative Set Theory","authors":"Z. Csajbók","doi":"10.1109/PDP.2011.47","DOIUrl":"https://doi.org/10.1109/PDP.2011.47","url":null,"abstract":"Nowadays, it is already a banality that people run their applications in a complex open computing environment including allsorts of interconnected devices. In order to meet the network security challenge in nonprofessional human environments, Intrusion Detection Systems (IDS) have to be designed. Intrusion detection techniques are categorized into anomaly and misuse detection. To describe the outlined problem, we focus solely on externally observable executions generated by the observed system. Thus, we need some sort of tool being able to discover acceptable and unacceptable patterns in execution traces. Such a tool may be the rough set theory. According to the rough set theory, the vagueness of a subset of a finite universe U is defined by the difference of its upper and lower approximations with respect to a partition of U. In this paper, our starting point will be an arbitrary family of subsets of an arbitrary U, neither that it covers U nor that U is finite will be assumed. This new approach is called the partial approximative set theory. We will apply this theory to build an IDS which is simultaneously able to detect anomaly and misuse intrusions.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128472625","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}
V. Raychoudhury, Jiannong Cao, Weigang Wu, Canfeng Chen
{"title":"Service Handoff for Reliable and Continuous Service Access in MANET","authors":"V. Raychoudhury, Jiannong Cao, Weigang Wu, Canfeng Chen","doi":"10.1109/PDP.2011.30","DOIUrl":"https://doi.org/10.1109/PDP.2011.30","url":null,"abstract":"Service unavailability frequently occurs in dynamic environments, like mobile ad hoc networks (MANET), due to service provider failure, network partitioning, or service scope outage by service provider or user mobility. Service handoff is needed to provide users with alternate matching services in case the original service becomes unavailable. However, existing service discovery solutions for MANET do not address this problem. In this paper, we propose a novel service discovery solution which employs service handoff to facilitate seamless service access for mobile users. The major concerns of service handoff are -- reducing handoff frequency, message cost, and delay as well as balancing loads on service providers. Addressing the above issues are challenging in the dynamic MANET environment. We design a reliable and seamless service discovery solution which employs two different service handoff protocols for different situations. Simulation results show that our protocols can support seamless service access for mobile users at low message cost and time delay while achieving high load balance among service providers.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132672192","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":"Reliability Study of Coding Schemes for Wide-Area Distributed Storage Systems","authors":"K. Peter","doi":"10.1109/PDP.2011.70","DOIUrl":"https://doi.org/10.1109/PDP.2011.70","url":null,"abstract":"Distributed storage systems comprise a large number of commodity hardware distributed across several data centers. Even in the presence of failures (permanent failures) the system should provide reliable storage. While replication has advantages because of its simplicity there exist coding techniques that provide adaptable reliability properties with an optimal redundancy ratio at the same time e.g. MDS (maximum distance separable) erasure codes. The coding and distribution scheme influences the prospective storage reliability. In this paper we present reliability models for erasure coding and replication techniques especially for their application in wide-area storage systems. Furthermore we utilize these models to quantify the reliability properties of concrete data storage scenarios.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131630643","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":"Efficient Parallel Execution of Streaming Applications on Multi-core Processors","authors":"T. Schüle","doi":"10.1109/PDP.2011.48","DOIUrl":"https://doi.org/10.1109/PDP.2011.48","url":null,"abstract":"We propose a method for the parallel execution of applications that process continuous streams of data. Unlike pipeline-based approaches, which are frequently employed to parallelize software for multi-core processors, our method supports nonlinear structures that may contain conditionals. Nonlinear structures reduce the latency for processing an element from a stream, which is particularly important for embedded systems that are subject to real-time constraints.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131928835","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}
Khalid Latif, A. Rahmani, L. Guang, T. Seceleanu, H. Tenhunen
{"title":"PVS-NoC: Partial Virtual Channel Sharing NoC Architecture","authors":"Khalid Latif, A. Rahmani, L. Guang, T. Seceleanu, H. Tenhunen","doi":"10.1109/PDP.2011.87","DOIUrl":"https://doi.org/10.1109/PDP.2011.87","url":null,"abstract":"A novel architecture aiming for ideal performance and overhead tradeoff, PVS-NoC (Partial VC Sharing NoC), is presented. Virtual channel (VC) is an efficient technique to improve network performance, while suffering from large silicon and power overhead. We propose sharing the VC buffers among dual inputs, which provides the performance advantage as conventional VC-based router with minimized overhead. We reason theoretically and demonstrate quantitatively the benefits of proposed architecture by comparing to state-of-the-art NoC routers, with various traffic patterns. Extensive experiments with synthetic and real benchmarks show significant area and power saving with similar performance compared to latest VC based NoC architectures.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134467324","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}
Katharina Haselhorst, Matthias Schmidt, Roland Schwarzkopf, N. Fallenbeck, Bernd Freisleben
{"title":"Efficient Storage Synchronization for Live Migration in Cloud Infrastructures","authors":"Katharina Haselhorst, Matthias Schmidt, Roland Schwarzkopf, N. Fallenbeck, Bernd Freisleben","doi":"10.1109/PDP.2011.43","DOIUrl":"https://doi.org/10.1109/PDP.2011.43","url":null,"abstract":"Live migration of virtual machines is an important issue in Cloud computing environments: when physical hosts are overloaded, some or all virtual machines can be moved to a less loaded host. Live migration poses additional challenges when virtual machines use local persistent storage, since the complete disk state needs to be transferred to the destination host while the virtual machines are running and hence are altering the disk state. In this paper, several approaches for implementing and synchronizing persistent storage during live migration of virtual machines in Cloud infrastructures are presented. Furthermore, the approaches also enable users to migrate swap space, which is currently not possible on most virtual machine hyper visors. Finally, measurements regarding disk synchronization, migration time and possible overheads are presented.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132400335","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}