Data Storage Systems Commons^™

Virtualized And Distributed Neighborhood Data Centers, Benjamin T. Niccum

Computer Science and Engineering Theses

This thesis evaluates whether PCIe-fabric-based resource pooling can support a decentralized neighborhood micro-data-center model under real implementation constraints. The work combines architecture design, prototype deployment, performance benchmarking, and security assessment. Results show strong prototype-scale feasibility with low-latency and high-throughput behavior, while also identifying deployment-blocking security gaps and operational maturity requirements. The thesis contributes an evidence-traceable path from concept validation to deployment-grade roadmap planning.

Enhancing The Performance Of Disk-Based Key-Value Stores: From Learned Index Acceleration To I/O-Efficient Hybrid Caching, Sujit Maharjan

Computer Science and Engineering Dissertations - Archive

The exponential growth of data in modern computing environments has rendered the efficient extraction of information from massive datasets a critical systemic requirement. Key-value (KV) storage systems serve as the backbone for these operations; however, their performance is consistently bottlenecked by two primary functional requirements: identifying the data's location and managing the physical cost of accessing the storage device. Data locations are typically identified via an index, while disk I/O is minimized through caching. This dissertation presents LearnedStore, TurboIndex, and ReadBooster, which break these performance bottlenecks by introducing architectural modifications to the index and cache. LearnedStore accelerates operations by adapting …

Towards Application-Driven Optimal Memory And Storage Management, Venkata Naga Prajwal Challa

Computer Science and Engineering Dissertations

Modern computing systems increasingly run on diverse hardware platforms and support applications with widely different access patterns, performance goals, and data lifecycles. In this setting, traditional one-size-fits-all approaches to memory and storage management are often inefficient because they apply fixed policies regardless of application behavior, workload context, or hardware asymmetry. Such generic designs can lead to unnecessary data movement, wasted bandwidth, excessive rewriting, poor resource utilization, and degraded user-perceived performance. This dissertation is motivated by the view that optimal memory and storage management should be application-driven: instead of treating all data uniformly, systems should adapt their decisions to how applications …

Turboindex: Making A Page-Based Db Index Both Memory-Space And Disk-I/O Efficient, Sujit Maharjan, Shuaihua Zhao, Song Jiang

Computer Science and Engineering Faculty Publications - Archive

Traditional Database (DB) systems use a DB buffer, a page-based cache management system, to load data and indexes from block storage devices into byte-addressable main memory. However, this approach is inefficient in terms of space and I/O when key-value pair sizes are significantly smaller than the page size. Inserting a single key-value pair results in reading and writing an entire page, consuming a full page's worth of memory in the buffer. Moreover, the entire page is immediately loaded even when just a single key-value pair is inserted into the page. Also, an infrequently accessed page is likely to be evicted …

Development Of A Cost-Effective Daq For Measuring Brake Performance In Race Cars, Adrin Alias

2025 Spring Honors Capstone Projects - Archive

This project explores the feasibility of creating a cost-effective data acquisition (DAQ) system for high-speed, real-time brake performance testing of Formula SAE racecars. The research addresses the limitations of the current MoTeC DAQ system currently employed by the team, which is costly and time-consuming to set up for on-car testing. The team will use a brake dynamometer for steady-state comparisons of different brake pad compounds (senior design project), but evaluating real-world performance requires on-car testing. By systematically comparing various hardware platforms, sensors, communication protocols, and storage solutions, this project aims to balance cost-efficiency with reliability and performance. The research evaluates …

A Data Driven Approach To Student Success: Visualizing Engagement And Performance Metrics, Araohat Kokate

2025 Spring Honors Capstone Projects - Archive

Many tutoring centers lack tools to analyze and visualize key performance metrics, limiting data driven decision making. This study develops a data visualization feature for the CSE Student Success Center App at the University of Texas at Arlington, enabling administrators to track student engagement, tutor performance and session trends. Using the data of students and tutors, the feature provides interactive dashboards for real-time insights. Administrators can monitor attendance patterns, tutor workloads and booking trends, optimizing resource allocation. Findings indicate that real-time data visualization enhances decision-making, reducing manual effort while improving operational efficiency. This can further help improve student support services. …

Methods Of Optimizing Storage And Retrieval Of Structured Data, Neelim Haider

Computer Science and Engineering Theses - Archive

Storing and retrieving large amounts of data reliably is becoming more and more important as time goes on. There are high demands to store highly personal information such as social security numbers, bank account information, and residence information to rapidly changing data such as employee information, inventory information, and stock information. Therefore, the ability of a system to store, remove, and update such information efficiently and correctly is critical. There are different types of data that database systems can potentially hold: structured, unstructured, and semistructured data. Various database models have been developed to provide a framework that allows designers to …

Diversity-Driven Xor Secret Sharing: Reliable And Secure Multi-Path Transmission, Richard M. Olu Jordan

Computer Science and Engineering Theses - Archive

The growing reliance on distributed storage and multipath communication sys- tems has intensified the need for security mechanisms that remain robust even when individual nodes or channels are compromised. Secret sharing provides an information- theoretic approach to achieving both confidentiality and availability, and XOR-based constructions in particular offer lightweight and highly structured designs. This thesis develops a unified analytical framework for understanding and evalu- ating XOR-based secret sharing schemes across multiple operational settings, includ- ing plaintext storage, encrypted-data scenarios, and noisy binary symmetric chan- nels (BSCs). Building on a general (t, n) system model, we examine five threshold configurations—(2, 3), …

