Partout: A Distributed Engine for Efficient RDF Processing

The increasing interest in Semantic Web technologies has led not only to a rapid growth of semantic data on the Web but also to an increasing number of backend applications with already more than a trillion triples in some cases. Confronted with such huge amounts of data and the future growth, existing state-of-the-art systems for storing RDF and processing SPARQL queries are no longer sufficient. In this paper, we introduce Partout, a distributed engine for efficient RDF processing in a cluster of machines. We propose an effective approach for fragmenting RDF data sets based on a query log, allocating the fragments to nodes in a cluster, and finding the optimal configuration. Partout can efficiently handle updates and its query optimizer produces efficient query execution plans for ad-hoc SPARQL queries. Our experiments show the superiority of our approach to state-of-the-art approaches for partitioning and distributed SPARQL query processing

Offline and online power aware resource allocation algorithms with migration and delay constraints

© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/In order to handle advanced mobile broadband services and Internet of Things (IoT), future Internet and 5G networks are expected to leverage the use of network virtualization, be much faster, have greater capacities, provide lower latencies, and significantly be power efficient than current mobile technologies. Therefore, this paper proposes three power aware algorithms for offline, online, and migration applications, solving the resource allocation problem within the frameworks of network function virtualization (NFV) environments in fractions of a second. The proposed algorithms target minimizing the total costs and power consumptions in the physical network through sufficiently allocating the least physical resources to host the demands of the virtual network services, and put into saving mode all other not utilized physical components. Simulations and evaluations of the offline algorithm compared to the state-of-art resulted on lower total costs by 32%. In addition to that, the online algorithm was tested through four different experiments, and the results argued that the overall power consumption of the physical network was highly dependent on the demands’ lifetimes, and the strictness of the required end-to-end delay. Regarding migrations during online, the results concluded that the proposed algorithms would be most effective when applied for maintenance and emergency conditions.Peer ReviewedPreprin

Resources and Tools:A Step-by-Step Methodological Guide for Costing HIV/AIDS Activities

Many developing countries have recognized the need for comprehensive national reforms and comprehensive prevention, treatment, and care and support initiatives to reduce future transmission of and to meet the growing demand for HIV/AIDS services. As a part of these national health reform initiatives, governments are exploring ways to allocate resources in the most efficient and effective way to mitigate the HIV/AIDS epidemic. However, many countries lack information on the level and nature of the costs of HIV/AIDS programs. This document provides an introduction to the procedure for calculating and analyzing the costs of HIV/AIDS programs and describes how to measure directly the actual costs of a program that is up and running. The step-by-step guide is intended to provide project managers in the field with a framework for how to do measure costs for a single, recent year in the life of an HIV/AIDS program. An illustrative activities list in the report annex will assist the user to develop an activities-based framework. The information gleaned from the costing framework will enable policymakers and program managers to make informed resource allocation decisions