Renato Figueiredo | Instituto Politecnico do Porto (original) (raw)
Papers by Renato Figueiredo
2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
Page 1. 978-1-4244-1694-3/08/$25.00 ©2008 IEEE Provisioning of Virtual Environments for Wide Area... more Page 1. 978-1-4244-1694-3/08/$25.00 ©2008 IEEE Provisioning of Virtual Environments for Wide Area Desktop Grids through Redirect-on-write Distributed File System Vineet Chadha, David Wolinsky, Renato J. Figueiredo ...
Lecture Notes in Computer Science, 2001
ABSTRACT
Lecture Notes in Computer Science, 2007
We propose a virtualization approach to implement redirect-on-write capabilities that overlay a t... more We propose a virtualization approach to implement redirect-on-write capabilities that overlay a traditional distributed file system. The redirect-onwrite distributed file system (ROW-FS) is implemented via a user-level proxy that is able to selectively steer Network File System (NFS) RPC calls to one of two servers: a "main" read-only server, and a "shadow" read-write server. By employing virtualization by means of a user-level proxy and using the de-facto standard NFS protocol, ROW-FS can be mounted as an NFS file system by existing, unmodified clients from a variety of platforms, and requires no changes to existing kernels. Its primary application is in supporting wide-area computing environments, where ROW-FS can provide improved performance and fault-tolerance (file system modifications can be check-pointed along with application state). Results show that benchmark applications including Linux kernel compilation and instantiation of virtual machines across wide-area networks achieve substantially better performance with ROW-FS as compared to NFS.
Fourth International Conference on Autonomic Computing (ICAC'07), 2007
Profiling the execution phases of an application can lead to optimizing the utilization of the un... more Profiling the execution phases of an application can lead to optimizing the utilization of the underlying resources. This is the thrust of this paper, which presents a novel system-level application resource demand phase analysis and prediction prototype to support on-demand resource provisioning. The phase profile learned from historical runs is used to classify and predict phase behavior using a set of algorithms based on clustering. The process takes into consideration application's resource consumption patterns, pricing schedules defined by the resource provider, and penalties associated with Service-Level Agreement (SLA) violations.
2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST), 2013
ABSTRACT Due to the popularity and importance of Parallel File Systems (PFSs) in modern High Perf... more ABSTRACT Due to the popularity and importance of Parallel File Systems (PFSs) in modern High Performance Computing (HPC) centers, PFS designs and I/O optimizations are active research topics. However, the research process is often time-consuming and faces cost and complexity challenges in deploying experiments in real HPC systems. This paper describes PFSsim, a trace-driven simulator of distributed storage systems that allows the evaluation of PFS designs, I/O schedulers, network structures, and workloads. PFSsim differentiates itself from related work in that it provides a powerful platform featuring a modular design with high flexibility in the modeling of subsystems including the network, clients, data servers and I/O schedulers. It does so by designing the simulator to capture abstractions found in common PFSs. PFSsim also exposes script-based interfaces for detailed configurations. Experiments and validation against real systems considering sub-modules and the entire simulator show that PFSsim is capable of simulating a representative PFS (PVFS2) and of modeling different I/O scheduler algorithms with good fidelity. In addition, the simulation speed is also shown to be acceptable.
2007 IEEE International Conference on Cluster Computing, 2007
Page 1. System-Level Performance Phase Characterization for On-Demand Resource Provisioning Jian ... more Page 1. System-Level Performance Phase Characterization for On-Demand Resource Provisioning Jian Zhang ∗1, Jaeseok Kim ∗2, Mazin Yousif †3, Robert Carpenter ‡4, and Renato J. Figueiredo ∗5 ∗Electrical & Computer ...
Proceedings of the 3rd international workshop on Virtualization technology in distributed computing - VTDC '07, 2007
Virtual Machines are becoming increasingly valuable to resource consolidation and management, pro... more Virtual Machines are becoming increasingly valuable to resource consolidation and management, providing efficient and secure resource containers, along with desired application execution environments. This paper focuses on the VM-based resource reservation problem, that is, the reservations of CPU, memory and network resources for individual VM instances, as well as for VM clusters. In particular, it considers the scenario where one or several physical servers need to be vacated to start a cluster of VMs for dedicated execution of parallel jobs. VMs provide a primitive for transparently vacating workloads through migration; however, the process of migrating several VMs can be timeconsuming and needs to be estimated. To achieve this goal, this paper seeks to provide a model that can characterize the VM migration process and predict its performance, based on a comprehensive experimental analysis. The results show that, given a certain VM's migration time, it is feasible to predict the time for a VM with other configurations, as well as the time for migrating a number of VMs. The paper also shows that migration of VMs in parallel results in shorter aggregate migration times, but with higher per-VM migration latencies. Experimental results also quantify the benefits of buffering the state of migrated VMs in main memory without committing to hard disks.
2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2010
Page 1. A Simulation Framework for the Analysis of TLB Behavior in Virtualized Environments Giris... more Page 1. A Simulation Framework for the Analysis of TLB Behavior in Virtualized Environments Girish Venkatasubramanian Renato J. Figueiredo Advanced Computing and Information Systems Laboratory University of Florida ...
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing - HPDC '10, 2010
Voluntary Computing systems or Desktop Grids (DGs) enable sharing of commodity computing resource... more Voluntary Computing systems or Desktop Grids (DGs) enable sharing of commodity computing resources across the globe and have gained tremendous popularity among scientific research communities. Data management is one of the major challenges of adopting the Voluntary Computing paradigm for large data-intensive applications. To date, middleware for supporting such applications either lacks an efficient cooperative data distribution scheme or cannot easily accommodate existing data-intensive applications due to the requirement for using middleware-specific APIs.
Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing - VTDC '09, 2009
The rising popularity of grid computing makes the issues of growth, security, and access critical... more The rising popularity of grid computing makes the issues of growth, security, and access critical in deploying and maintaining well-functioning grid systems. Overlay networks (ON) provide a framework to deal with these issues, but current techniques impose limitations and administrative burdens such as manual configuration for each new system in the grid, installation and configuration of software. Additionally, current approaches lack methods of effectively merging clusters with individual workstations, usually focusing on either the grouping of distributed clusters or a desktop/workstation Grid. The main difference between the two scenarios is that in a cluster environment all machines share a common ON router, whereas in a workstation environment each machine has ON software.
Estuarine and Coastal Modeling (2005), 2006
Simulation of Storm Surge Using Grid Computing. [ASCE Conference Proceedings 209, 21 (2005)]. Jus... more Simulation of Storm Surge Using Grid Computing. [ASCE Conference Proceedings 209, 21 (2005)]. Justin R. Davis, Vladimir A. Paramygin, Arijit Ganguly, Renato J. Figueiredo, Y. Peter Sheng M.ASCE. Abstract. Grid computing ...
2007 IEEE International Parallel and Distributed Processing Symposium, 2007
Wide-Area Overlays of Virtual Workstations (WOWs) have been shown to provide excellent infrastruc... more Wide-Area Overlays of Virtual Workstations (WOWs) have been shown to provide excellent infrastructure for deploying high throughput computing environments on commodity desktop machines by (1) offering scalability to a large number of nodes, (2) facilitating addition of new nodes even if they are behind NATs/Firewalls and (3) supporting unmodified applications and middleware. However, deployment of WOWs from scratch still requires setting up a bootstrapping network and managing centralized DHCP servers for IP address management. In this paper we describe novel techniques that allow multiple users to create independent, isolated virtual IP namespaces for their WOWs without requiring a dedicated bootstrapping infrastructure, and to provision dynamic host configuration (e.g. IP addresses) to unmodified DHCP clients without requiring the setup and management of a central DHCP server. We give qualitative and quantitative arguments to establish the feasibility of our approach. 1
Proceedings of the 17th international symposium on High performance distributed computing - HPDC '08, 2008
Abstract Deploying virtual organizations (VOs) is difficult for small-and medium-scale collaborat... more Abstract Deploying virtual organizations (VOs) is difficult for small-and medium-scale collaborations: the overheads in establishing and managing trust, and in deploying and managing computational resources distributed across multiple organizations are daunting to many potential users, presenting a barrier to entry that significantly hinders wider deployment of VOs. We advocate an approach where social networking and self-configuring overlay virtual networks are integrated in a novel way that allows simple deployment and ...
Proceedings of the 17th international symposium on High performance distributed computing - HPDC '08, 2008
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity... more Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized hole-punching to establish bi-directional communication links among nodes behind network address translators, and dynamic configuration of virtual IP addresses. Our experiences with deployments of virtual networks in support of wide-area overlays of virtual workstations (WOWs) reveal that connectivity constraints imposed by symmetric NATs and by Internet route outages often hinder P2P overlay structure maintenance and routability, subsequently limiting the ability of WOWs to deliver high-throughput computing through aggregation of resources in different domains.
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010
Connectivity constraints due to Internet route outages and symmetric NATs create situations when ... more Connectivity constraints due to Internet route outages and symmetric NATs create situations when direct communication is not possible between nodes in P2P deployments, often leading to high latency between high-traffic nodes. In such cases, it is possible to reduce end-to-end latency by routing their communication through another node in the P2P system that is selected based on its Internet latencies
2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing, 2011
Microblogging has become an important part of the social web evolution and is being utilized in m... more Microblogging has become an important part of the social web evolution and is being utilized in many aspects such as advertising, political campaigns, and popular uprisings. Due to its heavy centralization, many have proposed decentralized alternatives based on a variety of models. This paper suggests a fully distributed approach built on top of existing peer-topeer technologies. We demonstrate that, by exploiting the services of current peer-to-peer middleware along with the properties of the social graph, it is possible to create a simple, yet practical microblogging service that is impervious to many of the shortcomings of their centralized counterparts. The approach has been implemented as a software prototype that is readily available for download in order to test our design in real life environments.
2008 Grid Computing Environments Workshop, 2008
Social networking sites have enhanced the Web by providing online "communities" where users can e... more Social networking sites have enhanced the Web by providing online "communities" where users can easily create identities, establish relationships between identities, and share resources with one another across the Web. The availability of social networking APIs, such as OpenSocial or the Facebook platform, make it possible for third-party developers to tap into these social relationships and design socially-aware applications. In this paper, we describe how social networking groups can be used to help create virtual private computing clusters that consist of nodes spanning different administrative domains and organizations. To demonstrate the feasibility and usage of our approach, we developed a fully functional prototype implementation and present the quantitative results of our virtual private network. Our design integrates virtual machines, peer-to-peer virtual private networks, and the Facebook Platform API, to enable a user community in which we can easily deploy ad-hoc Condor resource pools that are managed through the Web-based Facebook group interface.
International Conference on Autonomic Computing, 2007
Profiling the execution phases of an application can lead to optimizing the utilization of the un... more Profiling the execution phases of an application can lead to optimizing the utilization of the underlying resources. This is the thrust of this paper, which presents a novel system-level application resource demand phase analysis and prediction prototype to support on-demand resource provisioning. The phase profile learned from historical runs is used to classify and predict phase behavior using a set of algorithms based on clustering. The process takes into consideration application's resource consumption patterns, pricing schedules defined by the resource provider, and penalties associated with service-level agreement (SLA) violations.
International Conference on Autonomic Computing, 2006
Page 1. 59 Autonomic Feature Selection for Application Classification Jian Zhang and Renato J. Fi... more Page 1. 59 Autonomic Feature Selection for Application Classification Jian Zhang and Renato J. Figueiredo Advanced Computing and Information Systems (ACIS) Laboratory Department of Electrical and Computer Engineering ...
Cluster Computing, 2006
This paper presents a data management solution which allows fast Virtual Machine (VM) instantiati... more This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: (1) it provides on-demand cross-domain access to VM state for unmodified VM monitors; (2) it enables private file system channels for VM instantiation by secure tunneling and session-key based authentication; (3) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and (4) it leverages application-specific meta-data associated with files to expedite data transfers. The paper reports on its performance in wide-area setups using VMware-based VMs. Results show that the solution delivers performance over 30% better than native NFS and with warm caches it can bring the application-perceived overheads below 10% compared to a local-disk setup. The solution also allows a VM with 1.6 GB virtual disk and 320 MB virtual memory to be cloned within 160 seconds for the first clone and within 25 seconds for subsequent clones.
2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
Page 1. 978-1-4244-1694-3/08/$25.00 ©2008 IEEE Provisioning of Virtual Environments for Wide Area... more Page 1. 978-1-4244-1694-3/08/$25.00 ©2008 IEEE Provisioning of Virtual Environments for Wide Area Desktop Grids through Redirect-on-write Distributed File System Vineet Chadha, David Wolinsky, Renato J. Figueiredo ...
Lecture Notes in Computer Science, 2001
ABSTRACT
Lecture Notes in Computer Science, 2007
We propose a virtualization approach to implement redirect-on-write capabilities that overlay a t... more We propose a virtualization approach to implement redirect-on-write capabilities that overlay a traditional distributed file system. The redirect-onwrite distributed file system (ROW-FS) is implemented via a user-level proxy that is able to selectively steer Network File System (NFS) RPC calls to one of two servers: a "main" read-only server, and a "shadow" read-write server. By employing virtualization by means of a user-level proxy and using the de-facto standard NFS protocol, ROW-FS can be mounted as an NFS file system by existing, unmodified clients from a variety of platforms, and requires no changes to existing kernels. Its primary application is in supporting wide-area computing environments, where ROW-FS can provide improved performance and fault-tolerance (file system modifications can be check-pointed along with application state). Results show that benchmark applications including Linux kernel compilation and instantiation of virtual machines across wide-area networks achieve substantially better performance with ROW-FS as compared to NFS.
Fourth International Conference on Autonomic Computing (ICAC'07), 2007
Profiling the execution phases of an application can lead to optimizing the utilization of the un... more Profiling the execution phases of an application can lead to optimizing the utilization of the underlying resources. This is the thrust of this paper, which presents a novel system-level application resource demand phase analysis and prediction prototype to support on-demand resource provisioning. The phase profile learned from historical runs is used to classify and predict phase behavior using a set of algorithms based on clustering. The process takes into consideration application's resource consumption patterns, pricing schedules defined by the resource provider, and penalties associated with Service-Level Agreement (SLA) violations.
2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST), 2013
ABSTRACT Due to the popularity and importance of Parallel File Systems (PFSs) in modern High Perf... more ABSTRACT Due to the popularity and importance of Parallel File Systems (PFSs) in modern High Performance Computing (HPC) centers, PFS designs and I/O optimizations are active research topics. However, the research process is often time-consuming and faces cost and complexity challenges in deploying experiments in real HPC systems. This paper describes PFSsim, a trace-driven simulator of distributed storage systems that allows the evaluation of PFS designs, I/O schedulers, network structures, and workloads. PFSsim differentiates itself from related work in that it provides a powerful platform featuring a modular design with high flexibility in the modeling of subsystems including the network, clients, data servers and I/O schedulers. It does so by designing the simulator to capture abstractions found in common PFSs. PFSsim also exposes script-based interfaces for detailed configurations. Experiments and validation against real systems considering sub-modules and the entire simulator show that PFSsim is capable of simulating a representative PFS (PVFS2) and of modeling different I/O scheduler algorithms with good fidelity. In addition, the simulation speed is also shown to be acceptable.
2007 IEEE International Conference on Cluster Computing, 2007
Page 1. System-Level Performance Phase Characterization for On-Demand Resource Provisioning Jian ... more Page 1. System-Level Performance Phase Characterization for On-Demand Resource Provisioning Jian Zhang ∗1, Jaeseok Kim ∗2, Mazin Yousif †3, Robert Carpenter ‡4, and Renato J. Figueiredo ∗5 ∗Electrical & Computer ...
Proceedings of the 3rd international workshop on Virtualization technology in distributed computing - VTDC '07, 2007
Virtual Machines are becoming increasingly valuable to resource consolidation and management, pro... more Virtual Machines are becoming increasingly valuable to resource consolidation and management, providing efficient and secure resource containers, along with desired application execution environments. This paper focuses on the VM-based resource reservation problem, that is, the reservations of CPU, memory and network resources for individual VM instances, as well as for VM clusters. In particular, it considers the scenario where one or several physical servers need to be vacated to start a cluster of VMs for dedicated execution of parallel jobs. VMs provide a primitive for transparently vacating workloads through migration; however, the process of migrating several VMs can be timeconsuming and needs to be estimated. To achieve this goal, this paper seeks to provide a model that can characterize the VM migration process and predict its performance, based on a comprehensive experimental analysis. The results show that, given a certain VM's migration time, it is feasible to predict the time for a VM with other configurations, as well as the time for migrating a number of VMs. The paper also shows that migration of VMs in parallel results in shorter aggregate migration times, but with higher per-VM migration latencies. Experimental results also quantify the benefits of buffering the state of migrated VMs in main memory without committing to hard disks.
2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2010
Page 1. A Simulation Framework for the Analysis of TLB Behavior in Virtualized Environments Giris... more Page 1. A Simulation Framework for the Analysis of TLB Behavior in Virtualized Environments Girish Venkatasubramanian Renato J. Figueiredo Advanced Computing and Information Systems Laboratory University of Florida ...
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing - HPDC '10, 2010
Voluntary Computing systems or Desktop Grids (DGs) enable sharing of commodity computing resource... more Voluntary Computing systems or Desktop Grids (DGs) enable sharing of commodity computing resources across the globe and have gained tremendous popularity among scientific research communities. Data management is one of the major challenges of adopting the Voluntary Computing paradigm for large data-intensive applications. To date, middleware for supporting such applications either lacks an efficient cooperative data distribution scheme or cannot easily accommodate existing data-intensive applications due to the requirement for using middleware-specific APIs.
Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing - VTDC '09, 2009
The rising popularity of grid computing makes the issues of growth, security, and access critical... more The rising popularity of grid computing makes the issues of growth, security, and access critical in deploying and maintaining well-functioning grid systems. Overlay networks (ON) provide a framework to deal with these issues, but current techniques impose limitations and administrative burdens such as manual configuration for each new system in the grid, installation and configuration of software. Additionally, current approaches lack methods of effectively merging clusters with individual workstations, usually focusing on either the grouping of distributed clusters or a desktop/workstation Grid. The main difference between the two scenarios is that in a cluster environment all machines share a common ON router, whereas in a workstation environment each machine has ON software.
Estuarine and Coastal Modeling (2005), 2006
Simulation of Storm Surge Using Grid Computing. [ASCE Conference Proceedings 209, 21 (2005)]. Jus... more Simulation of Storm Surge Using Grid Computing. [ASCE Conference Proceedings 209, 21 (2005)]. Justin R. Davis, Vladimir A. Paramygin, Arijit Ganguly, Renato J. Figueiredo, Y. Peter Sheng M.ASCE. Abstract. Grid computing ...
2007 IEEE International Parallel and Distributed Processing Symposium, 2007
Wide-Area Overlays of Virtual Workstations (WOWs) have been shown to provide excellent infrastruc... more Wide-Area Overlays of Virtual Workstations (WOWs) have been shown to provide excellent infrastructure for deploying high throughput computing environments on commodity desktop machines by (1) offering scalability to a large number of nodes, (2) facilitating addition of new nodes even if they are behind NATs/Firewalls and (3) supporting unmodified applications and middleware. However, deployment of WOWs from scratch still requires setting up a bootstrapping network and managing centralized DHCP servers for IP address management. In this paper we describe novel techniques that allow multiple users to create independent, isolated virtual IP namespaces for their WOWs without requiring a dedicated bootstrapping infrastructure, and to provision dynamic host configuration (e.g. IP addresses) to unmodified DHCP clients without requiring the setup and management of a central DHCP server. We give qualitative and quantitative arguments to establish the feasibility of our approach. 1
Proceedings of the 17th international symposium on High performance distributed computing - HPDC '08, 2008
Abstract Deploying virtual organizations (VOs) is difficult for small-and medium-scale collaborat... more Abstract Deploying virtual organizations (VOs) is difficult for small-and medium-scale collaborations: the overheads in establishing and managing trust, and in deploying and managing computational resources distributed across multiple organizations are daunting to many potential users, presenting a barrier to entry that significantly hinders wider deployment of VOs. We advocate an approach where social networking and self-configuring overlay virtual networks are integrated in a novel way that allows simple deployment and ...
Proceedings of the 17th international symposium on High performance distributed computing - HPDC '08, 2008
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity... more Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized hole-punching to establish bi-directional communication links among nodes behind network address translators, and dynamic configuration of virtual IP addresses. Our experiences with deployments of virtual networks in support of wide-area overlays of virtual workstations (WOWs) reveal that connectivity constraints imposed by symmetric NATs and by Internet route outages often hinder P2P overlay structure maintenance and routability, subsequently limiting the ability of WOWs to deliver high-throughput computing through aggregation of resources in different domains.
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010
Connectivity constraints due to Internet route outages and symmetric NATs create situations when ... more Connectivity constraints due to Internet route outages and symmetric NATs create situations when direct communication is not possible between nodes in P2P deployments, often leading to high latency between high-traffic nodes. In such cases, it is possible to reduce end-to-end latency by routing their communication through another node in the P2P system that is selected based on its Internet latencies
2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing, 2011
Microblogging has become an important part of the social web evolution and is being utilized in m... more Microblogging has become an important part of the social web evolution and is being utilized in many aspects such as advertising, political campaigns, and popular uprisings. Due to its heavy centralization, many have proposed decentralized alternatives based on a variety of models. This paper suggests a fully distributed approach built on top of existing peer-topeer technologies. We demonstrate that, by exploiting the services of current peer-to-peer middleware along with the properties of the social graph, it is possible to create a simple, yet practical microblogging service that is impervious to many of the shortcomings of their centralized counterparts. The approach has been implemented as a software prototype that is readily available for download in order to test our design in real life environments.
2008 Grid Computing Environments Workshop, 2008
Social networking sites have enhanced the Web by providing online "communities" where users can e... more Social networking sites have enhanced the Web by providing online "communities" where users can easily create identities, establish relationships between identities, and share resources with one another across the Web. The availability of social networking APIs, such as OpenSocial or the Facebook platform, make it possible for third-party developers to tap into these social relationships and design socially-aware applications. In this paper, we describe how social networking groups can be used to help create virtual private computing clusters that consist of nodes spanning different administrative domains and organizations. To demonstrate the feasibility and usage of our approach, we developed a fully functional prototype implementation and present the quantitative results of our virtual private network. Our design integrates virtual machines, peer-to-peer virtual private networks, and the Facebook Platform API, to enable a user community in which we can easily deploy ad-hoc Condor resource pools that are managed through the Web-based Facebook group interface.
International Conference on Autonomic Computing, 2007
Profiling the execution phases of an application can lead to optimizing the utilization of the un... more Profiling the execution phases of an application can lead to optimizing the utilization of the underlying resources. This is the thrust of this paper, which presents a novel system-level application resource demand phase analysis and prediction prototype to support on-demand resource provisioning. The phase profile learned from historical runs is used to classify and predict phase behavior using a set of algorithms based on clustering. The process takes into consideration application's resource consumption patterns, pricing schedules defined by the resource provider, and penalties associated with service-level agreement (SLA) violations.
International Conference on Autonomic Computing, 2006
Page 1. 59 Autonomic Feature Selection for Application Classification Jian Zhang and Renato J. Fi... more Page 1. 59 Autonomic Feature Selection for Application Classification Jian Zhang and Renato J. Figueiredo Advanced Computing and Information Systems (ACIS) Laboratory Department of Electrical and Computer Engineering ...
Cluster Computing, 2006
This paper presents a data management solution which allows fast Virtual Machine (VM) instantiati... more This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: (1) it provides on-demand cross-domain access to VM state for unmodified VM monitors; (2) it enables private file system channels for VM instantiation by secure tunneling and session-key based authentication; (3) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and (4) it leverages application-specific meta-data associated with files to expedite data transfers. The paper reports on its performance in wide-area setups using VMware-based VMs. Results show that the solution delivers performance over 30% better than native NFS and with warm caches it can bring the application-perceived overheads below 10% compared to a local-disk setup. The solution also allows a VM with 1.6 GB virtual disk and 320 MB virtual memory to be cloned within 160 seconds for the first clone and within 25 seconds for subsequent clones.