Renato J. Figueiredo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Renato J. Figueiredo has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Arijit Ganguly
University of Florida
5 shared publications - P. Oscar Boykin
University of Florida
4 shared publications - Abhishek Agrawal
University of Florida
2 shared publications - David I. Wolinsky
University of Florida
2 shared publications - Jian Zhang
University of Florida
2 shared publications - A. Mohindra
IBM T.J. Watson Research Center, P.O Box 704, Yorktown Heights, NY 10598 USA
1 shared publication
Latest Publications
- Open Access
GRAPLEr: A Distributed Collaborative Environment for Lake Ecosystem Modeling that Integrates Overlay Networks, High-throughput Computing, and Web Services
The GLEON Research And PRAGMA Lake Expedition -- GRAPLE -- is a collaborative effort between computer science and lake ecology researchers. It aims to improve our understanding and predictive capacity of the threats to the water quality of our freshwater resources, including climate change. This paper presents GRAPLEr, a distributed computing system used to address the modeling needs of GRAPLE researchers. GRAPLEr integrates and applies overlay virtual network, high-throughput computing, and Web service technologies in a novel way. First, its user-level IP-over-P2P (IPOP) overlay network allows compute and storage resources distributed across independently-administered institutions (including private and public clouds) to be aggregated into a common virtual network, despite the presence of firewalls and network address translators. Second, resources aggregated by the IPOP virtual network run unmodified high-throughput computing middleware (HTCondor) to enable large numbers of model simulations to be executed concurrently across the distributed computing resources. Third, a Web service interface allows end users to submit job requests to the system using client libraries that integrate with the R statistical computing environment. The paper presents the GRAPLEr architecture, describes its implementation and reports on its performance for batches of General Lake Model (GLM) simulations across three cloud infrastructures (University of Florida, CloudLab, and Microsoft Azure).
Open AccessGRAPLEr: A Distributed Collaborative Environment for Lake Ecosystem Modeling that Integrates Overlay Networks, High-throughput Computing, and Web Services
The GLEON Research And PRAGMA Lake Expedition -- GRAPLE -- is a collaborative effort between computer science and lake ecology researchers. It aims to improve our understanding and predictive capacity of the threats to the water quality of our freshwater resources, including climate change. This paper presents GRAPLEr, a distributed computing system used to address the modeling needs of GRAPLE researchers. GRAPLEr integrates and applies overlay virtual network, high-throughput computing, and Web service technologies in a novel way. First, its user-level IP-over-P2P (IPOP) overlay network allows compute and storage resources distributed across independently-administered institutions (including private and public clouds) to be aggregated into a common virtual network, despite the presence of firewalls and network address translators. Second, resources aggregated by the IPOP virtual network run unmodified high-throughput computing middleware (HTCondor) to enable large numbers of model simulations to be executed concurrently across the distributed computing resources. Third, a Web service interface allows end users to submit job requests to the system using client libraries that integrate with the R statistical computing environment. The paper presents the GRAPLEr architecture, describes its implementation and reports on its performance for batches of General Lake Model (GLM) simulations across three cloud infrastructures (University of Florida, CloudLab, and Microsoft Azure).
- 28 May 2015
- Published by Springer Nature in Cluster Computing
- Vol. 18 (3) , 1025-1039
The dispatch time aligning I/O scheduling for parallel file systems
- 28 May 2015
- Published by Springer Nature in Cluster Computing
- Vol. 18 (3) , 1025-1039
The dispatch time aligning I/O scheduling for parallel file systems
- Open Access
- 31 March 2014
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 2 (2) , 287-305
Strengthening the Resiliency of a Coastal Transportation System through Integrated Simulation of Storm Surge, Inundation, and Nonrecurrent Congestion in Northeast Florida
The Multimodal Transportation Educational Virtual Appliance (MTEVA) is an application developed within the framework of the broader Coastal Science Educational Virtual Appliance (CSEVA) to enhance coastal resiliency through the integration of coastal science and transportation congestion models for emergency situations. The first generation MTEVA enabled users to perform and visualize simulations using an integrated storm surge and inundation model (CH3D-SSMS) and transportation evacuation/return modeling system that supports contraflow in a simple synthetic domain (order of tens of intersections/roads) under tropical storm conditions. In this study, the second generation MTEVA has been advanced to apply storm surge and evacuation models to the greater Jacksonville area of Northeast Florida (order tens of thousands of transportation intersections/roads). To support solving the evacuation problem with a significantly larger transportation network, new models have been developed, including a heuristic capable of efficiently solving large-scale problems. After initial testing on several smaller stand-alone transportation networks (e.g., Anaheim, Winnipeg), the heuristic is applied to the Jacksonville area transportation network. Results presented show the heuristic produces a nearly optimal (average optimality gap <0.5%) solution in 90% less wall clock time than needed by the exact solver. The MTEVA’s new capabilities are then demonstrated through the simulation of a Hurricane Katrina-sized storm impacting the region and studying how the evacuation patterns are affected by the closing of roads due to flooding and bridges due to high winds. To ensure residents are able to leave the area, evacuations are shown to need to have begun at least 36 h prior to landfall. Additionally it was shown that large numbers of residents would be left behind if evacuation does not begin within 18 h of landfall and ~97% would not escape if evacuation did not begin until landfall, when areas of the coast that are the most prone to flooding are already cut off from the “safe” nodes of the transportation network.
- 31 March 2014
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 2 (2) , 287-305
Open AccessStrengthening the Resiliency of a Coastal Transportation System through Integrated Simulation of Storm Surge, Inundation, and Nonrecurrent Congestion in Northeast Florida
The Multimodal Transportation Educational Virtual Appliance (MTEVA) is an application developed within the framework of the broader Coastal Science Educational Virtual Appliance (CSEVA) to enhance coastal resiliency through the integration of coastal science and transportation congestion models for emergency situations. The first generation MTEVA enabled users to perform and visualize simulations using an integrated storm surge and inundation model (CH3D-SSMS) and transportation evacuation/return modeling system that supports contraflow in a simple synthetic domain (order of tens of intersections/roads) under tropical storm conditions. In this study, the second generation MTEVA has been advanced to apply storm surge and evacuation models to the greater Jacksonville area of Northeast Florida (order tens of thousands of transportation intersections/roads). To support solving the evacuation problem with a significantly larger transportation network, new models have been developed, including a heuristic capable of efficiently solving large-scale problems. After initial testing on several smaller stand-alone transportation networks (e.g., Anaheim, Winnipeg), the heuristic is applied to the Jacksonville area transportation network. Results presented show the heuristic produces a nearly optimal (average optimality gap <0.5%) solution in 90% less wall clock time than needed by the exact solver. The MTEVA’s new capabilities are then demonstrated through the simulation of a Hurricane Katrina-sized storm impacting the region and studying how the evacuation patterns are affected by the closing of roads due to flooding and bridges due to high winds. To ensure residents are able to leave the area, evacuations are shown to need to have begun at least 36 h prior to landfall. Additionally it was shown that large numbers of residents would be left behind if evacuation does not begin within 18 h of landfall and ~97% would not escape if evacuation did not begin until landfall, when areas of the coast that are the most prone to flooding are already cut off from the “safe” nodes of the transportation network.
- 14 October 2011
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 40 (3) , 353-380
TMT: A TLB Tag Management Framework for Virtualized Platforms
- 14 October 2011
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 40 (3) , 353-380
TMT: A TLB Tag Management Framework for Virtualized Platforms
- 17 January 2009
- Published by Springer Nature in Cluster Computing
- Vol. 12 (2) , 239-256
Improving peer connectivity in wide-area overlays of virtual workstations
- 17 January 2009
- Published by Springer Nature in Cluster Computing
- Vol. 12 (2) , 239-256
Improving peer connectivity in wide-area overlays of virtual workstations
- 1 November 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
On the Use of Social Networking Groups for Automatic Configuration of Virtual Grid Environments
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.
- 1 November 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
On the Use of Social Networking Groups for Automatic Configuration of Virtual Grid Environments
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.
- 2 October 2007
- Published by Springer Nature in Cluster Computing
- Vol. 10 (4) , 425-442
Learning-aided predictor integration for system performance prediction
- 2 October 2007
- Published by Springer Nature in Cluster Computing
- Vol. 10 (4) , 425-442
Learning-aided predictor integration for system performance prediction
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 729-732
Reducing Complexity of Software Deployment with Delta Configuration
Deploying a modern software service usually involves installing several software components, and configuring these components properly to realize the complex interdependencies between them. This process, which accounts for a significant portion of information technology (IT) cost, is complex and error-prone. In this paper, we propose delta configuration - an approach that reduces the cost of software deployment by eliminating a large number of choices on parameter values that administrators have to make during deployment. In delta configuration, the complex software stack of a distributed service is first installed and tested in a test environment. The resulting software images are then captured and used for deployment in production environments. To deploy a software service, we only need to copy these pre-configured software images into a production environment and modify them to account for the difference between the test environment and a production environment. We have implemented a prototype system that achieves software deployment using delta configuration of the configuration state captured inside virtual machines. We perform a case study to demonstrate that our scheme leads to substantial reduction in complexity for the customer, over the traditional software deployment method.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 729-732
Reducing Complexity of Software Deployment with Delta Configuration
Deploying a modern software service usually involves installing several software components, and configuring these components properly to realize the complex interdependencies between them. This process, which accounts for a significant portion of information technology (IT) cost, is complex and error-prone. In this paper, we propose delta configuration - an approach that reduces the cost of software deployment by eliminating a large number of choices on parameter values that administrators have to make during deployment. In delta configuration, the complex software stack of a distributed service is first installed and tested in a test environment. The resulting software images are then captured and used for deployment in production environments. To deploy a software service, we only need to copy these pre-configured software images into a production environment and modify them to account for the difference between the test environment and a production environment. We have implemented a prototype system that achieves software deployment using delta configuration of the configuration state captured inside virtual machines. We perform a case study to demonstrate that our scheme leads to substantial reduction in complexity for the customer, over the traditional software deployment method.
- 15 April 2007
- Published by Springer Nature in Journal of Grid Computing
- Vol. 5 (2) , 151-172
WOW: Self-organizing Wide Area Overlay Networks of Virtual Workstations
- 15 April 2007
- Published by Springer Nature in Journal of Grid Computing
- Vol. 5 (2) , 151-172
WOW: Self-organizing Wide Area Overlay Networks of Virtual Workstations
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-10
Adaptive Predictor Integration for System Performance Prediction
The integration of multiple predictors promises higher prediction accuracy than the accuracy that can be obtained with a single predictor. The challenge is how to select the best predictor at any given moment. Traditionally, multiple predictors are run in parallel and the one that generates the best result is selected for prediction. In this paper, we propose a novel approach for predictor integration based on the learning of historical predictions. It uses classification algorithms such as k-Nearest Neighbor (k-NN) based supervised learning to forecast the best predictor for the workload under study. Then only the forecasted best predictor is run for prediction. Our experimental results show that it achieved 20.18% higher best predictor forecasting accuracy than the cumulative MSB based predictor selection approach used in the popular network weather service system. In addition, it outperformed the observed most accurate single predictor in the pool for 44.23% of the performance traces.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-10
Adaptive Predictor Integration for System Performance Prediction
The integration of multiple predictors promises higher prediction accuracy than the accuracy that can be obtained with a single predictor. The challenge is how to select the best predictor at any given moment. Traditionally, multiple predictors are run in parallel and the one that generates the best result is selected for prediction. In this paper, we propose a novel approach for predictor integration based on the learning of historical predictions. It uses classification algorithms such as k-Nearest Neighbor (k-NN) based supervised learning to forecast the best predictor for the workload under study. Then only the forecasted best predictor is run for prediction. Our experimental results show that it achieved 20.18% higher best predictor forecasting accuracy than the cumulative MSB based predictor selection approach used in the popular network weather service system. In addition, it outperformed the observed most accurate single predictor in the pool for 44.23% of the performance traces.