The Experts below are selected from a list of 126 Experts worldwide ranked by ideXlab platform
Paulo Maciel - One of the best experts on this subject based on the ideXlab platform.
-
performability analysis of i o Bound Application on container based server virtualization cluster
International Symposium on Computers and Communications, 2014Co-Authors: Erico Guedes, Luis E T Silva, Paulo MacielAbstract:Use of server virtualization for providing Applications produces overloads that degrade the performance of provided systems. The use of container-based virtualization enabled a narrowing of this overload. On this work, we go a step forward and demonstrate how a broad tuning combination of several performance factors concerning to web cache server - the I/O Bound Application analysed - to file system and to operating system, led to a higher performance of proposed cluster, when it is executed on a container-based operating system virtualization environment. Availability and performance similarity of web cache service, under non-virtualized and virtualized systems, were evaluated when submitted to proposed web workload. Results reveal that web cache service provided under virtual environment, without unresponsiveness fails due to overload, i. e., with high availability, presents a 6% higher hit ratio and a 21.4% lower response time than those observed on non-virtualized environments.
-
ISCC - Performability analysis of I/O Bound Application on container-based server virtualization cluster
2014 IEEE Symposium on Computers and Communications (ISCC), 2014Co-Authors: Erico A. C. Guedes, Luis E T Silva, Paulo MacielAbstract:Use of server virtualization for providing Applications produces overloads that degrade the performance of provided systems. The use of container-based virtualization enabled a narrowing of this overload. On this work, we go a step forward and demonstrate how a broad tuning combination of several performance factors concerning to web cache server - the I/O Bound Application analysed - to file system and to operating system, led to a higher performance of proposed cluster, when it is executed on a container-based operating system virtualization environment. Availability and performance similarity of web cache service, under non-virtualized and virtualized systems, were evaluated when submitted to proposed web workload. Results reveal that web cache service provided under virtual environment, without unresponsiveness fails due to overload, i. e., with high availability, presents a 6% higher hit ratio and a 21.4% lower response time than those observed on non-virtualized environments.
Erico A. C. Guedes - One of the best experts on this subject based on the ideXlab platform.
-
ISCC - Performability analysis of I/O Bound Application on container-based server virtualization cluster
2014 IEEE Symposium on Computers and Communications (ISCC), 2014Co-Authors: Erico A. C. Guedes, Luis E T Silva, Paulo MacielAbstract:Use of server virtualization for providing Applications produces overloads that degrade the performance of provided systems. The use of container-based virtualization enabled a narrowing of this overload. On this work, we go a step forward and demonstrate how a broad tuning combination of several performance factors concerning to web cache server - the I/O Bound Application analysed - to file system and to operating system, led to a higher performance of proposed cluster, when it is executed on a container-based operating system virtualization environment. Availability and performance similarity of web cache service, under non-virtualized and virtualized systems, were evaluated when submitted to proposed web workload. Results reveal that web cache service provided under virtual environment, without unresponsiveness fails due to overload, i. e., with high availability, presents a 6% higher hit ratio and a 21.4% lower response time than those observed on non-virtualized environments.
Artur Alves Pessoa - One of the best experts on this subject based on the ideXlab platform.
-
Memory aware load balance strategy on a parallel branch-and-Bound Application
Concurrency and Computation: Practice and Experience, 2014Co-Authors: Juliana M. N. Silva, Cristina Boeres, Lúcia Maria De A. Drummond, Artur Alves PessoaAbstract:The latest trends in high performance computing systems show an increasing demand on the use of a large scale multicore system in an efficient way so that high compute-intensive Applications can be executed reasonably well. However, the exploitation of the degree of parallelism available at each multicore component can be limited by the poor utilization of the memory hierarchy. Actually, the multicore architecture introduces some distinct features that are already observed in shared memory and distributed environments. One example is that subsets of cores can share different subsets of memory. In order to achieve high performance, it is imperative that a careful allocation scheme of an Application is carried out on the available cores, based on a scheduling specification that considers not only processors characteristics but also memory contention. This paper proposes a multicore cluster representation that captures relevant performance characteristics in multicores systems such as the influence of memory hierarchy and contention on Application performance. Improved performance was achieved by a branch-and-Bound Application applied to the partitioning sets problem that incorporated a memory aware load balancing strategy based on the proposed multicore cluster representation. An in-depth analysis on this Application execution showed its applicability to modern systems. Copyright ©2014 John Wiley & Sons, Ltd.
-
Memory Aware Load Balance Strategy on a Parallel Branch-and-Bound Application
arXiv: Distributed Parallel and Cluster Computing, 2013Co-Authors: Juliana M. N. Silva, Cristina Boeres, Lúcia Maria De A. Drummond, Artur Alves PessoaAbstract:The latest trends in high-performance computing systems show an increasing demand on the use of a large scale multicore systems in a efficient way, so that high compute-intensive Applications can be executed reasonably well. However, the exploitation of the degree of parallelism available at each multicore component can be limited by the poor utilization of the memory hierarchy available. Actually, the multicore architecture introduces some distinct features that are already observed in shared memory and distributed environments. One example is that subsets of cores can share different subsets of memory. In order to achieve high performance it is imperative that a careful allocation scheme of an Application is carried out on the available cores, based on a scheduling model that considers the main performance bottlenecks, as for example, memory contention. In this paper, the {\em Multicore Cluster Model} (MCM) is proposed, which captures the most relevant performance characteristics in multicores systems such as the influence of memory hierarchy and contention. Better performance was achieved when a load balance strategy for a Branch-and-Bound Application applied to the Partitioning Sets Problem is based on MCM, showing its efficiency and applicability to modern systems.
Luis E T Silva - One of the best experts on this subject based on the ideXlab platform.
-
performability analysis of i o Bound Application on container based server virtualization cluster
International Symposium on Computers and Communications, 2014Co-Authors: Erico Guedes, Luis E T Silva, Paulo MacielAbstract:Use of server virtualization for providing Applications produces overloads that degrade the performance of provided systems. The use of container-based virtualization enabled a narrowing of this overload. On this work, we go a step forward and demonstrate how a broad tuning combination of several performance factors concerning to web cache server - the I/O Bound Application analysed - to file system and to operating system, led to a higher performance of proposed cluster, when it is executed on a container-based operating system virtualization environment. Availability and performance similarity of web cache service, under non-virtualized and virtualized systems, were evaluated when submitted to proposed web workload. Results reveal that web cache service provided under virtual environment, without unresponsiveness fails due to overload, i. e., with high availability, presents a 6% higher hit ratio and a 21.4% lower response time than those observed on non-virtualized environments.
-
ISCC - Performability analysis of I/O Bound Application on container-based server virtualization cluster
2014 IEEE Symposium on Computers and Communications (ISCC), 2014Co-Authors: Erico A. C. Guedes, Luis E T Silva, Paulo MacielAbstract:Use of server virtualization for providing Applications produces overloads that degrade the performance of provided systems. The use of container-based virtualization enabled a narrowing of this overload. On this work, we go a step forward and demonstrate how a broad tuning combination of several performance factors concerning to web cache server - the I/O Bound Application analysed - to file system and to operating system, led to a higher performance of proposed cluster, when it is executed on a container-based operating system virtualization environment. Availability and performance similarity of web cache service, under non-virtualized and virtualized systems, were evaluated when submitted to proposed web workload. Results reveal that web cache service provided under virtual environment, without unresponsiveness fails due to overload, i. e., with high availability, presents a 6% higher hit ratio and a 21.4% lower response time than those observed on non-virtualized environments.
Ken Rojas - One of the best experts on this subject based on the ideXlab platform.
-
GRID - Migration of Multi-tier Applications to Infrastructure-as-a-Service Clouds: An Investigation Using Kernel-Based Virtual Machines
2011 IEEE ACM 12th International Conference on Grid Computing, 2011Co-Authors: Wes Lloyd, Shrideep Pallickara, Olaf David, Jim Lyon, Mazdak Arabi, Ken RojasAbstract:To investigate challenges of multi-tier Application migration to Infrastructure-as-a-Service (IaaS) clouds we performed an experimental investigation by deploying a processor Bound and input-output Bound variant of the RUSLE2 erosion model to an IaaS based private cloud. Scaling the Applications to achieve optimal system throughput is complex and involves much more than simply increasing the number of allotted virtual machines (VMs). While scaling the Application variants a series of bottlenecks were encountered unique to an Application's processing, I/O, and memory requirements, herein referred to as an Application's profile. To investigate the impact of provisioning variation for hosting multi-tier Applications we tested four schemes of VM deployments across the physical nodes of our cloud. Performance degradation was more pronounced when multiple I/O or CPU resource intensive Application components were co-located on the same physical hardware. We investigated the virtualization overhead incurred using Kernel-based virtual machines (KVM) by deploying our Application variants to both physical and virtual machines. Overhead varied based on the unique characteristics of each Application's profile. We observed ~112% overhead for the input/output Bound Application and just ~ 10% overhead for the processor Bound Application. Understanding an Application's profile was found to be important for optimal IaaS-based cloud migration and scaling.