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 61 for “"data layout"”.

  1. A Data Layout Descriptor Language (LADEL).

    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), …

    etsu Repository record for A Data Layout Descriptor Language (LADEL). (opens in a new tab) Download PDF for A Data Layout Descriptor Language (LADEL). (opens in a new tab)

  2. Automatic data layout for distributed memory machines

    … model. Besides the algorithm selection, the data layout choice is the key intellectual challenge in writing an efficient program in such languages. The performance of a data layout depends on the target compilation system, the target machine, the problem size, and the number of available …

    rice Repository record for Automatic data layout for distributed memory machines (opens in a new tab)

  3. 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 …

    uiuc Repository record for Data layout transformation through in-place transposition (opens in a new tab)

  4. Static Cost Estimation for Data Layout Selection on GPUs

    … computer systems and architectures. For many data-intensive applications, high-latency memory accesses often dominate execution time. Thus, performance modeling for memory accesses on high performance architectures has become an important research topic. The data layout of an application …

    rice Repository record for Static Cost Estimation for Data Layout Selection on GPUs (opens in a new tab)

  5. Data Layout Recommendation for Big Data Systems via Large Language Models

    The physical layout of data is critical to the performance of analytical queries, especially in column-store systems like IBM Db2. Among layout strategies, Z-ordering is a popular technique that maps multi-dimensional data to a one-dimensional space while preserving locality. However, tuning …

    york Repository record for Data Layout Recommendation for Big Data Systems via Large Language Models (opens in a new tab)

  6. Design of a data layout and memory access abstraction layer for heterogeneous architectures

    … and generally require full control over data layout, memory access, storage format, memory allocation, and physical memory location. These aspects are ideally decoupled from a program and its data structures, and unified into a coherent zero-overhead abstraction layer. By abstracting …

    qucosa-diss

  7. Concentric Layout, A New Scientific Data Layout For Matrix Data Set In Hadoop File System

    The data generated by scientific simulation, sensor, monitor or optical telescope has increased with dramatic speed. In order to analyze the raw data speed and space efficiently, data preprocess operation is needed to achieve better performance in data analysis phase. Current research shows an …

    ucf Repository record for Concentric Layout, A New Scientific Data Layout For Matrix Data Set In Hadoop File System (opens in a new tab)

  8. Locality Transformations of Computation and Data for Portable Performance

    … from locality transformations of computation and data that require minimal programmer effort. We establish this thesis by addressing three specific problems — tile size selection, data layout optimization and automatic selection of distribution functions. Tile size selection and data layout …

    rice Repository record for Locality Transformations of Computation and Data for Portable Performance (opens in a new tab)

  9. Robust Acceleration of Data-Centric Applications using Resistive Computing Systems

    With the accessible data reaching zettabyte level, CMOS technology is reaching its limit for the data hungry applications. Moore's law has been reaching its depletion in recent studies. On the other hand, von Neumann architecture is approaching the bottleneck due to the data movement between the …

    ucf Repository record for Robust Acceleration of Data-Centric Applications using Resistive Computing Systems (opens in a new tab)

  10. Portable Programming Models for Heterogeneous Platforms

    … poses severe programming challenges in terms of data layout, memory coherence, task partitioning, data distribution, and sharing of virtual addresses. Existing high-level programming languages are inadequate to address these new architectural features since they lack the necessary abstractions to …

    rice Repository record for Portable Programming Models for Heterogeneous Platforms (opens in a new tab)

  11. A strategy for high performance in computational fluid dynamics

    … Fundamental to the strategy is a hierarchical data layout made of small cubical structures of the problem state called the briquettes. The difficulties in computing the spatial derivatives (also called near neighbor computations in the literature) in a hierarchical data layout are well known, …

    umn Repository record for A strategy for high performance in computational fluid dynamics (opens in a new tab)

  12. Scene Graph Memory Management

    … becoming increasingly important to consider the layout of applications’ working set data in memory to make effective use of cache memories and avoid performance bottlenecks from memory latency. This thesis studies the effects of data layout on scene graphs, a common data structure for organising …

    chalmers Repository record for Scene Graph Memory Management (opens in a new tab)

  13. 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 …

    uiuc Repository record for Optimization of Data Accesses for Database Applications (opens in a new tab)

  14. 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 …

    njit Repository record for Scheduling policies for disks and disk arrays (opens in a new tab)

  15. Understanding and Improving Database-Backed Applications

    … like Java, Python or Ruby, and the back-end database that accepts SQL queries. Latency is critical for these applications. However, our study shows that many open-source web applications suffer from serious performance issues, with many slow pages as well as pages whose generation time scales …

    washington Repository record for Understanding and Improving Database-Backed Applications (opens in a new tab)

  16. Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases

    Graph database management systems (GDBMSs) are increasingly used to support traversal-heavy workloads. Graph queries often follow data-dependent paths through the graph, producing irregular or non-sequential accesses that do not align with the storage hierarchy, from data layout on disk to …

    waterloo Repository record for Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases (opens in a new tab)

  17. 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 …

    utc Repository record for Second-generation polyalgorithms for parallel dense-matrix multiplication (opens in a new tab)

  18. Exploiting Image Resolution Holistically in Computer Vision Models

    … topics such as object scale (as introduced by data augmentations), image storage (including methods for efficient multi-resolution storage), and deep learning kernel tuning. An understanding of these topics allows us to consider resolution with respect to deep learning choices holistically, …

    washington Repository record for Exploiting Image Resolution Holistically in Computer Vision Models (opens in a new tab)

  19. Adaptive Fluid Simulation Using a Linear Octree Structure

    … to reducing the level of indirection in the data, because our linear octree is stored contiguously in memory as a simple C array rather than a recursive set of pointers, we provide a more cache-friendly data layout than a traditional octree. In our testing, our approach yielded run-times that …

    byu Repository record for Adaptive Fluid Simulation Using a Linear Octree Structure (opens in a new tab) Download PDF for Adaptive Fluid Simulation Using a Linear Octree Structure (opens in a new tab)

Page 1 of 4