Ubiquitous Memory Introspection (Preliminary Manuscript)

Modern memory systems play a critical role in the performance ofapplications, but a detailed understanding of the application behaviorin the memory system is not trivial to attain. It requires timeconsuming simulations of the memory hierarchy using long traces, andoften using detailed modeling. It is increasingly possible to accesshardware performance counters to measure events in the memory system,but the measurements remain coarse grained, better suited forperformance summaries than providing instruction level feedback. Theavailability of a low cost, online, and accurate methodology forderiving fine-grained memory behavior profiles can prove extremelyuseful for runtime analysis and optimization of programs.This paper presents a new methodology for Ubiquitous MemoryIntrospection (UMI). It is an online and lightweight mini-simulationmethodology that focuses on simulating short memory access tracesrecorded from frequently executed code regions. The simulations arefast and can provide profiling results at varying granularities, downto that of a single instruction or address. UMI naturally complementsruntime optimizations techniques and enables new opportunities formemory specific optimizations.In this paper, we present a prototype implementation of a runtimesystem implementing UMI. The prototype is readily deployed oncommodity processors, requires no user intervention, and can operatewith stripped binaries and legacy software. The prototype operateswith an average runtime overhead of 20% but this slowdown is only 6%slower than a state of the art binary instrumentation tool. We used32 benchmarks, including the full suite of SPEC2000 benchmarks, forour evaluation. We show that the mini-simulation results accuratelyreflect the cache performance of two existing memory systems, anIntel Pentium~4 and an AMD Athlon MP (K7) processor. We alsodemonstrate that low level profiling information from the onlinesimulation can serve to identify high-miss rate load instructions with a77% rate of accuracy compared to full offline simulations thatrequired days to complete. The online profiling results are used atruntime to implement a simple software prefetching strategy thatachieves a speedup greater than 60% in the best case

From Traditional Adaptive Data Caching to Adaptive Context Caching: A Survey

Context data is in demand more than ever with the rapid increase in the development of many context-aware Internet of Things applications. Research in context and context-awareness is being conducted to broaden its applicability in light of many practical and technical challenges. One of the challenges is improving performance when responding to large number of context queries. Context Management Platforms that infer and deliver context to applications measure this problem using Quality of Service (QoS) parameters. Although caching is a proven way to improve QoS, transiency of context and features such as variability, heterogeneity of context queries pose an additional real-time cost management problem. This paper presents a critical survey of state-of-the-art in adaptive data caching with the objective of developing a body of knowledge in cost- and performance-efficient adaptive caching strategies. We comprehensively survey a large number of research publications and evaluate, compare, and contrast different techniques, policies, approaches, and schemes in adaptive caching. Our critical analysis is motivated by the focus on adaptively caching context as a core research problem. A formal definition for adaptive context caching is then proposed, followed by identified features and requirements of a well-designed, objective optimal adaptive context caching strategy.Comment: This paper is currently under review with ACM Computing Surveys Journal at this time of publishing in arxiv.or

Granite: A scientific database model and implementation

The principal goal of this research was to develop a formal comprehensive model for representing highly complex scientific data. An effective model should provide a conceptually uniform way to represent data and it should serve as a framework for the implementation of an efficient and easy-to-use software environment that implements the model. The dissertation work presented here describes such a model and its contributions to the field of scientific databases. In particular, the Granite model encompasses a wide variety of datatypes used across many disciplines of science and engineering today. It is unique in that it defines dataset geometry and topology as separate conceptual components of a scientific dataset. We provide a novel classification of geometries and topologies that has important practical implications for a scientific database implementation. The Granite model also offers integrated support for multiresolution and adaptive resolution data. Many of these ideas have been addressed by others, but no one has tried to bring them all together in a single comprehensive model. The datasource portion of the Granite model offers several further contributions. In addition to providing a convenient conceptual view of rectilinear data, it also supports multisource data. Data can be taken from various sources and combined into a unified view. The rod storage model is an abstraction for file storage that has proven an effective platform upon which to develop efficient access to storage. Our spatial prefetching technique is built upon the rod storage model, and demonstrates very significant improvement in access to scientific datasets, and also allows machines to access data that is far too large to fit in main memory. These improvements bring the extremely large datasets now being generated in many scientific fields into the realm of tractability for the ordinary researcher. We validated the feasibility and viability of the model by implementing a significant portion of it in the Granite system. Extensive performance evaluations of the implementation indicate that the features of the model can be provided in a user-friendly manner with an efficiency that is competitive with more ad hoc systems and more specialized application specific solutions

Traffic analysis of Internet user behavior and content demand patterns

