Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 14
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Dynamic CPU provisioning for self-managed secure web applications in SMP hosting platforms

  • Guitart Fernández, Jordi|||0000-0003-0751-3100
  • Carrera Pérez, David|||0000-0003-4898-3424
  • Beltran Querol, Vicenç
  • Torres Viñals, Jordi|||0000-0003-1963-7418
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
Overload control mechanisms such as admission control and connection differentiation have proven effective for preventing overload of application servers running secure web applications. However, achieving optimal results in overload prevention is only possible when some kind of resource management is considered in addition to these mechanisms. In this paper we propose an overload control strategy for secure web applications that brings together dynamic provisioning of platform resources and admission control based on secure socket layer (SSL) connection differentiation. Dynamic provisioning enables additional resources to be allocated to an application on demand to handle workload increases, while the admission control mechanism avoids the server’s performance degradation by dynamically limiting the number of new SSL connections accepted and preferentially serving resumed SSL connections (to maximize performance on session-based environments) while additional resources are being provisioned. Our evaluation demonstrates the benefit of our proposal for efficiently managing the resources and preventing server overload on a 4-way multiprocessor Linux hosting platform, especially when the hosting platform is fully overloaded., This work is supported by the Ministry of Science and Technology of Spain and the European Union (FEDER funds) under Contracts TIN2004-07739-C02-01 and TIN2007-60625 and by the BSC (Barcelona Supercomputing Center)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Leveraging task-parallelism in message-passing dense matrix factorizations using SMPSs

  • Martín Huertas, Alberto Francisco|||0000-0001-5751-4561
  • Reyes, Ruyman
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Quintana Ortí, Enrique Salvador
In this paper, we investigate how to exploit task-parallelism during the execution of the Cholesky factorization on clusters of multicore processors with the SMPSs programming model. Our analysis reveals that the major difficulties in adapting the code for this operation in ScaLAPACK to SMPSs lie in algorithmic restrictions and the semantics of the SMPSs programming model, but also that they both can be overcome with a limited programming effort. The experimental results report considerable gains in performance and scalability of the routine parallelized with SMPSs when compared with conventional approaches to execute the original ScaLAPACK implementation in parallel as well as two recent message-passing routines for this operation. In summary, our study opens the door to the possibility of reusing message-passing legacy codes/libraries for linear algebra, by introducing up-to-date techniques like dynamic out-of-order scheduling that significantly upgrade their performance, while avoiding a costly rewrite/reimplementation., This research was supported by Project EU INFRA-2010-1.2.2 \TEXT:Towards EXa op applicaTions". The researcher at BSC-CNS was supported by the HiPEAC-2 Network of Excellence (FP7/ICT 217068), the Spanish Ministry of Education (CICYT TIN2011-23283, TIN2007-60625 and CSD2007- 00050), and the Generalitat de Catalunya (2009-SGR-980). The researcher at CIMNE was partially funded by the UPC postdoctoral grants under the programme \BKC5-Atracció i Fidelització de talent al BKC". The researcher at UJI was supported by project CICYT TIN2008-06570-C04-01 and FEDER. We thank Jesus Labarta, from BSC-CNS, for helpful discussions on SMPSs and his help with the performance analysis of the codes with Paraver. We thank Vladimir Marjanovic, also from BSC-CNS, for his help in the set-up and tuning of the MPI/SMPSs tools on JuRoPa. Finally, we thank Rafael Mayo, from UJI, for his support in the preliminary stages of this work. The authors gratefully acknowledge the computing time granted on the supercomputer JuRoPa at Jülich Supercomputing Centrer., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Business-driven management of infrastructure-level risks in Cloud providers

  • Fitó Comellas, Josep Oriol
  • Guitart Fernández, Jordi|||0000-0003-0751-3100
