Runtime Fragility in Main Memory

نویسندگان

  • Endre Palatinus
  • Jens Dittrich
چکیده

In this paper we investigate the following problem: Given a database workload (tables and queries), which data layout (row, column or a suitable PAX-layout) should we choose in order to get the best possible performance? We show that this is not an easy problem. We explore careful combinations of various parameters that have an impact on the performance including: (1) the schema, (2) the CPU architecture, (3) the compiler, and (4) the optimization level. We include a CPU from each of the past 4 generations of Intel CPUs. In addition, we demonstrate the importance of taking variance into account when deciding on the optimal storage layout. We observe considerable variance throughout our measurements which makes it difficult to argue along means over different runs of an experiment. Therefore, we compute confidence intervals for all measurements and exploit this to detect outliers and define classes of methods that we are not allowed to distinguish statistically. The variance of different performance measurements can be so significant that the optimal solution may not be the best one in practice. Our results also indicate that a carefully or ill-chosen compilation setup can trigger a performance gain or loss of factor 1.1 to factor 25 in even the simplest workloads: a table with four attributes and a simple query reading those attributes. This latter observation is not caused by variance in the measured runtimes, but due to using a different compiler setup. Besides the compilation setup, the data layout is another source of query time fragility. Various size metrics of the memory subsystem are round numbers in binary, or put more simply: powers of 2 in decimal. System engineers have followed this tradition over time. Surprisingly, there exists a use-case in query processing where using powers of 2 is always a suboptimal choice, leading to one more cause of fragile query times. Using this finding, we will show how to improve tuple-reconstruction costs by using a novel main-memory data-layout.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessment of Structure-Specific Fragility Curves for Soft Storey Buildings Implementing IDA and SPO Approaches

Soft storey building is popular due to the functional and aesthetic purpose, despite its weakness in resisting seismic excitation. Nonlinear Static (Pushover) Analysis (POA) is a time saving and simple assessment procedure prosposed in Eurocode 8 (EC8). However, its reliability in designing structure still remains a question. At the first stage, seismic performance of several building models us...

متن کامل

Execution replay for an MPI-based multi-threaded runtime system

In this paper we present an execution replay system for Athapascan, an MPI-based multi-threaded runtime system. The main challenge of this work was to deal with nondeterministic features of MPI promiscuous communications and varying number of test functions without compromising the efficiency of an existing solution for execution replay of shared memory thread based programs. Novel solutions we...

متن کامل

A Comparison between Different Editions of API650 Seismic Provisions for Cylindrical Steel Storage Tanks Considering the Fragility Curves

Seismic safety of liquid storage tanks is of considerable importance due to its application in different industries. In Iran, most of these storage tanks are designed based on API650 code provisions. Despite designing tanks according to API standard, the lesson learned from previous earthquakes, shows different kind of damage occurring on them. This study is an investigation on evaluating diffe...

متن کامل

Advanced Optimizations for Parallel Irregular Out-of-Core Programs

Large scale irregular applications involve data arrays and other data structures that are too large to t in main memory and hense reside on disks. This paper presents a method for implementing this kind of applications on distributed-memory systems. The method is based on a runtime system that has been built on top of the CHAOS library.

متن کامل

Automatic Service Composition Based on Graph Coloring

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016