El estudio del trafico de internet es relevante para poder mejorar la calidad de servicio de los usuarios. Ser capaz de conocer cuales son los servicios más populares y las horas con más usuarios activos permite identificar la cantidad de tráfico producido y, por lo tanto, diseñar una red capaz de soportar la actividad esperada. La implementación de una red considerando este conocimiento puede reducir el tiempo de espera considerablemente, mejorando la experiencia de los usuarios en la web. Ya existen análisis del trafico de los usuarios y de sus patrones de demanda. Pero, los datos utilizados en estos estudios no han sido renovados, por lo tanto los resultados obtenidos pueden estar obsoletos y se han podido producir cambios importantes. En esta tesis, se estudia la cantidad de trafico entrante y saliente producido por diferentes aplicaciones y se ha hecho una evolución teniendo en cuenta datos presentes y pasados. Esto nos permitirá entender los cambios producidos desde 2007 hasta 2015 y observar las tendencias actuales. Además, se han analizado los patrones de demanda de usuarios del inicio de 2016 y se han comparado con resultados previos. La evolución del tráfico demuestra cambios en las preferencias de los usuarios, a pesar de que los patrones de demanda siguen siendo los mismos que en años anteriores. Los resultados obtenidos en esta tesis confirman las predicciones sobre un aumento del tráfico de 'Streaming Media'; se ha comprobado que el tráfico de 'Streaming Media' es el tráfico total dominante, con Netflix como el mayor contribuidor.L'estudi del trànsit d'Internet és rellevant per a poder millor la qualitat de servei dels usuaris. Ser capaç de conèixer quins són els serveis més popular i les hores amb més usuaris actius permet identificar la quantitat de trànsit produït i, per tant, dissenyar una xarxa capaç de soportar la activitat esperada. L'implementació d'una xarxa considerant aquest coneixement pot reduir el temps d'espera considerablement, millorant l'experiència dels usuaris a la web. Ja existeixen anàlisis del transit dels usuaris i els seus patrons de demanda. Però, les dades utilitzades en aquests estudis no han sigut renovades, per tant els resultats obtinguts poden estar obsolets i s'han produït canvis importants. En aquesta tesis, s'estudia la quantitat de transit entrant i sortint produit per diferents aplicacions i s'ha fet una evolució, tenint en compte dades presents i passades. Això ens permetrà entendre els canvis produïts des de 2007 fins 2015 i observar les tendències actuals. A més, s'han analitzat els patrons de demanda de usuaris de principis de 2016 i s'han comparat amb resultats previs. L'evolució del trànsit mostra canvis en las preferències dels usuaris, en canvi els patrons de demanda continuen sent els mateixos que en anys posteriors. Els resultats obtinguts en aquesta tesis confirmen les prediccions sobre un augment del trànsit de 'Streaming Media'; s'ha comprovat que el trànsit de 'Streaming Media' es el trànsit total dominant, amb Netflix com el major contribuïdor.The study of Internet traffic is relevant in order to improve the quality of service of users. Being able to know which are the most popular services and the hours with most active users can let us identify the amount of inbound and outbound traffic produced, and hence design a network able to support the activity expected. The implementation of a network considering that knowledge can reduce the waiting time of users considerably, improving the users’ experience in the web. Analysis of users’ traffic and user demand patterns already exist. However, the data used in these studies is not renewed, thus the results found can be obsolete and considerable changes would have happened. In this bachelor’s thesis, it is studied the amount of inbound and outbound traffic produced considering different applications and the evolution when regarding previous and actual data has been taken into account. This would let us understand the changes produced from 2007 to 2015 and observe the tendencies nowadays. In addition, it has been analyzed the user demand patterns in the beginning of 2016 and it has been contrasted with previous results. The evolution of traffic has shown changes in users’ preferences, although their demand patterns are still the same as previous years. The results found in this thesis confirmed the expectations about an increase of streaming media Internet traffic; it was proved that streaming media traffic is the dominant total traffic, with Netflix as the major contributor

Patterns of Scalable Bayesian Inference

Datasets are growing not just in size but in complexity, creating a demand for rich models and quantification of uncertainty. Bayesian methods are an excellent fit for this demand, but scaling Bayesian inference is a challenge. In response to this challenge, there has been considerable recent work based on varying assumptions about model structure, underlying computational resources, and the importance of asymptotic correctness. As a result, there is a zoo of ideas with few clear overarching principles. In this paper, we seek to identify unifying principles, patterns, and intuitions for scaling Bayesian inference. We review existing work on utilizing modern computing resources with both MCMC and variational approximation techniques. From this taxonomy of ideas, we characterize the general principles that have proven successful for designing scalable inference procedures and comment on the path forward

On the classification and evaluation of prefetching schemes

Abstract available: p. [2

MobiQuery: A Spatiotemporal Query Service for Mobile Users in Sensor Networks

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically collect sensor data from the physical environment through wireless sensor networks. A salient feature of \MQ is that it can meet stringent spatiotemporal performance constraints, including query latency, data freshness, and changing areas of interest due to user mobility. We present three just-in-time prefetching protocols that enable MobiQuery to achieve desired spatiotemporal performance despite low node duty cycles, while significantly reducing communication overhead. We validate our approach through both theoretical analysis and extensive simulations under realistic settings including varying user movement patterns and location errors