MulTe: A Multi-Tenancy Database Benchmark Framework

Multi-tenancy in relational databases has been a topic of interest for a couple of years. On the one hand, ever increasing capabilities and capacities of modern hardware easily allow for multiple database applications to share one system. On the other hand, cloud computing leads to outsourcing of many applications to service architectures, which in turn leads to offerings for relational databases in the cloud, as well. The ability to benchmark multi-tenancy database systems (MT-DBMSs) is imperative to evaluate and compare systems and helps to reveal otherwise unnoticed shortcomings. With several tenants sharing a MT-DBMS, a benchmark is considerably different compared to classic database benchmarks and calls for new benchmarking methods and performance metrics. Unfortunately, there is no single, well-accepted multi-tenancy benchmark for MT-DBMSs available and few efforts have been made regarding the methodology and general tooling of the process. We propose a method to benchmark MT-DBMSs and provide a framework for building such benchmarks. To support the cumbersome process of defining and generating tenants, loading and querying their data, and analyzing the results we propose and provide MULTE, an open-source framework that helps with all these steps

Leveraging Metadata for Computer Vision on Unmanned Aerial Vehicles

The integration of computer vision technology into Unmanned Aerial Vehicles (UAVs) has become increasingly crucial in various aerial vision-based applications. Despite the great significant success of generic computer vision methods, a considerable performance drop is observed when applied to the UAV domain. This is due to large variations in imaging conditions, such as varying altitudes, dynamically changing viewing angles, and varying capture times resulting in vast changes in lighting conditions. Furthermore, the need for real-time algorithms and the hardware constraints pose specific problems that require special attention in the development of computer vision algorithms for UAVs. In this dissertation, we demonstrate that domain knowledge in the form of meta data is a valuable source of information and thus propose domain-aware computer vision methods by using freely accessible sensor data. The pipeline for computer vision systems on UAVs is discussed, from data mission planning, data acquisition, labeling and curation, to the construction of publicly available benchmarks and leaderboards and the establishment of a wide range of baseline algorithms. Throughout, the focus is on a holistic view of the problems and opportunities in UAV-based computer vision, and the aim is to bridge the gap between purely software-based computer vision algorithms and environmentally aware robotic platforms. The results demonstrate that incorporating meta data obtained from onboard sensors, such as GPS, barometers, and inertial measurement units, can significantly improve the robustness and interpretability of computer vision models in the UAV domain. This leads to more trustworthy models that can overcome challenges such as domain bias, altitude variance, synthetic data inefficiency, and enhance perception through environmental awareness in temporal scenarios, such as video object detection, tracking and video anomaly detection. The proposed methods and benchmarks provide a foundation for future research in this area, and the results suggest promising directions for developing environmentally aware robotic platforms. Overall, this work highlights the potential of combining computer vision and robotics to tackle real-world challenges and opens up new avenues for interdisciplinary research

Pairwise Element Computation with MapReduce

In this paper, we present a parallel method to evaluate functions on pairs of elements. It is a challenge to partition the Cartesian product of a set with itself in order to parallelize the function evaluation on all pairs. Our solution uses (a) replication of set elements to allow for partitioning and (b) aggregation of the results gathered for different copies of an element. Based on an execution model with nodes that execute tasks on local data without online communication, we present a generic algorithm and show how it can be implemented with MapReduce. Three different distribution schemes that define the partitioning of the Cartesian product are introduced, compared, and evaluated. Any one of the distribution schemes can be used to derive and implement a specific algorithm for parallel pairwise element computation

Scalable frequent itemset mining on many-core processors

Frequent-itemset mining is an essential part of the association rule mining process, which has many application areas. It is a computation and memory intensive task with many opportunities for optimization. Many efficient sequential and parallel algorithms were proposed in the recent years. Most of the parallel algorithms, however, cannot cope with the huge number of threads that are provided by large multiprocessor or many-core systems. In this paper, we provide a highly parallel version of the well-known Eclat algorithm. It runs on both, multiprocessor systems and many-core coprocessors, and scales well up to a very large number of threads---244 in our experiments. To evaluate mcEclat's performance, we conducted many experiments on realistic datasets. mcEclat achieves high speedups of up to 11.5x and 100x on a 12-core multiprocessor system and a 61-core Xeon Phi many-core coprocessor, respectively. Furthermore, mcEclat is competitive with highly optimized existing frequent-itemset mining implementations taken from the FIMI repository

The role of memory-dependent friction and solvent viscosity in isomerization kinetics in viscogenic media

Molecular isomerization kinetics in liquid solvent depends on a complex interplay between the solvent friction acting on the molecule, internal dissipation effects (also known as internal friction), the viscosity of the solvent, and the dihedral free energy profile. Due to the absence of accurate techniques to directly evaluate isomerization friction, it has not been possible to explore these relationships in full. By combining extensive molecular dynamics simulations with friction memory-kernel extraction techniques we consider a variety of small, isomerising molecules under a range of different viscogenic conditions and directly evaluate the viscosity dependence of the friction acting on a rotating dihedral. We reveal that the influence of different viscogenic media on isomerization kinetics can be dramatically different, even when measured at the same viscosity. This is due to the dynamic solute-solvent coupling, mediated by time-dependent friction memory kernels. We also show that deviations from the linear dependence of isomerization rates on solvent viscosity, which are often simply attributed to internal friction effects, are due to the simultaneous violation of two fundamental relationships: the Stokes-Einstein relation and the overdamped Kramers prediction for the barrier-crossing rate, both of which require explicit knowledge of friction