Cloud computing is an innovative and promising paradigm that is leading to remarkable changes in the way in which hardware and software are designed and purchased, as well as how IT systems are managed. However, the Cloud is a risky paradigm. For instance, the use of Cloud services, which usually are external assets to their consumers, implies unprecedented risks that must be taken into account.; In this paper, we propose the involvement of the risk management discipline into the Cloud computing realm. We present a risk management approach led by business-level objectives (BLOs) of Cloud organizations. Its main goal is to assist in business-driven self-managed Cloud providers, by facing uncertainties always present in their internal decision-making processes. Our Cloud-aware risk management method includes a SEmi-quantitative BLO-driven Cloud Risk Assessment (SEBCRA) as the core subprocess. Its aim is to constantly rank and prioritize risks affecting the governing business-level goals.; In addition, we present, as a use case, a PaaS provider that incorporates our risk management approach to enhance the achievement of two BLOs, i.e. maximization of profit and customer satisfaction. In particular, it can manage - identify, assess, and treat - the most critical Cloud infrastructure-level risks, i.e. provisioning its private Cloud, either under- or over-provisioning, as well as resource failures. We present some risk treatment responses to face these risks and we evaluate their impact on the above-mentioned BLOs. Our results show that the best responses to address risks may change over time depending on the current provider's status. As a result, an adaptive management of risks should be considered as a mandatory process for Cloud providers to ensure their success in the ever-growing worldwide ecosystem of Clouds. (C) 2012 Elsevier B.V. All rights reserved., This work is supported by the Ministry of Science and Technology of Spain and the European Union (FEDER funds) under contract TIN2007-60625, by the Generalitat de Catalunya under contract 2009-SGR-980, and by the European Commission under FP7-ICT-2009-5 contract 257115 (OPTIMIS)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

DaSH: a benchmark suite for hybrid dataflow and shared memory programming models

  • Gajinov, Vladimir
  • Stipic, Srdjan
  • Eric, Igor
  • Unsal, Osman Sabri
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
  • Cristal Kestelman, Adrián|||0000-0003-1277-9296
The current trend in development of parallel programming models is to combine different well established models into a single programming, model in order to support efficient implementation of a wide range of real world applications. The dataflow model has particularly managed to recapture the interest of the research community due to its ability to express parallelism efficiently. Thus, a number of recently proposed hybrid parallel programming models combine dataflow and traditional shared memory models. Their findings have influenced the introduction of task dependency in the OpenMP 4.0 standard.; This article presents DaSH - the first comprehensive benchmark suite for hybrid dataflow and shared memory programming models. DaSH features 11 benchmarks, each representing one of the Berkeley dwarfs that capture patterns of communication and computation common to a wide range of emerging applications. DaSH also includes sequential and shared-memory implementations based on OpenMP and Intel TBB to facilitate easy comparison between hybrid dataflow implementations and traditional shared memory implementations based on work-sharing and/or tasks. Finally, we use DaSH to evaluate three different hybrid dataflow models, identify their advantages and shortcomings, and motivate further research on their characteristics., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A service framework for energy-aware monitoring and VM management in clouds

  • Katsaros, Gregory
  • Subirats, Josep
  • Fitó Comellas, Josep Oriol
  • Guitart Fernández, Jordi|||0000-0003-0751-3100
  • Gilet, Pierre
  • Espling, Daniel
