DECENTRALIZED RESOURCE ORCHESTRATION FOR HETEROGENEOUS GRIDS

Modern desktop machines now use multi-core CPUs to enable improved performance. However, achieving high performance on multi-core machines without optimized software support is still difficult even in a single machine, because contention for shared resources can make it hard to exploit multiple computing resources efficiently. Moreover, more diverse and heterogeneous hardware platforms (e.g. general-purpose GPU and Cell processors) have emerged and begun to impact grid computing. Given that heterogeneity and diversity are now a major trend going forward, grid computing must support these environmental changes. In this dissertation, I design and evaluate a decentralized resource management scheme to exploit heterogeneous multiple computing resources effectively. I suggest resource management algorithms that can efficiently utilize a diverse computational environment, including multiple symmetric computing entities and heterogeneous multi-computing entities, and achieve good load-balancing and high total system throughput. Moreover, I propose expressive resource description techniques to accommodate more heterogeneous environments, allowing incoming jobs with complex requirements to be matched to available resources. First, I develop decentralized resource management frameworks and job scheduling schemes to exploit multi-core nodes in peer-to-peer grids. I present two new load-balancing schemes that explicitly account for resource sharing and contention across multiple cores within a single machine, and propose a simple performance prediction model that can represent a continuum of resource sharing among cores of a CPU. Second, I provide scalable resource discovery and load balancing techniques to accommodate nodes with many types of computing elements, such as multi-core CPUs and GPUs, in a peer-to-peer grid architecture. My scheme takes into account diverse aspects of heterogeneous nodes to maximize overall system throughput as well as minimize messaging costs without sacrificing the failure resilience provided by an underlying peer-to-peer overlay network. Finally, I propose an expressive resource discovery method to support multi-attribute, range-based job constraints. The common approach of using simple attribute indexes does not suffice, as range-based constraints may be satisfied by more than a single value. I design a compact ID-based representation for resource characteristics, and integrate this representation into the decentralized resource discovery framework. By extensive experimental results via simulation, I show that my schemes can match heterogeneous jobs to heterogeneous resources both effectively (good matches are found, load is balanced), and efficiently (the new functionality imposes little overhead)

DECENTRALIZED AND SCALABLE RESOURCE MANAGEMENT FOR DESKTOP GRIDS

The recent growth of the Internet and the CPU power of personal computers and workstations enables desktop grid computing to achieve tremendous computing power with low cost, through opportunistic sharing of resources. However, traditional server-client Grid architectures have inherent problems in robustness, reliability and scalability. Researchers have therefore recently turned to Peer-to-Peer (P2P) algorithms in an attempt to address these issues. I have designed and evaluated a set of protocols that implement a scalable P2P desktop grid computing system for executing Grid applications on widely distributed sets of resources. Such infrastructure must be decentralized, robust, highly available and scalable, while effectively mapping application instances to available resources throughout the system (called matchmaking). First of all, I address the problem of efficient matchmaking of jobs to available system resources by employing customized Content-Addressable Network (CAN) where each resource type corresponds to a distinct dimension. With this approach, incoming jobs are matched with system nodes through proximity in an N-dimensional resource space. Second, I provide comprehensive load balancing mechanisms that can greatly improve overall system throughput and response time without using any centralized control or information about the system. Finally, to remove any hot spots in the system where a small number of nodes are processing a lot of system maintenance work, I have designed a set of optimizations to minimize overall system overheads and distribute them fairly among available system nodes. My ultimate goal is to ensure that no node in the system becomes much more heavily loaded than others, either because of executing jobs or from system maintenance tasks. This is because every node in our system is a peer, so that no node is acting as a pure server or a pure client. Throughout extensive experimental results, I show that the resulting P2P desktop grid computing system is scalable and effective so that it can efficiently match any type of resource requirements for jobs simultaneously, while balancing load among multiple candidate nodes

Energy efficient resource sharing for networked homes

