Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"data layout"”.
-
A Data Layout Descriptor Language (LADEL).
<p>To transfer data between devices and main memory, standard C block I/O interfaces use block buffers of type char. C++ programs that perform block I/O commonly use typecasting to move data between structures and block buffers. The subject of this thesis, the layout description language (LADEL), …
-
Data layout transformation through in-place transposition
… It has also been used to convert the storage layout of arrays. Intuitively, in-place transposition should be a good fit for GPU architectures due to limited available on-board memory capacity and high throughput. However, direct application of in-place transposition algorithms from CPU lacks …
-
Query execution in column-oriented database systems
… obvious ways to map a two-dimension relational database table onto a one-dimensional storage interface: store the table row-by-row, or store the table column-by-column. Historically, database system implementations and research have focused on the row-by row data layout, since it performs best …
-
Efficient memory and GPU operations for Tiramisu compiler
… high performance requires complex schedules and data layout transformations which might not be easy to express in a low level language. TIRAMISU [3] is an optimization framework for generating efficient code for different platforms including CPU, GPU, and distributed systems. It combines the …
-
Spatial software pipelining on distributed architectures for sparse matrix codes
… has gone towards the ensuing problem of optimal data layout in memory and instruction placement, but the problem is so large that some aspects have yet to be addressed. This thesis presents spatial software pipelining, a new mechanism for doing data layout and instruction placement for loops. …
-
Optimization of Data Accesses for Database Applications
… dissertation proposes Hanuman, which reformats data dynamically in the database buffer. By adapting data layouts to the changing workload, Hanuman improves the data spatial locality and the processor cache hit ratio accordingly. To determine the best data layout, Hanuman conducts the heuristic …
-
Automatic Performance Optimization of Stencil Codes
… codes. Their general structure is very simple: data points in a large grid are repeatedly recomputed from neighboring values. This predefined neighborhood is the so-called stencil. Despite their very simple structure, stencil codes are hard to optimize since only few computations are performed …
-
Scheduling policies for disks and disk arrays
… annually in the random access time to small data blocks on the disk. Such accesses are very common in OLTP applications, which tend to have stringent response time requirements. Scheduling of disk requests is intended to improve their response time, reduce disk service time, and increase disk …
-
Second-generation polyalgorithms for parallel dense-matrix multiplication
… algorithm as a function of problem size, shape, data layout, concurrency, and architecture. We integrate these algorithms with an intra-node BLAS DGEMM kernel designed by Thomas Hines (Tennessee Tech), which improves the BLAS DGEMM performance in fat-by-thin dense matrix multiplication region. We …
-
Enhancing Cloud Database Performance: General-Purpose Compression and Workload-Driven Layout
Cloud-based disaggregated database systems that divide data across a data layer and a storage layer connected by network calls are popular for analytical query loads. This thesis explores two topics critical to building performant systems of this type: space optimization and latency minimization. …
-
Utilizing Hierarchical Clusters in the Design of Effective and Efficient Parallel Simulations of 2-D and 3-D Ising Spin Models
… topological network. We consider different data layouts and provide equations for choosing the best data layout under such a network paradigm. We show that the data layouts designed for a homogeneous cluster will not yield results as good as layouts designed for a hierarchical cluster. We …
-
ClusterRAID: Architecture and Prototype of a Distributed Fault-Tolerant Mass Storage System for Clusters
… overall reliability. In addition, the applied data layout considers the access behaviour of a broad range of applications and minimizes the number of required network transactions. Extensive measurements and functionality tests of the prototype, both stand-alone and in conjunction with local or …
-
Performance analysis and optimization of a CFD application
… copies in heterogeneous execution, the data layout of the halo region was changed from a ''star'' shape to a ''box'' shape to agglomerate small communications and to create a larger work granularity. Preliminary results of running PlasComCM on Intel Xeon Phis in symmetric mode are also …
-
PFHE: partially homomorphic encryption on CNN inference
… (FHE) enables secure computation on encrypted data, but its high computational overhead poses significant challenges for practical deep learning inference. In many application scenarios, high-resolution images may only contain a small portion of sensitive information. We noticed that none of …
-
Towards A Practical High-Assurance Systems Programming Language
… control the memory representation of algebraic data types, while retaining the automatic proof with a data layout refinement calculus. We repurpose existing tools in a novel way and develop an intuitive foreign function interface, which provides users a seamless experience when using Cogent in …
-
Common-case optimized memory hierarchy for data centers and HPC systems
… up to 40% to 70% of total system power in future data centers and high performance computing (HPC) systems; as such, it is time to rethink memory system designs. Conventional memory system designs in existing systems often seek to provide uniform performance across time and space. While this …
-
Algorithms for Data Migration
… thesis is concerned with the problem related to data storage and management. A large storage server consists of several hundreds of disks. To balance the load across disks, the system computes data layouts that are typically adjusted according to the workload. As workloads change over time, the …
-
Estimating Plot-Level Forest Biophysical Parameters Using Small-Footprint Airborne Lidar Measurements
… to facilitate the use of small-footprint lidar data for estimating forest biophysical parameters measuring individual trees identifiable on the three-dimensional lidar surface. This study derived the digital terrain model from lidar data using an iterative slope-based algorithm and developed …
-
Near-Memory Processing for Low-precision Deep Neural Networks
… accuracy. However, they are compute-heavy and data-intensive which makes deploying them on resource-constrained edge devices challenging. Transforming the real-valued parameters of a DNN into a minimised-bit-width approximated version through quantising or binarising lowers their accuracy to an …
-
Exploiting Multigrain Parallelism in Pairwise Sequence Search on Emergent CMP Architectures
… the realm of bioinformatics, the size of genomic databases is doubling every 12 months, and hence the need for novel approaches to parallelize sequence search algorithms has become increasingly important. This thesis puts a significant step forward in bridging the gap between software and hardware …
Page 1 of 2