Flavio Villanustre
Flavio Villanustre has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
Taghi M. Khoshgoftaar
Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, USA
5 shared publications- Borko Furht
Florida Atlantic University
3 shared publications Edin Muharemagic
HPCC Systems, LexisNexis Risk Solutions, Boca Raton, USA
3 shared publicationsAmy W. Apon
Clemson University, Clemson, SC, USA
2 shared publicationsBorko Furht
Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, USA
2 shared publicationsLinh B. Ngo
Clemson University, Clemson, SC, USA
2 shared publications
Latest Publications
- Open Access
- 30 July 2019
- Published by Springer Nature in Journal of Big Data
- Vol. 6 (1) , 1-36
Random forest implementation and optimization for Big Data analytics on LexisNexis’s high performance computing cluster platform
- 30 July 2019
- Published by Springer Nature in Journal of Big Data
- Vol. 6 (1) , 1-36
Open AccessRandom forest implementation and optimization for Big Data analytics on LexisNexis’s high performance computing cluster platform
- Open Access
- 14 February 2019
- Published by Springer Nature in Journal of Big Data
- Vol. 6 (1) , 16
A parallel and distributed stochastic gradient descent implementation using commodity clusters
- 14 February 2019
- Published by Springer Nature in Journal of Big Data
- Vol. 6 (1) , 16
Open AccessA parallel and distributed stochastic gradient descent implementation using commodity clusters
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2941-2950
ECL-watch: A big data application performance tuning tool in the HPCC systems platform
The proliferation of Big Data processing environments such as Hadoop, Apache Spark, and HPCC Systems is driving the development of performance analysis tools in these distributed systems. The goal is to achieve high performance through the optimization of Big Data applications. However, tuning performance in a fine-grained manner is quite challenging due to the high complexity and massive size of the distributed systems. ECL-Watch is a data-flow based fine-grained comprehensive Big Data performance analysis tool utilizing the high level declarative dataflow programming language ECL in HPCC Systems. As a case study, we implement and optimize the Yinyang K-Means machine learning algorithm in ECL in HPCC Systems. The experimental results show that the performance of the native ECL version of the Yinyang K-Means algorithm increased significantly after tuning: from being about three times slower than the standard K-Means implementation in ECL, to become roughly 15% faster than standard K-Means.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2941-2950
ECL-watch: A big data application performance tuning tool in the HPCC systems platform
The proliferation of Big Data processing environments such as Hadoop, Apache Spark, and HPCC Systems is driving the development of performance analysis tools in these distributed systems. The goal is to achieve high performance through the optimization of Big Data applications. However, tuning performance in a fine-grained manner is quite challenging due to the high complexity and massive size of the distributed systems. ECL-Watch is a data-flow based fine-grained comprehensive Big Data performance analysis tool utilizing the high level declarative dataflow programming language ECL in HPCC Systems. As a case study, we implement and optimize the Yinyang K-Means machine learning algorithm in ECL in HPCC Systems. The experimental results show that the performance of the native ECL version of the Yinyang K-Means algorithm increased significantly after tuning: from being about three times slower than the standard K-Means implementation in ECL, to become roughly 15% faster than standard K-Means.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2442-2451
Trilogy: Data placement to improve performance and robustness of cloud computing
Infrastructure as a Service, one of the most disruptive aspects of cloud computing, enables configuring a cluster for each application for each workload. When the workload changes, a cluster will be either underutilized (wasting resources) or unable to meet demand (incurring opportunity costs). Consequently, efficient cluster resizing requires proper data replication and placement. Our work reveals that coarse-grain, workload-aware replication addresses over-utilization but cannot resolve under-utilization. With fine-grain partitioning of the dataset, data replication can reduce both under- and over-utilization. In our empirical studies, compared to a näive uniform data replication a coarse-grain workload-aware replication increases throughput by 81% on a highly-skewed workload. A fine-grain scheme further reaches 166% increase. Furthermore, a surprisingly small increase in granularity is sufficient to obtain most benefits. Evaluations also show that maximizing the number of unique partitions per node increases robustness to tolerate workload deviation while minimizing this number reduces storage footprint.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2442-2451
Trilogy: Data placement to improve performance and robustness of cloud computing
Infrastructure as a Service, one of the most disruptive aspects of cloud computing, enables configuring a cluster for each application for each workload. When the workload changes, a cluster will be either underutilized (wasting resources) or unable to meet demand (incurring opportunity costs). Consequently, efficient cluster resizing requires proper data replication and placement. Our work reveals that coarse-grain, workload-aware replication addresses over-utilization but cannot resolve under-utilization. With fine-grain partitioning of the dataset, data replication can reduce both under- and over-utilization. In our empirical studies, compared to a näive uniform data replication a coarse-grain workload-aware replication increases throughput by 81% on a highly-skewed workload. A fine-grain scheme further reaches 166% increase. Furthermore, a surprisingly small increase in granularity is sufficient to obtain most benefits. Evaluations also show that maximizing the number of unique partitions per node increases robustness to tolerate workload deviation while minimizing this number reduces storage footprint.
- Open Access
- 17 July 2017
- Published by Springer Nature in Journal of Big Data
- Vol. 4 (1) , 22
Large-scale distributed L-BFGS
- 17 July 2017
- Published by Springer Nature in Journal of Big Data
- Vol. 4 (1) , 22
Open AccessLarge-scale distributed L-BFGS
- 17 September 2016
- Published by Springer Nature
- p. 133-156
Deep Learning Techniques in Big Data Analytics
- 17 September 2016
- Published by Springer Nature
- p. 133-156
Deep Learning Techniques in Big Data Analytics
- 17 September 2016
- Published by Springer Nature
- p. 307-328
Graph Processing with Massive Datasets: A Kel Primer
- 17 September 2016
- Published by Springer Nature
- p. 307-328
Graph Processing with Massive Datasets: A Kel Primer
- 17 September 2016
- Published by Springer Nature
- p. 341-346
Social Network Analytics: Hidden and Complex Fraud Schemes
- 17 September 2016
- Published by Springer Nature
- p. 341-346
Social Network Analytics: Hidden and Complex Fraud Schemes