Diese Arbeit beschäftigt sich mit Energieeffizienz für Heimnetzwerke. Sie zeigt inwiefern Stromsparen mittels Ressourcen- und Aufgaben-Sharing durch Kooperation möglich ist. Der globale Stromverbrauch eines Netzwerkes von Heimen, und auch der lokale Stromverbrauch eines einzelnen Heimes, können durch Lastkonzentration reduziert werden. Die Energieeffizienz des verteilten Falls, in welchem Aufgaben unter den Heimen verteilt werden, wird mit der Energieeffizienz des lokalen Falls ohne Verteilung für die gleiche Last verglichen. Eine Architektur, basierend auf Konzepten des Ressourcen-Sharings, der Virtualisierung und virtuellen Heimumgebungen, wird vorgestellt. Für diese Architektur werden Applikationen mit typischen Ressourcen-Anforderungen erforscht um aufzuzeigen unter welchen Umständen Strom gespart werden kann. Analytische Modelle und Simulationsmodelle sind entwickelt worden um den Vorteil des verteilten Falls unter verschiedenen Aspekten darzustellen

PARALLEL COMPUTING WITH P2P DESKTOP GRIDS

Tightly-coupled parallel computing is an important tool for problem solving. Structured peer-to-peer network overlays are failure-tolerant and have a low admin- istrative burden. This work seeks to unite the two. First, I present a completely decentralized algorithm for parallel job scheduling and load balancing in distributed peer-to-peer environments. This algorithm is useful for meta-scheduling across known clusters and scheduling on desktop grids. To accomplish this, I build on previous work to route jobs to appropriate resources then use the new algorithm to start parallel jobs and balance load across the grid. I also discuss what constitutes useful clusterings for this algorithm as well as inherent scaling limitations. Ultimately, I show that my algorithm performs comparably to one using centralized load balancing with global up-to-date information. The principal contribution of this work is that the parallel job scheduling is completely decentralized, which is not featured in previous work, and enables reliable ad hoc sharing of distributed resources to run parallel computations. Second, I show how clusters of computers can be found dynamically by using an existing latency prediction technique coupled with a new refinement algorithm. Several latency prediction techniques are compared experimentally. One, based on a tree metric space embedding, is found to be superior to the others. Nevertheless, I show that it is not quite accurate enough. To solve this problem, I present a refinement algorithm for producing quality clusters while still maintaining bounds for the amount of information any given node must store about other nodes. I show that clusters derived this way have scheduler performance comparable to those chosen statically with global knowledge. Lastly, I discuss previously undiscovered under-specifications in the Content Addressable Network (CAN) structured peer to peer system. In high-churn situ- ations, the CAN allows stale information and changes to the overlay structure to create routing problems. I show solutions to these two problems, as well as discuss other issues that may also disrupt a CAN

Using deep learning to classify community network traffic