pcApriori: Scalable apriori for multiprocessor systems

Frequent-itemset mining is an important part of data mining. It is a computational and memory intensive task and has a large number of scientific and statistical application areas. In many of them, the datasets can easily grow up to tens or even several hundred gigabytes of data. Hence, efficient algorithms are required to process such amounts of data. In the recent years, there have been proposed many efficient sequential mining algorithms, which however cannot exploit current and future systems providing large degrees of parallelism. Contrary, the number of parallel frequent-itemset mining algorithms is rather small and most of them do not scale well as the number of threads is largely increased. In this paper, we present a highly-scalable mining algorithm that is based on the well-known Apriori algorithm; it is optimized for processing very large datasets on multiprocessor systems. The key idea of pcApriori is to employ a modified producer--consumer processing scheme, which partitions the data during processing and distributes it to the available threads. We conduct many experiments on large datasets. pcApriori scales almost linear on our test system comprising 32 cores

Conformational isomerization dynamics in solvent violates both the Stokes-Einstein relation and Kramers' theory

Molecular isomerization kinetics in liquid solvents are determined by a complex interplay between the friction acting on a rotating dihedral due to interactions with the solvent, internal dissipation effects (also known as internal friction), the viscosity of the solvent, and the free energy profile over which a dihedral rotates. Currently, it is not understood how these quantities are related at the molecular scale. Here, we combine molecular dynamics simulations of isomerizing n-alkane chains and dipeptide molecules in mixed water-glycerol solvents with memory-kernel extraction techniques to directly evaluate the frequency-dependent friction acting on a rotating dihedral. We extract the friction and isomerization times over a range of glycerol concentrations and accurately evaluate the relationships between solvent viscosity, isomerization kinetics, and dihedral friction. We show that the total friction acting on a rotating dihedral does not scale linearly with solvent viscosity, thus violating the Stokes-Einstein relation. Additionally, we demonstrate that the kinetics of isomerization are significantly faster compared to the Kramers prediction in the overdamped limit. We suggest that isomerization kinetics are determined by the multi-time-scale friction coupling between a rotating dihedral and its solvent environment, which results in non-Markovian kinetic speed-up effects.Comment: 9 pages, 4 figure

ERIS live: A NUMA-aware in-memory storage engine for tera-scale multiprocessor systems

The ever-growing demand for more computing power forces hardware vendors to put an increasing number of multiprocessors into a single server system, which usually exhibits a non-uniform memory access (NUMA). In-memory database systems running on NUMA platforms face several issues such as the increased latency and the decreased bandwidth when accessing remote main memory. To cope with these NUMA-related issues, a DBMS has to allow flexible data partitioning and data placement at runtime. In this demonstration, we present ERIS, our NUMA-aware in-memory storage engine. ERIS uses an adaptive partitioning approach that exploits the topology of the underlying NUMA platform and significantly reduces NUMA-related issues. We demonstrate throughput numbers and hardware performance counter evaluations of ERIS and a NUMA-unaware index for different workloads and configurations. All experiments are conducted on a standard server system as well as on a system consisting of 64 multiprocessors, 512 cores, and 8 TBs main memory

The role of hydrogen in a greenhouse gas-neutral energy supply system in Germany

Hydrogen is widely considered to play a pivotal role in successfully transforming the German energy system, but the German government\u27s current “National Hydrogen Strategy” does not specify how hydrogen utilization, production, storage or distribution will be implemented. Addressing key uncertainties for the German energy system\u27s path to greenhouse gas-neutrality, this paper examines hydrogen in different scenarios. This analysis aims to support the concretization of the German hydrogen strategy. Applying a European energy supply model with strong interactions between the conversion sector and the hydrogen system, the analysis focuses on the requirements for geological hydrogen storages and their utilization over the course of a year, the positioning of electrolyzers within Germany, and the contributions of hydrogen transport networks to balancing supply and demand. Regarding seasonal hydrogen storages, the results show that hydrogen storage facilities in the range of 42 TWhH2 to 104 TWhH2 are beneficial to shift high electricity generation volumes from onshore wind in spring and fall to winter periods with lower renewable supply and increased electricity and heat demands. In 2050, the scenario results show electrolyzer capacities between 41 GWel and 75 GWel in Germany. Electrolyzer sites were found to follow the low-cost renewable energy potential and are concentrated on the North Sea and Baltic Sea coasts with their high wind yields. With respect to a hydrogen transport infrastructure, there were two robust findings: One, a domestic German hydrogen transport network connecting electrolytic hydrogen production sites in northern Germany with hydrogen demand hubs in western and southern Germany is economically efficient. Two, connecting Germany to a European hydrogen transport network with interconnection capacities between 18 GWH2 and 58 GWH2 is cost-efficient to meet Germany\u27s substantial hydrogen demand

A review of volatiles in the Martian interior

Multiple observations from missions to Mars have revealed compelling evidence for a volatile-rich Martian crust. A leading theory contends that eruption of basaltic magmas was the ultimate mechanism of transfer of volatiles from the mantle toward the surface after an initial outgassing related to the crystallization of a magma ocean. However, the concentrations of volatile species in ascending magmas and in their mantle source regions are highly uncertain. This work and this special issue of Meteoritics & Planetary Science summarize the key findings of the workshop on Volatiles in the Martian Interior (Nov. 3–4, 2014), the primary open questions related to volatiles in Martian magmas and their source regions, and the suggestions of the community at the workshop to address these open questions