Pub Date : 2012-08-16DOI: 10.1109/HPCSim.2012.6266904
Shivashis Saha, J. Deogun, Ying Lu
The designs of heterogeneous multi-core multiprocessor real-time systems are evolving for higher energy efficiency at the cost of increased heat density. This adversely effects the reliability and performance of the real-time systems. Moreover, the partitioning of periodic real-time tasks based on their worst case execution time can lead to significant energy wastage. In this paper, we investigate adaptive energy-efficient task partitioning for heterogeneous multi-core multiprocessor realtime systems. We use a power model which incorporates the impact of temperature and voltage of a processor on its static power consumption. Two different thermal models are used to estimate the peak temperature of a processor. We develop two feedback-based optimization and control approaches for adaptively partitioning real-time tasks according to their actual utilizations. Simulation results show that the proposed approaches are effective in minimizing the energy consumption and reducing the number of task migrations.
{"title":"Adaptive energy-efficient task partitioning for heterogeneous multi-core multiprocessor real-time systems","authors":"Shivashis Saha, J. Deogun, Ying Lu","doi":"10.1109/HPCSim.2012.6266904","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266904","url":null,"abstract":"The designs of heterogeneous multi-core multiprocessor real-time systems are evolving for higher energy efficiency at the cost of increased heat density. This adversely effects the reliability and performance of the real-time systems. Moreover, the partitioning of periodic real-time tasks based on their worst case execution time can lead to significant energy wastage. In this paper, we investigate adaptive energy-efficient task partitioning for heterogeneous multi-core multiprocessor realtime systems. We use a power model which incorporates the impact of temperature and voltage of a processor on its static power consumption. Two different thermal models are used to estimate the peak temperature of a processor. We develop two feedback-based optimization and control approaches for adaptively partitioning real-time tasks according to their actual utilizations. Simulation results show that the proposed approaches are effective in minimizing the energy consumption and reducing the number of task migrations.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127951972","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266911
Gloria Ortega López, J. Lobera, M. P. Arroyo, I. García, E. M. Garzón
This paper analyses several parallel approaches for the development of a physical model of Non-linear ODT for its application in velocimetry techniques. The main benefits of its application in HPIV are the high accuracy with non-damaging radiation and its imaging capability to recover information from the vessel wall of the flow. Thus ODT-HPIV is suitable for microfluidic devices and biofluidic applications. Our physical model is based on an iterative method which uses double-precision complex numbers, therefore it has a high computational cost. As a result, High Performance Computing is necessary for both: implementation and validation of the model. Concretely, the model has been parallelized by means of different architectures: shared-memory multiprocessors and graphics processing units (GPU) using the CUDA device.
{"title":"High performance computing for Optical Diffraction Tomography","authors":"Gloria Ortega López, J. Lobera, M. P. Arroyo, I. García, E. M. Garzón","doi":"10.1109/HPCSim.2012.6266911","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266911","url":null,"abstract":"This paper analyses several parallel approaches for the development of a physical model of Non-linear ODT for its application in velocimetry techniques. The main benefits of its application in HPIV are the high accuracy with non-damaging radiation and its imaging capability to recover information from the vessel wall of the flow. Thus ODT-HPIV is suitable for microfluidic devices and biofluidic applications. Our physical model is based on an iterative method which uses double-precision complex numbers, therefore it has a high computational cost. As a result, High Performance Computing is necessary for both: implementation and validation of the model. Concretely, the model has been parallelized by means of different architectures: shared-memory multiprocessors and graphics processing units (GPU) using the CUDA device.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"87 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":"115632408","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266953
Hassine Moungla, N. Touati, A. Mehaoua
This paper presents our conducting research and describes a new optimal deployment model for medical wireless body area network (WBAN) sensor devices (without mobility) and the relevant possible trade-offs between coverage, connectivity and network life time. We also integrate the effect of interference in wireless medium, and try to devise many-to-one and many-to-many model, that minimize the interference throughout the network and thus increase signal quality of wireless communication. The decrease in interference also facilitates energy efficiency, by increasing reliability, i.e. success ratio of wireless links. Topologies generated from our proposed model exhibit minimum energy consumption at maximum sensing coverage. The results show that significant improvements of initial deployments using feasible and cost-efficient solutions are possible. Our model leads to significantly optimized initial network deployments which can be subsequently used with other existing optimization techniques in literature. Overall operational lifetime and sensing coverage of WBSNs are strongly improved by our suggested deployment model.
{"title":"A power harvesting, dynamic and reliable wireless body area networks model deployment for health care applications","authors":"Hassine Moungla, N. Touati, A. Mehaoua","doi":"10.1109/HPCSim.2012.6266953","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266953","url":null,"abstract":"This paper presents our conducting research and describes a new optimal deployment model for medical wireless body area network (WBAN) sensor devices (without mobility) and the relevant possible trade-offs between coverage, connectivity and network life time. We also integrate the effect of interference in wireless medium, and try to devise many-to-one and many-to-many model, that minimize the interference throughout the network and thus increase signal quality of wireless communication. The decrease in interference also facilitates energy efficiency, by increasing reliability, i.e. success ratio of wireless links. Topologies generated from our proposed model exhibit minimum energy consumption at maximum sensing coverage. The results show that significant improvements of initial deployments using feasible and cost-efficient solutions are possible. Our model leads to significantly optimized initial network deployments which can be subsequently used with other existing optimization techniques in literature. Overall operational lifetime and sensing coverage of WBSNs are strongly improved by our suggested deployment model.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"14 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":"126004072","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266971
Jonathan Passerat-Palmbach, C. Mazel, D. Hill
Parallel And Distributed Simulations (PADS) become more and more spread since scientists always want more accurate results in the shortest time. PADS are often sensitive to several parameters, and when they own a stochastic component, one has to ensure he knows how to correctly deal with randomness in a parallel application. This point can appear to be very tricky for non-experts, who might be tempted to move this part of the simulation aside. Several software efforts have been produced in various programming languages to help developers handle pseudorandom streams partitioning in PADS. However, these tools remain third-party libraries that need to be integrated in already existing applications, and that might be hardly swappable. The latest release of the Java Development Kit (JDK 7) tries to tackle this problem with a new class called ThreadLocalRandom. The latter is in charge of safe pseudorandom number generation across Java threads. The present work studies the pros and cons of this approach, and introduces ThreadLocalMRG32k3a, an alternative to ThreadLocalRandom that shows better results in terms of generation speed and statistical quality. ThreadLocalMRG32k3a respects the same Application Programming Interface (API) as ThreadLocalRandom, thus enabling clients to use it in place of its JDK counterpart at no cost.
{"title":"ThreadLocalMRG32k3a: A statistically sound substitute to pseudorandom number generation in parallel Java applications","authors":"Jonathan Passerat-Palmbach, C. Mazel, D. Hill","doi":"10.1109/HPCSim.2012.6266971","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266971","url":null,"abstract":"Parallel And Distributed Simulations (PADS) become more and more spread since scientists always want more accurate results in the shortest time. PADS are often sensitive to several parameters, and when they own a stochastic component, one has to ensure he knows how to correctly deal with randomness in a parallel application. This point can appear to be very tricky for non-experts, who might be tempted to move this part of the simulation aside. Several software efforts have been produced in various programming languages to help developers handle pseudorandom streams partitioning in PADS. However, these tools remain third-party libraries that need to be integrated in already existing applications, and that might be hardly swappable. The latest release of the Java Development Kit (JDK 7) tries to tackle this problem with a new class called ThreadLocalRandom. The latter is in charge of safe pseudorandom number generation across Java threads. The present work studies the pros and cons of this approach, and introduces ThreadLocalMRG32k3a, an alternative to ThreadLocalRandom that shows better results in terms of generation speed and statistical quality. ThreadLocalMRG32k3a respects the same Application Programming Interface (API) as ThreadLocalRandom, thus enabling clients to use it in place of its JDK counterpart at no cost.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"624 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":"122944936","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266995
Bunjamin Memishi, María S. Pérez, Gabriel Antoniu
The popularity of MapReduce programming model has increased interest in the research community for its improvement. Among the other directions, the point of fault tolerance, concretely the failure detection issue seems to be a crucial one, but that until now has not reached its satisfying level. Motivated by this, I decided to devote my main research during this period into having a prototype system architecture of MapReduce framework with a new failure detection service, containing both analytical (theoretical) and implementation part. I am confident that this work should lead the way for further contributions in detecting failures to any NoSQL App frameworks, and cloud storage systems in general.
{"title":"Enhanced failure detection mechanism in MapReduce","authors":"Bunjamin Memishi, María S. Pérez, Gabriel Antoniu","doi":"10.1109/HPCSim.2012.6266995","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266995","url":null,"abstract":"The popularity of MapReduce programming model has increased interest in the research community for its improvement. Among the other directions, the point of fault tolerance, concretely the failure detection issue seems to be a crucial one, but that until now has not reached its satisfying level. Motivated by this, I decided to devote my main research during this period into having a prototype system architecture of MapReduce framework with a new failure detection service, containing both analytical (theoretical) and implementation part. I am confident that this work should lead the way for further contributions in detecting failures to any NoSQL App frameworks, and cloud storage systems in general.","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":"129839347","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266988
G. Fernández, A. García-Loureiro, M. Aldegunde
As an intermediate step in a semiconductor device simulation framework, we write a multipole method to evaluate the electrostatic potential in the boundary nodes induced by the conduction electrons. A method initially designed to solve the n-body problem could not be the best choice, but as we have found, the results are excellent, obtaining a speed up of about 300 at some cases, and even 600 at the best situation, compared with the classical method using one core. Also, the method offers small errors and we find a good opportunity to optimize the algorithm in future works.
{"title":"Static multipole method applied to boundary conditions for semiconductor device simulations","authors":"G. Fernández, A. García-Loureiro, M. Aldegunde","doi":"10.1109/HPCSim.2012.6266988","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266988","url":null,"abstract":"As an intermediate step in a semiconductor device simulation framework, we write a multipole method to evaluate the electrostatic potential in the boundary nodes induced by the conduction electrons. A method initially designed to solve the n-body problem could not be the best choice, but as we have found, the results are excellent, obtaining a speed up of about 300 at some cases, and even 600 at the best situation, compared with the classical method using one core. Also, the method offers small errors and we find a good opportunity to optimize the algorithm in future works.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"35 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":"128356654","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266928
S. Suboh, Vikram K. Narayana, M. Bakhouya, T. El-Ghazawi
Network-on-Chip (NoC) architectures were proposed to solve scalability issues experienced in bus-based SoCs. They incorporate a communication infrastructure defined by topology, routers and switches, in order to provide a scalable and high performance network for the SoC resources while satisfying the constraints of embedded platforms. The choice of appropriate NoC topology depends on the desired network size for the required performance. Simulation of NoCs based on real application traffic is time consuming, and therefore not a feasible approach for rapid design space exploration. In this paper, a methodology to study the scalability of three on-chip interconnect architectures, WK-recursive, Mesh and Spidergon, is presented. Simulation results are presented for different cases, demonstrating the potential of our approach for selecting the most scalable on-chip interconnect architecture.
{"title":"A scalability study of interconnect architectures for System-on-Chip","authors":"S. Suboh, Vikram K. Narayana, M. Bakhouya, T. El-Ghazawi","doi":"10.1109/HPCSim.2012.6266928","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266928","url":null,"abstract":"Network-on-Chip (NoC) architectures were proposed to solve scalability issues experienced in bus-based SoCs. They incorporate a communication infrastructure defined by topology, routers and switches, in order to provide a scalable and high performance network for the SoC resources while satisfying the constraints of embedded platforms. The choice of appropriate NoC topology depends on the desired network size for the required performance. Simulation of NoCs based on real application traffic is time consuming, and therefore not a feasible approach for rapid design space exploration. In this paper, a methodology to study the scalability of three on-chip interconnect architectures, WK-recursive, Mesh and Spidergon, is presented. Simulation results are presented for different cases, demonstrating the potential of our approach for selecting the most scalable on-chip interconnect architecture.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"60 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":"128339094","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266958
M. Ferdous, R. Poet
In this paper, we present a comparative analysis of a few popular Identity Management Systems against a set of requirements. Identity Management and Identity Management Systems have gained significant attention in recent years with the proliferation of different web-enabled and e-commerce services leading to an extensive research on the field in the form of several projects producing many standards, prototypes and application models both in the academia and the industry. We have collected and compiled different requirements from different sources to profile an extensive set of requirements that are required for a Privacy-Enhancing Identity Management System and presented them in the form of a taxonomy. Then we have compared some Identity Management Systems against those requirements and presented them in a concise way to help readers find out instantly which systems satisfy what requirements and thus help them to choose the correct one to fit into their own scenarios.
{"title":"A comparative analysis of Identity Management Systems","authors":"M. Ferdous, R. Poet","doi":"10.1109/HPCSim.2012.6266958","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266958","url":null,"abstract":"In this paper, we present a comparative analysis of a few popular Identity Management Systems against a set of requirements. Identity Management and Identity Management Systems have gained significant attention in recent years with the proliferation of different web-enabled and e-commerce services leading to an extensive research on the field in the form of several projects producing many standards, prototypes and application models both in the academia and the industry. We have collected and compiled different requirements from different sources to profile an extensive set of requirements that are required for a Privacy-Enhancing Identity Management System and presented them in the form of a taxonomy. Then we have compared some Identity Management Systems against those requirements and presented them in a concise way to help readers find out instantly which systems satisfy what requirements and thus help them to choose the correct one to fit into their own scenarios.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"17 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":"129332248","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266980
M. Plóciennik, T. Zok, M. Owsiak, B. Palak, B. Guillerminet, Y. Frauel, F. Imbeaux, B. Scott
This paper describes chosen aspects of the European Integrated Tokamak Modelling Task Force (ITM-TF) effort. It covers topics related to latest developments towards providing fusion scientists with a software framework for fusion modeling and simulation. The proposed framework provides researchers with an easy to use, workflow based environment for scientific computations. It allows the execution of various applications in numerous distributed computational resources directly from a user friendly, intuitive interface. We present the latest advances in the development of easy to use tools allowing the integration of the physics codes into the scientific workflows that schedule jobs to different infrastructures. The presented approach provides a simple way to access extensive computational resources and hides the complexity of the process at the same time. It allows for easy extension of existing simulation scenarios and fast prototyping. Some aspects of interactive communication between workflow environment and running jobs are discussed. Results of two practical use cases are presented in the context of the discussed workflow based solution: a parametric study and a plasma turbulence workflow.
{"title":"High level tools for fusion simulations workflows in distributed computing environment","authors":"M. Plóciennik, T. Zok, M. Owsiak, B. Palak, B. Guillerminet, Y. Frauel, F. Imbeaux, B. Scott","doi":"10.1109/HPCSim.2012.6266980","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266980","url":null,"abstract":"This paper describes chosen aspects of the European Integrated Tokamak Modelling Task Force (ITM-TF) effort. It covers topics related to latest developments towards providing fusion scientists with a software framework for fusion modeling and simulation. The proposed framework provides researchers with an easy to use, workflow based environment for scientific computations. It allows the execution of various applications in numerous distributed computational resources directly from a user friendly, intuitive interface. We present the latest advances in the development of easy to use tools allowing the integration of the physics codes into the scientific workflows that schedule jobs to different infrastructures. The presented approach provides a simple way to access extensive computational resources and hides the complexity of the process at the same time. It allows for easy extension of existing simulation scenarios and fast prototyping. Some aspects of interactive communication between workflow environment and running jobs are discussed. Results of two practical use cases are presented in the context of the discussed workflow based solution: a parametric study and a plasma turbulence workflow.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"318 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":"115833184","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}
Pub Date : 2012-07-02DOI: 10.1109/HPCSim.2012.6266885
L. Ricci, E. Carlini
Distributed Virtual Environments (DVEs), like Massively Multiplayer Online Games (MMOG) are attracting millions of users from all over the world. However, as the number of simultaneous users keeps growing, the current used Client/Server infrastructure technologies are showing their limits on the side of the practicality and applicability. As a consequence, novel solutions based on Cloud and P2P architectures have been recently proposed. While Cloud Architectures permit to overcome the over provisioning problem of C/S architectures, the advent of home xDSL connection capability permits to explore the capability of P2P approaches to design the infrastructure of next-generation DVEs. The use of P2P distributed infrastructures permits to exploit the inherent scalability of DVE, their robustness and self-organizing properties. However, this solution has to face with additional related challenges such as consistency, persistence and limited hardware capabilities of the peers. This paper discusses the main research challenges and reviews the main DVE architectures proposed in the last years.
{"title":"Distributed Virtual Environments: From client server to cloud and P2P architectures","authors":"L. Ricci, E. Carlini","doi":"10.1109/HPCSim.2012.6266885","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266885","url":null,"abstract":"Distributed Virtual Environments (DVEs), like Massively Multiplayer Online Games (MMOG) are attracting millions of users from all over the world. However, as the number of simultaneous users keeps growing, the current used Client/Server infrastructure technologies are showing their limits on the side of the practicality and applicability. As a consequence, novel solutions based on Cloud and P2P architectures have been recently proposed. While Cloud Architectures permit to overcome the over provisioning problem of C/S architectures, the advent of home xDSL connection capability permits to explore the capability of P2P approaches to design the infrastructure of next-generation DVEs. The use of P2P distributed infrastructures permits to exploit the inherent scalability of DVE, their robustness and self-organizing properties. However, this solution has to face with additional related challenges such as consistency, persistence and limited hardware capabilities of the peers. This paper discusses the main research challenges and reviews the main DVE architectures proposed in the last years.","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":"130432480","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：