Traffic classification is an important aspect of network management. This aspect improves the quality of service, traffic engineering, bandwidth management and internet security. Traffic classification methods continue to evolve due to the ever-changing dynamics of modern computer networks and the traffic they generate. Numerous studies on traffic classification make use of the Machine Learning (ML) and single Deep Learning (DL) models. ML classification models are effective to a certain degree. However, studies have shown they record low prediction and accuracy scores. In contrast, the proliferation of various deep learning techniques has recorded higher accuracy in traffic classification. The Deep Learning models have been successful in identifying encrypted network traffic. Furthermore, DL learns new features without the need to do much feature engineering compared to ML or Traditional methods. Traditional methods are inefficient in meeting the demands of ever-changing requirements of networks and network applications. Traditional methods are unfeasible and costly to maintain as they need constant updates to maintain their accuracy. In this study, we carry out a comparative analysis by adopting an ML model (Support Vector Machine) against the DL Models (Convolutional Neural Networks (CNN), Gated Recurrent Unit (GRU) and a hybrid model: CNNGRU to classify encrypted internet traffic collected from a community network. In this study, we performed a comparative analysis by adopting an ML model (Support vector machine). Machine against DL models (Convolutional Neural networks (CNN), Gated Recurrent Unit (GRU) and a hybrid model: CNNGRU) and to classify encrypted internet traffic that was collected from a community network. The results show that DL models tend to generalise better with the dataset in comparison to ML. Among the deep Learning models, the hybrid model outperformed all the other models in terms of accuracy score. However, the model that had the best accuracy rate was not necessarily the one that took the shortest time when it came to prediction speed considering that it was more complex. Support vector machines outperformed the deep learning models in terms of prediction speed

Integration of Distributed Services and Hybrid Models Based on Process Choreography to Predict and Detect Type 2 Diabetes

[EN] Life expectancy is increasing and, so, the years that patients have to live with chronic diseases and co-morbidities. Type 2 diabetes is one of the most prevalent chronic diseases, specifically linked to being overweight and ages over sixty. Recent studies have demonstrated the effectiveness of new strategies to delay and even prevent the onset of type 2 diabetes by a combination of active and healthy lifestyle on cohorts of mid to high risk subjects. Prospective research has been driven on large groups of the population to build risk scores that aim to obtain a rule for the classification of patients according to the odds for developing the disease. Currently, there are more than two hundred models and risk scores for doing this, but a few have been properly evaluated in external groups and integrated into a clinical application for decision support. In this paper, we present a novel system architecture based on service choreography and hybrid modeling, which enables a distributed integration of clinical databases, statistical and mathematical engines and web interfaces to be deployed in a clinical setting. The system was assessed during an eight-week continuous period with eight endocrinologists of a hospital who evaluated up to 8080 patients with seven different type 2 diabetes risk models implemented in two mathematical engines. Throughput was assessed as a matter of technical key performance indicators, confirming the reliability and efficiency of the proposed architecture to integrate hybrid artificial intelligence tools into daily clinical routine to identify high risk subjects.The authors wish to acknowledge the consortium of the MOSAIC project (funded by the European Commission, Grant No. FP7-ICT 600914) for their commitment during concept development, which led to the development of the research reported in this manuscriptMartinez-Millana, A.; Bayo-Monton, JL.; Argente-Pla, M.; Fernández Llatas, C.; Merino-Torres, JF.; Traver Salcedo, V. (2018). Integration of Distributed Services and Hybrid Models Based on Process Choreography to Predict and Detect Type 2 Diabetes. Sensors. 18 (1)(79):1-26. https://doi.org/10.3390/s18010079S12618 (1)79Thomas, C. C., & Philipson, L. H. (2015). Update on Diabetes Classification. Medical Clinics of North America, 99(1), 1-16. doi:10.1016/j.mcna.2014.08.015Kahn, S. E., Hull, R. L., & Utzschneider, K. M. (2006). Mechanisms linking obesity to insulin resistance and type 2 diabetes. Nature, 444(7121), 840-846. doi:10.1038/nature05482Guariguata, L., Whiting, D. R., Hambleton, I., Beagley, J., Linnenkamp, U., & Shaw, J. E. (2014). Global estimates of diabetes prevalence for 2013 and projections for 2035. Diabetes Research and Clinical Practice, 103(2), 137-149. doi:10.1016/j.diabres.2013.11.002Beagley, J., Guariguata, L., Weil, C., & Motala, A. A. (2014). Global estimates of undiagnosed diabetes in adults. Diabetes Research and Clinical Practice, 103(2), 150-160. doi:10.1016/j.diabres.2013.11.001Hippisley-Cox, J., Coupland, C., Robson, J., Sheikh, A., & Brindle, P. (2009). Predicting risk of type 2 diabetes in England and Wales: prospective derivation and validation of QDScore. BMJ, 338(mar17 2), b880-b880. doi:10.1136/bmj.b880Meigs, J. B., Shrader, P., Sullivan, L. M., McAteer, J. B., Fox, C. S., Dupuis, J., … Cupples, L. A. (2008). Genotype Score in Addition to Common Risk Factors for Prediction of Type 2 Diabetes. New England Journal of Medicine, 359(21), 2208-2219. doi:10.1056/nejmoa0804742Gillies, C. L., Abrams, K. R., Lambert, P. C., Cooper, N. J., Sutton, A. J., Hsu, R. T., & Khunti, K. (2007). Pharmacological and lifestyle interventions to prevent or delay type 2 diabetes in people with impaired glucose tolerance: systematic review and meta-analysis. BMJ, 334(7588), 299. doi:10.1136/bmj.39063.689375.55Noble, D., Mathur, R., Dent, T., Meads, C., & Greenhalgh, T. (2011). Risk models and scores for type 2 diabetes: systematic review. BMJ, 343(nov28 1), d7163-d7163. doi:10.1136/bmj.d7163Collins, G. S., Reitsma, J. B., Altman, D. G., & Moons, K. G. M. (2015). Transparent Reporting of a multivariable prediction model for Individual Prognosis Or Diagnosis (TRIPOD): The TRIPOD Statement. Annals of Internal Medicine, 162(1), 55. doi:10.7326/m14-0697Steyerberg, E. W., Moons, K. G. M., van der Windt, D. A., Hayden, J. A., Perel, P., … Schroter, S. (2013). Prognosis Research Strategy (PROGRESS) 3: Prognostic Model Research. PLoS Medicine, 10(2), e1001381. doi:10.1371/journal.pmed.1001381Collins, G. S., & Moons, K. G. M. (2012). Comparing risk prediction models. BMJ, 344(may24 2), e3186-e3186. doi:10.1136/bmj.e3186Riley, R. D., Ensor, J., Snell, K. I. E., Debray, T. P. A., Altman, D. G., Moons, K. G. M., & Collins, G. S. (2016). External validation of clinical prediction models using big datasets from e-health records or IPD meta-analysis: opportunities and challenges. BMJ, i3140. doi:10.1136/bmj.i3140Reilly, B. M., & Evans, A. T. (2006). Translating Clinical Research into Clinical Practice: Impact of Using Prediction Rules To Make Decisions. Annals of Internal Medicine, 144(3), 201. doi:10.7326/0003-4819-144-3-200602070-00009Altman, D. G., Vergouwe, Y., Royston, P., & Moons, K. G. M. (2009). Prognosis and prognostic research: validating a prognostic model. BMJ, 338(may28 1), b605-b605. doi:10.1136/bmj.b605Moons, K. G. M., Royston, P., Vergouwe, Y., Grobbee, D. E., & Altman, D. G. (2009). Prognosis and prognostic research: what, why, and how? BMJ, 338(feb23 1), b375-b375. doi:10.1136/bmj.b375Steyerberg, E. W., Vickers, A. J., Cook, N. R., Gerds, T., Gonen, M., Obuchowski, N., … Kattan, M. W. (2010). Assessing the Performance of Prediction Models. Epidemiology, 21(1), 128-138. doi:10.1097/ede.0b013e3181c30fb2Kayacan, E., Ulutas, B., & Kaynak, O. (2010). Grey system theory-based models in time series prediction. Expert Systems with Applications, 37(2), 1784-1789. doi:10.1016/j.eswa.2009.07.064Schmidt, M. I., Duncan, B. B., Bang, H., Pankow, J. S., Ballantyne, C. M., … Golden, S. H. (2005). Identifying Individuals at High Risk for Diabetes: The Atherosclerosis Risk in Communities study. Diabetes Care, 28(8), 2013-2018. doi:10.2337/diacare.28.8.2013Talmud, P. J., Hingorani, A. D., Cooper, J. A., Marmot, M. G., Brunner, E. J., Kumari, M., … Humphries, S. E. (2010). Utility of genetic and non-genetic risk factors in prediction of type 2 diabetes: Whitehall II prospective cohort study. BMJ, 340(jan14 1), b4838-b4838. doi:10.1136/bmj.b4838Sackett, D. L. (1997). Evidence-based medicine. Seminars in Perinatology, 21(1), 3-5. doi:10.1016/s0146-0005(97)80013-4Segagni, D., Ferrazzi, F., Larizza, C., Tibollo, V., Napolitano, C., Priori, S. G., & Bellazzi, R. (2011). R Engine Cell: integrating R into the i2b2 software infrastructure. Journal of the American Medical Informatics Association, 18(3), 314-317. doi:10.1136/jamia.2010.007914Semantic Webhttp://www.w3.org/2001/sw/Murphy, S. N., Weber, G., Mendis, M., Gainer, V., Chueh, H. C., Churchill, S., & Kohane, I. (2010). Serving the enterprise and beyond with informatics for integrating biology and the bedside (i2b2). Journal of the American Medical Informatics Association, 17(2), 124-130. doi:10.1136/jamia.2009.000893Murphy, S., Churchill, S., Bry, L., Chueh, H., Weiss, S., Lazarus, R., … Kohane, I. (2009). Instrumenting the health care enterprise for discovery research in the genomic era. Genome Research, 19(9), 1675-1681. doi:10.1101/gr.094615.109Lindstrom, J., & Tuomilehto, J. (2003). The Diabetes Risk Score: A practical tool to predict type 2 diabetes risk. Diabetes Care, 26(3), 725-731. doi:10.2337/diacare.26.3.725Alssema, M., Vistisen, D., Heymans, M. W., Nijpels, G., Glümer, C., … Dekker, J. M. (2010). The Evaluation of Screening and Early Detection Strategies for Type 2 Diabetes and Impaired Glucose Tolerance (DETECT-2) update of the Finnish diabetes risk score for prediction of incident type 2 diabetes. Diabetologia, 54(5), 1004-1012. doi:10.1007/s00125-010-1990-7Mann, D. M., Bertoni, A. G., Shimbo, D., Carnethon, M. R., Chen, H., Jenny, N. S., & Muntner, P. (2010). Comparative Validity of 3 Diabetes Mellitus Risk Prediction Scoring Models in a Multiethnic US Cohort: The Multi-Ethnic Study of Atherosclerosis. American Journal of Epidemiology, 171(9), 980-988. doi:10.1093/aje/kwq030Stern, M. P., Williams, K., & Haffner, S. M. (2002). Identification of Persons at High Risk for Type 2 Diabetes Mellitus: Do We Need the Oral Glucose Tolerance Test? Annals of Internal Medicine, 136(8), 575. doi:10.7326/0003-4819-136-8-200204160-00006Abdul-Ghani, M. A., Abdul-Ghani, T., Stern, M. P., Karavic, J., Tuomi, T., Bo, I., … Groop, L. (2011). Two-Step Approach for the Prediction of Future Type 2 Diabetes Risk. Diabetes Care, 34(9), 2108-2112. doi:10.2337/dc10-2201Rahman, M., Simmons, R. K., Harding, A.-H., Wareham, N. J., & Griffin, S. J. (2008). A simple risk score identifies individuals at high risk of developing Type 2 diabetes: a prospective cohort study. Family Practice, 25(3), 191-196. doi:10.1093/fampra/cmn024Guasch-Ferré, M., Bulló, M., Costa, B., Martínez-Gonzalez, M. Á., Ibarrola-Jurado, N., … Estruch, R. (2012). A Risk Score to Predict Type 2 Diabetes Mellitus in an Elderly Spanish Mediterranean Population at High Cardiovascular Risk. PLoS ONE, 7(3), e33437. doi:10.1371/journal.pone.0033437Wilson, P. W. F. (2007). Prediction of Incident Diabetes Mellitus in Middle-aged Adults. Archives of Internal Medicine, 167(10), 1068. doi:10.1001/archinte.167.10.1068Franzin, A., Sambo, F., & Di Camillo, B. (2016). bnstruct: an R package for Bayesian Network structure learning in the presence of missing data. Bioinformatics, btw807. doi:10.1093/bioinformatics/btw807Rood, B., & Lewis, M. J. (2009). Grid Resource Availability Prediction-Based Scheduling and Task Replication. Journal of Grid Computing, 7(4), 479-500. doi:10.1007/s10723-009-9135-2Ramakrishnan, L., & Reed, D. A. (2009). Predictable quality of service atop degradable distributed systems. Cluster Computing, 16(2), 321-334. doi:10.1007/s10586-009-0078-yKianpisheh, S., Kargahi, M., & Charkari, N. M. (2017). Resource Availability Prediction in Distributed Systems: An Approach for Modeling Non-Stationary Transition Probabilities. IEEE Transactions on Parallel and Distributed Systems, 28(8), 2357-2372. doi:10.1109/tpds.2017.2659746Weber, G. M., Murphy, S. N., McMurry, A. J., MacFadden, D., Nigrin, D. J., Churchill, S., & Kohane, I. S. (2009). The Shared Health Research Information Network (SHRINE): A Prototype Federated Query Tool for Clinical Data Repositories. Journal of the American Medical Informatics Association, 16(5), 624-630. doi:10.1197/jamia.m3191Martinez-Millana, A., Fico, G., Fernández-Llatas, C., & Traver, V. (2015). Performance assessment of a closed-loop system for diabetes management. Medical & Biological Engineering & Computing, 53(12), 1295-1303. doi:10.1007/s11517-015-1245-3Foundation for Intelligent Physical Agentshttp://www.pa.org/González-Vélez, H., Mier, M., Julià-Sapé, M., Arvanitis, T. N., García-Gómez, J. M., Robles, M., … Lluch-Ariet, M. (2007). HealthAgents: distributed multi-agent brain tumor diagnosis and prognosis. Applied Intelligence, 30(3), 191-202. doi:10.1007/s10489-007-0085-8Bellazzi, R. (2014). Big Data and Biomedical Informatics: A Challenging Opportunity. Yearbook of Medical Informatics, 23(01), 08-13. doi:10.15265/iy-2014-0024Maximilien, E. M., & Singh, M. P. (2004). A framework and ontology for dynamic Web services selection. IEEE Internet Computing, 8(5), 84-93. doi:10.1109/mic.2004.2

The architecture of discovery net : towards grid-based discovery services

Imperial Users onl

DECENTRALIZED NETWORK BANDWIDTH PREDICTION AND NODE SEARCH

As modern computing becomes increasingly data-intensive and distributed, it is becoming crucial to effectively manage and exploit end-to-end network bandwidth information from hosts on wide-area networks. Inspired by the finding that Internet bandwidth can be represented approximately in a tree metric space, we focus on three specific research problems. First, we have designed a decentralized algorithm for network bandwidth prediction. The algorithm embeds the bandwidth information as distance in an edge-weighted tree, without performing full n-to-n measurements. No central and fixed infrastructure is required. Each joining node performs a limited number of sampling measurements. Second, we designed a decentralized algorithm to search for a centroid node that has high-bandwidth connections with a given set of nodes. The algorithm can find a centroid accurately and efficiently using the bandwidth data produced by the prediction algorithm. Last, we have designed another type of decentralized search algorithm to find a cluster of nodes that have high-bandwidth interconnections. While the clustering problem is NP-complete in a general graph, our algorithm runs in polynomial time with the bandwidth data predicted in a tree metric space. We provide proofs that our algorithms for bandwidth prediction and node search have perfect accuracy and high scalability when a network is modeled as a tree metric space. Also, experimental results with real-world data sets validate the high accuracy and scalability of our approaches