The monitoring of QoS parameters in Services Computing as well as in Clouds has been a functionality provided by all contemporary systems. As the optimization of energy consumption becomes a major concern for system designers and administrators, it can be considered as another QoS metric to be monitored. In this paper, we present a service framework that allows us to monitor the energy consumption of a Cloud infrastructure, calculate its energy efficiency, and evaluate the gathered data in order to put in place an effective virtual machine (VM) management. In that context, a simulation scenario of an eco-driven VM placement policy resulted in a 14% improvement of the infrastructure’s energy efficiency. In total, the proposed approaches and implementations have been validated against a testbed, producing very promising results regarding the prospect of energy efficiency as an important quality factor in Clouds., This work has been supported by the OPTIMIS project (http://www.optimis-project.eu/)[33], [21] and has been partly funded by the European Commission’s IST activity of the 7th Framework Program under contract number 257115. This work expresses the opinions of the authors and not necessarily those of the European Commission. The European Commission is not liable for any use that may be made of the information contained in this work. It is also supported by the Ministry of Science and Technology of Spain and the European Union (FEDER funds) under contract TIN2007-60625, by the Generalitat de Catalunya under contract 2009-SGR-980., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Thread assignment of multithreaded network applications in multicore/multithreaded processors

  • Radojković, Petar
  • Cakarevic, Vladimir
  • Verdú Mulà, Javier|||0000-0003-4485-2419
  • Pajuelo González, Manuel Alejandro|||0000-0002-5510-6860
  • Cazorla Almeida, Francisco Javier
  • Nemirovsky, Mario
  • Valero Cortés, Mateo|||0000-0003-2917-2482
© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The introduction of multithreaded processors comprised of a large number of cores with many shared resources makes thread scheduling, and in particular optimal assignment of running threads to processor hardware contexts to become one of the most promising ways to improve the system performance. However, finding optimal thread assignments for workloads running in state-of-the-art multicore/multithreaded processors is an NP-complete problem. In this paper, we propose BlackBox scheduler, a systematic method for thread assignment of multithreaded network applications running on multicore/multithreaded processors. The method requires minimum information about the target processor architecture and no data about the hardware requirements of the applications under study. The proposed method is evaluated with an industrial case study for a set of multithreaded network applications running on the UltraSPARC T2 processor. In most of the experiments, the proposed thread assignment method detected the best actual thread assignment in the evaluation sample. The method improved the system performance from 5 to 48 percent with respect to load balancing algorithms used in state-of-the-art OSs, and up to 60 percent with respect to a naive thread assignment., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Hints to improve automatic load balancing with LeWI for hybrid applications

  • Garcia Gasulla, Marta|||0000-0003-3682-9905
  • Labarta Mancho, Jesús José|||0000-0002-7489-4727
  • Corbalán González, Julita|||0000-0002-3926-5634
The DLB (Dynamic Load Balancing) library and LeWl (LEnd When Idle) algorithm provide a runtime solution to deal with the load imbalance of parallel applications independently of the source of imbalance. DLB relies on the usage of hybrid programming models and exploits the malleability of the second level of parallelism to redistribute computation power across processes.; When executing real applications with LeWl, although application's performance is significantly improved, we have observed in some cases efficiency values between 60% and 70%, far from our theoretical limit.; This work is a deep analysis of the sources of efficiency loss correlated with application characteristics, parallelization schemes and programming models. We have based our analysis in fine grain monitoring tools and metrics and validated our conclusions by reproducing them in synthetic experiments. As a result, this work teaches us some lessons that can be seen as hints to programmers to help LeWI make an efficient use of computational resources and obtain the maximum performance. (C) 2014 Elsevier Inc. All rights reserved., We thankfully acknowledge the support of the Spanish Ministry of Education (TIN2007-60625, and CSD2007-00050) and the Generalitat de Catalunya (2009-SGR-980)., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A service framework for energy-aware monitoring and VM management in clouds

  • Katsaros, Gregory
  • Subirats, Josep
  • Fitó Comellas, Josep Oriol
  • Guitart Fernández, Jordi
  • Gilet, Pierre
  • Espling, Daniel
The monitoring of QoS parameters in Services Computing as well as in Clouds has been a functionality provided by all contemporary systems. As the optimization of energy consumption becomes a major concern for system designers and administrators, it can be considered as another QoS metric to be monitored. In this paper, we present a service framework that allows us to monitor the energy consumption of a Cloud infrastructure, calculate its energy efficiency, and evaluate the gathered data in order to put in place an effective virtual machine (VM) management. In that context, a simulation scenario of an eco-driven VM placement policy resulted in a 14% improvement of the infrastructure’s energy efficiency. In total, the proposed approaches and implementations have been validated against a testbed, producing very promising results regarding the prospect of energy efficiency as an important quality factor in Clouds., This work has been supported by the OPTIMIS project (http://www.optimis-project.eu/)[33], [21] and has been partly funded by the European Commission’s IST activity of the 7th Framework Program under contract number 257115. This work expresses the opinions of the authors and not necessarily those of the European Commission. The European Commission is not liable for any use that may be made of the information contained in this work. It is also supported by the Ministry of Science and Technology of Spain and the European Union (FEDER funds) under contract TIN2007-60625, by the Generalitat de Catalunya under contract 2009-SGR-980., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

DaSH: a benchmark suite for hybrid dataflow and shared memory programming models

  • Gajinov, Vladimir
  • Stipic, Srdjan
  • Eric, Igor
  • Unsal, Osman Sabri
  • Ayguadé Parra, Eduard
  • Cristal Kestelman, Adrián
The current trend in development of parallel programming models is to combine different well established models into a single programming, model in order to support efficient implementation of a wide range of real world applications. The dataflow model has particularly managed to recapture the interest of the research community due to its ability to express parallelism efficiently. Thus, a number of recently proposed hybrid parallel programming models combine dataflow and traditional shared memory models. Their findings have influenced the introduction of task dependency in the OpenMP 4.0 standard.; This article presents DaSH - the first comprehensive benchmark suite for hybrid dataflow and shared memory programming models. DaSH features 11 benchmarks, each representing one of the Berkeley dwarfs that capture patterns of communication and computation common to a wide range of emerging applications. DaSH also includes sequential and shared-memory implementations based on OpenMP and Intel TBB to facilitate easy comparison between hybrid dataflow implementations and traditional shared memory implementations based on work-sharing and/or tasks. Finally, we use DaSH to evaluate three different hybrid dataflow models, identify their advantages and shortcomings, and motivate further research on their characteristics., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Dynamic CPU provisioning for self-managed secure web applications in SMP hosting platforms

  • Guitart Fernández, Jordi
  • Carrera Pérez, David
  • Beltran Querol, Vicenç
  • Torres Viñals, Jordi
  • Ayguadé Parra, Eduard
Overload control mechanisms such as admission control and connection differentiation have proven effective for preventing overload of application servers running secure web applications. However, achieving optimal results in overload prevention is only possible when some kind of resource management is considered in addition to these mechanisms. In this paper we propose an overload control strategy for secure web applications that brings together dynamic provisioning of platform resources and admission control based on secure socket layer (SSL) connection differentiation. Dynamic provisioning enables additional resources to be allocated to an application on demand to handle workload increases, while the admission control mechanism avoids the server’s performance degradation by dynamically limiting the number of new SSL connections accepted and preferentially serving resumed SSL connections (to maximize performance on session-based environments) while additional resources are being provisioned. Our evaluation demonstrates the benefit of our proposal for efficiently managing the resources and preventing server overload on a 4-way multiprocessor Linux hosting platform, especially when the hosting platform is fully overloaded., This work is supported by the Ministry of Science and Technology of Spain and the European Union (FEDER funds) under Contracts TIN2004-07739-C02-01 and TIN2007-60625 and by the BSC (Barcelona Supercomputing Center)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Hints to improve automatic load balancing with LeWI for hybrid applications

  • Garcia Gasulla, Marta
  • Labarta Mancho, Jesús José
  • Corbalán González, Julita
The DLB (Dynamic Load Balancing) library and LeWl (LEnd When Idle) algorithm provide a runtime solution to deal with the load imbalance of parallel applications independently of the source of imbalance. DLB relies on the usage of hybrid programming models and exploits the malleability of the second level of parallelism to redistribute computation power across processes.; When executing real applications with LeWl, although application's performance is significantly improved, we have observed in some cases efficiency values between 60% and 70%, far from our theoretical limit.; This work is a deep analysis of the sources of efficiency loss correlated with application characteristics, parallelization schemes and programming models. We have based our analysis in fine grain monitoring tools and metrics and validated our conclusions by reproducing them in synthetic experiments. As a result, this work teaches us some lessons that can be seen as hints to programmers to help LeWI make an efficient use of computational resources and obtain the maximum performance. (C) 2014 Elsevier Inc. All rights reserved., We thankfully acknowledge the support of the Spanish Ministry of Education (TIN2007-60625, and CSD2007-00050) and the Generalitat de Catalunya (2009-SGR-980)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Thread assignment of multithreaded network applications in multicore/multithreaded processors

  • Radojković, Petar
  • Cakarevic, Vladimir
  • Verdú Mulà, Javier
  • Pajuelo González, Manuel Alejandro
  • Cazorla Almeida, Francisco Javier
  • Nemirovsky, Mario
  • Valero Cortés, Mateo
© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The introduction of multithreaded processors comprised of a large number of cores with many shared resources makes thread scheduling, and in particular optimal assignment of running threads to processor hardware contexts to become one of the most promising ways to improve the system performance. However, finding optimal thread assignments for workloads running in state-of-the-art multicore/multithreaded processors is an NP-complete problem. In this paper, we propose BlackBox scheduler, a systematic method for thread assignment of multithreaded network applications running on multicore/multithreaded processors. The method requires minimum information about the target processor architecture and no data about the hardware requirements of the applications under study. The proposed method is evaluated with an industrial case study for a set of multithreaded network applications running on the UltraSPARC T2 processor. In most of the experiments, the proposed thread assignment method detected the best actual thread assignment in the evaluation sample. The method improved the system performance from 5 to 48 percent with respect to load balancing algorithms used in state-of-the-art OSs, and up to 60 percent with respect to a naive thread assignment., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Leveraging task-parallelism in message-passing dense matrix factorizations using SMPSs

  • Martín Huertas, Alberto Francisco
  • Reyes, Ruyman
  • Badia Sala, Rosa Maria
  • Quintana Ortí, Enrique Salvador
In this paper, we investigate how to exploit task-parallelism during the execution of the Cholesky factorization on clusters of multicore processors with the SMPSs programming model. Our analysis reveals that the major difficulties in adapting the code for this operation in ScaLAPACK to SMPSs lie in algorithmic restrictions and the semantics of the SMPSs programming model, but also that they both can be overcome with a limited programming effort. The experimental results report considerable gains in performance and scalability of the routine parallelized with SMPSs when compared with conventional approaches to execute the original ScaLAPACK implementation in parallel as well as two recent message-passing routines for this operation. In summary, our study opens the door to the possibility of reusing message-passing legacy codes/libraries for linear algebra, by introducing up-to-date techniques like dynamic out-of-order scheduling that significantly upgrade their performance, while avoiding a costly rewrite/reimplementation., This research was supported by Project EU INFRA-2010-1.2.2 \TEXT:Towards EXa op applicaTions". The researcher at BSC-CNS was supported by the HiPEAC-2 Network of Excellence (FP7/ICT 217068), the Spanish Ministry of Education (CICYT TIN2011-23283, TIN2007-60625 and CSD2007- 00050), and the Generalitat de Catalunya (2009-SGR-980). The researcher at CIMNE was partially funded by the UPC postdoctoral grants under the programme \BKC5-Atracció i Fidelització de talent al BKC". The researcher at UJI was supported by project CICYT TIN2008-06570-C04-01 and FEDER. We thank Jesus Labarta, from BSC-CNS, for helpful discussions on SMPSs and his help with the performance analysis of the codes with Paraver. We thank Vladimir Marjanovic, also from BSC-CNS, for his help in the set-up and tuning of the MPI/SMPSs tools on JuRoPa. Finally, we thank Rafael Mayo, from UJI, for his support in the preliminary stages of this work. The authors gratefully acknowledge the computing time granted on the supercomputer JuRoPa at Jülich Supercomputing Centrer., Peer Reviewed, Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Business-driven management of infrastructure-level risks in Cloud providers

  • Fitó Comellas, Josep Oriol
  • Guitart Fernández, Jordi
Cloud computing is an innovative and promising paradigm that is leading to remarkable changes in the way in which hardware and software are designed and purchased, as well as how IT systems are managed. However, the Cloud is a risky paradigm. For instance, the use of Cloud services, which usually are external assets to their consumers, implies unprecedented risks that must be taken into account.; In this paper, we propose the involvement of the risk management discipline into the Cloud computing realm. We present a risk management approach led by business-level objectives (BLOs) of Cloud organizations. Its main goal is to assist in business-driven self-managed Cloud providers, by facing uncertainties always present in their internal decision-making processes. Our Cloud-aware risk management method includes a SEmi-quantitative BLO-driven Cloud Risk Assessment (SEBCRA) as the core subprocess. Its aim is to constantly rank and prioritize risks affecting the governing business-level goals.; In addition, we present, as a use case, a PaaS provider that incorporates our risk management approach to enhance the achievement of two BLOs, i.e. maximization of profit and customer satisfaction. In particular, it can manage - identify, assess, and treat - the most critical Cloud infrastructure-level risks, i.e. provisioning its private Cloud, either under- or over-provisioning, as well as resource failures. We present some risk treatment responses to face these risks and we evaluate their impact on the above-mentioned BLOs. Our results show that the best responses to address risks may change over time depending on the current provider's status. As a result, an adaptive management of risks should be considered as a mandatory process for Cloud providers to ensure their success in the ever-growing worldwide ecosystem of Clouds. (C) 2012 Elsevier B.V. All rights reserved., This work is supported by the Ministry of Science and Technology of Spain and the European Union (FEDER funds) under contract TIN2007-60625, by the Generalitat de Catalunya under contract 2009-SGR-980, and by the European Commission under FP7-ICT-2009-5 contract 257115 (OPTIMIS)., Peer Reviewed, Postprint (author's final draft)