An Slo-Aware, Multi-Pronged Approach To Enhancing Resource And Energy Efficiency In Server Applications, Ning Li

Computer Science and Engineering Dissertations - Archive

Server applications operating in oversubscribed cloud environments face the dual challenges of meeting strict Quality-of-Service (QoS) requirements and improving resource and energy efficiency. As the number of user connections and workload diversity continue to grow, existing scheduling mechanisms struggle to balance QoS guarantees, fairness, resource efficiency, and power consumption. This dissertation presents a unified, cross-layer framework to address these challenges through three key contributions: AppleS, UTSLO, and REEF.

First, we propose AppleS, a user-space QoS-aware fine-grained I/O scheduling framework that delivers fair and efficient service to concurrent client connections. AppleS introduces a QoS-centric metric that guides admission control and scheduling …

Exploring Emerging Memory Technologies For Enhancing Data Center Applications, Zhen Lin

Computer Science and Engineering Dissertations - Archive

The rapid evolution of memory and storage technologies is fundamentally reshaping the design of operating systems and data management. Emerging devices such as persistent memory, NVMe SSDs, and Compute Express Link (CXL)--enabled hybrid memory modules introduce new opportunities for high-performance, cost-efficient data management, yet they also expose limitations in traditional software abstractions. File systems, originally designed for slow block-based devices, incur excessive overhead on ultra-low-latency media, while block-level caches suffer from metadata and eviction inefficiencies. Moreover, hardware-managed tiering provides transparency but restricts adaptability across workloads. These challenges highlight the need to rethink caching and tiered memory management across multiple system …

Optimizing Architecture And Software For Next-Generation Memory Systems, Lingfeng Xiang

Computer Science and Engineering Dissertations - Archive

The rapid advancement of memory technologies presents new challenges and opportunities for system software and architectural design. This dissertation investigates how to optimize modern computing systems for next-generation memory, mostly focusing on persistent memory and Compute Express Link (CXL)-based memory. First, we conduct a detailed characterization of Intel Optane DC Persistent Memory, identifying the distinct behaviors of its on-DIMM read and write buffers and analyzing their impact on application performance. These insights motivate optimizations that decouple read and write paths, revealing that random read latency—especially in pointer-chasing workloads—is a dominant performance bottleneck. Second, we present NOMAD, a page management framework …

Breaking Granularity Barriers: Overcoming I/O Abstraction Limitations For High-Performance Storage Systems, Chen Zhong

Computer Science and Engineering Dissertations - Archive

Modern storage hierarchies exhibit performance differences spanning eight orders of magnitude. Each tier in the hierarchy presents fundamentally different optimal access sizes and patterns. Most systems read and write data in fixed-size units across different tiers, typically power-of-2 sizes. It simplifies data management but also suffers from large write amplification when handling small accesses in many real-world workloads. This fundamental disconnect between fixed-size I/O design assumption and real-world usage patterns represents the core challenge.

The storage community has recognized the limitations of fixed-size I/O abstractions and is exploring alternatives, like the new emerging NVMe-KV interface and object-based storage, which aim …

Exploring Smart Thermostat, Don P. Dang

2024 Fall Honors Capstone Projects - Archive

This study examines the security, privacy, and compatibility challenges associated with smart thermostats in smart home systems. Smart thermostats, as part of the growing Internet of Things (IoT) ecosystem, face vulnerabilities such as unauthorized access, data breaches, and inconsistent security protocols. Using a mixed-methods approach, this research evaluates encryption techniques, communication protocols (Zigbee, Z-Wave, Wi Fi), and user behaviors that impact system security and efficiency. Key findings indicate that 35% of users are concerned about hacking risks, while 25% express data privacy concerns. Many users lack awareness of security measures, such as firmware updates and password management, which increases vulnerabilities. …

Adaptive Load-Aware Elastic Data Reduction And Re-Computation For Adaptive Mesh Refinement, Mengxiao Wang

Computer Science and Engineering Theses - Archive

The increasing performance gap between computation and I/O creates huge data management challenges for simulation-based scientific discovery. Data reduction, among others, is deemed to be a promising technique to bridge the gap through reducing the amount of data migrated to persistent storage. However, the reduction performance is still far from what is being demanded from production applications. To this end, we propose a new methodology that aggressively reduces data despite the substantial loss of information, and re-computes the original accuracy on-demand. As a result, our scheme creates an illusion of a fast and large storage medium with the availability of …

From Leanstore To Learnedstore: Using A Learned Index To Improve Database Index Search, Sujit Maharjan

Computer Science and Engineering Faculty Publications - Archive

In the realm of database systems, optimizing B+-tree index performance is of paramount importance to overall database performance. LeanStore, a high-performance OLTP storage engine, has extensively optimized its in-memory B+-tree component as well as its B+-tree -indexed database on the disk. However, B+-tree's lookup time increases linearly with the tree height. This is especially problematic when all or part of its lookup path is on the disk. Recently proposed learned index technique has the potential to significantly improve the performance of the B+-tree -based index by predicting location of the search key, instead of the level-by-Ievel path walk. However, this …