TENSILE: A Tensor granularity dynamic GPU memory scheduling method towards multiple dynamic workloads system

Recently, deep learning has been an area of intense research. However, as a kind of computing-intensive task, deep learning highly relies on the scale of GPU memory, which is usually prohibitive and scarce. Although there are some extensive works have been proposed for dynamic GPU memory management, they are hard to be applied to systems with multiple dynamic workloads, such as in-database machine learning systems. In this paper, we demonstrated TENSILE, a method of managing GPU memory in tensor granularity to reduce the GPU memory peak, considering the multiple dynamic workloads. TENSILE tackled the cold-starting and across-iteration scheduling problem existing in previous works. We implement TENSILE on a deep learning framework built by ourselves and evaluated its performance. The experiment results show that TENSILE can save more GPU memory with less extra time overhead than prior works in both single and multiple dynamic workloads scenarios

Garbage collection auto-tuning for Java MapReduce on Multi-Cores

MapReduce has been widely accepted as a simple programming pattern that can form the basis for efficient, large-scale, distributed data processing. The success of the MapReduce pattern has led to a variety of implementations for different computational scenarios. In this paper we present MRJ, a MapReduce Java framework for multi-core architectures. We evaluate its scalability on a four-core, hyperthreaded Intel Core i7 processor, using a set of standard MapReduce benchmarks. We investigate the significant impact that Java runtime garbage collection has on the performance and scalability of MRJ. We propose the use of memory management auto-tuning techniques based on machine learning. With our auto-tuning approach, we are able to achieve MRJ performance within 10% of optimal on 75% of our benchmark tests

Modelling Energy Consumption based on Resource Utilization

Power management is an expensive and important issue for large computational infrastructures such as datacenters, large clusters, and computational grids. However, measuring energy consumption of scalable systems may be impractical due to both cost and complexity for deploying power metering devices on a large number of machines. In this paper, we propose the use of information about resource utilization (e.g. processor, memory, disk operations, and network traffic) as proxies for estimating power consumption. We employ machine learning techniques to estimate power consumption using such information which are provided by common operating systems. Experiments with linear regression, regression tree, and multilayer perceptron on data from different hardware resulted into a model with 99.94\% of accuracy and 6.32 watts of error in the best case.Comment: Submitted to Journal of Supercomputing on 14th June, 201

Internet of things (IoT) based adaptive energy management system for smart homes

PhD ThesisInternet of things enhances the flexibility of measurements under different environments, the development of advanced wireless sensors and communication networks on the smart grid infrastructure would be essential for energy efficiency systems. It makes deployment of a smart home concept easy and realistic. The smart home concept allows residents to control, monitor and manage their energy consumption with minimal wastage. The scheduling of energy usage enables forecasting techniques to be essential for smart homes. This thesis presents a self-learning home management system based on machine learning techniques and energy management system for smart homes. Home energy management system, demand side management system, supply side management system, and power notification system are the major components of the proposed self-learning home management system. The proposed system has various functions including price forecasting, price clustering, power forecasting alert, power consumption alert, and smart energy theft system to enhance the capabilities of the self-learning home management system. These functions were developed and implemented through the use of computational and machine learning technologies. In order to validate the proposed system, real-time power consumption data were collected from a Singapore smart home and a realistic experimental case study was carried out. The case study had proven that the developed system performing well and increased energy awareness to the residents. This proposed system also showcases its customizable ability according to different types of environments as compared to traditional smart home models. Forecasting systems for the electricity market generation have become one of the foremost research topics in the power industry. It is essential to have a forecasting system that can accurately predict electricity generation for planning and operation in the electricity market. This thesis also proposed a novel system called multi prediction system and it is developed based on long short term memory and gated recurrent unit models. This proposed system is able to predict the electricity market generation with high accuracy. Multi Prediction System is based on four stages which include a data collecting and pre-processing module, a multi-input feature model, multi forecast model and mean absolute percentage error. The data collecting and pre-processing module preprocess the real-time data using a window method. Multi-input feature model uses single input feeding method, double input feeding method and multiple feeding method for features input to the multi forecast model. Multi forecast model integrates long short term memory and gated recurrent unit variations such as regression model, regression with time steps model, memory between batches model and stacked model to predict the future generation of electricity. The mean absolute percentage error calculation was utilized to evaluate the accuracy of the prediction. The proposed system achieved high accuracy results to demonstrate its performance

Android Malware Family Classification Based on Resource Consumption over Time

The vast majority of today's mobile malware targets Android devices. This has pushed the research effort in Android malware analysis in the last years. An important task of malware analysis is the classification of malware samples into known families. Static malware analysis is known to fall short against techniques that change static characteristics of the malware (e.g. code obfuscation), while dynamic analysis has proven effective against such techniques. To the best of our knowledge, the most notable work on Android malware family classification purely based on dynamic analysis is DroidScribe. With respect to DroidScribe, our approach is easier to reproduce. Our methodology only employs publicly available tools, does not require any modification to the emulated environment or Android OS, and can collect data from physical devices. The latter is a key factor, since modern mobile malware can detect the emulated environment and hide their malicious behavior. Our approach relies on resource consumption metrics available from the proc file system. Features are extracted through detrended fluctuation analysis and correlation. Finally, a SVM is employed to classify malware into families. We provide an experimental evaluation on malware samples from the Drebin dataset, where we obtain a classification accuracy of 82%, proving that our methodology achieves an accuracy comparable to that of DroidScribe. Furthermore, we make the software we developed publicly available, to ease the reproducibility of our results.Comment: Extended Versio

Elements of latent learning in a maze environment

A general purpose learning program is described which demonstrates a latent learning ability by operating at two separate goal pursuit levels. At one level are the constant, implicit goals associated with the system's memory management mechanisms. At the higher level are the dynamic, explicit behavioral goals which the implicit goals enable by manipulating memory representations to conform to the external surroundings. The program is shown to negotiate a simulated maze environment by the step-wise refinement of its latently learned experiences