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 10 of 10 for “"Data shuffling"”.
-
Benchmarking and Optimizations of Data Shuffling on High-performance Networks
For handling large scale data communication spanning gigabytes per second, Remote Direct Memory Access (RDMA) technology is significant. InfiniBand (IB) is a widely used RDMA point-to-point interconnect whose full potential can be realized using the most efficient networking library. In this thesis …
-
Efficient Data Management and Processing in Big Data Applications
In today's Big Data applications, huge amount of data are being generated. With the rapid growth of data amount, data management and processing become essential. It is important to design efficient approaches to manage and process data. In this thesis, data management and processing are …
-
Empirical Evaluation Of Parallelizing Correlation Algorithms For Sequential Telecommunication Devices Data
… devices within IoT is a source of generating big data. The data measured from devices consists of large number of features from hundreds to thousands. Analyzing these features is both data and computing intensive. Distributed and parallel processing frameworks such as Apache Spark provide …
-
Streaming Data Algorithm Design for Big Trajectory Data Analysis
… consist of large volumes of time-stamped spatial data that are constantly generated from diverse and geographically distributed sources. Discovery of traveling patterns on trajectory streams such as gathering and companies needs to process each record when it arrives and correlates across multiple …
-
Permutation in regression revisited: the residual route proven optimal theoretically
… face a confusing menu of residual- and raw-data shuffling schemes, with little theory to guide the choice. We develop the first closed-form, finite-sample comparison of six widely used permutation strategies for a coefficient of interest in the presence of nuisance covariates. We derive …
-
Fundamental Information-Theoretic Limits of Distributed Information Retrieval and Processing
… processing and retrieval systems, in which the data is partitioned, stored, and processed across distributed machines/workers. In our research, we propose practical solutions leveraging tools from information and coding theory. In large-scale systems, there are several challenges in moving …
-
Vector processor virtualization: distributed memory hierarchy and simultaneous multithreading
Taking advantage of DLP (Data-Level Parallelism) is indispensable in most data streaming and multimedia applications. Several architectures have been proposed to improve both the performance and energy consumption for such applications. Superscalar and VLIW (Very Long Instruction Word) processors, …
-
Data access pattern protection in cloud storage
… utilized cloud storage servers to host their data. However, because of security and privacy concerns, not all data can be outsourced without reservation. The concerns are rooted from the users' loss of data control from their hands to the cloud servers' premise and the infeasibility for them …
-
Information-Theoretic Foundations Of Machine Learning: Fundamental Limits And Optimal Algorithms
… combining tournament-based selection with heap data structures to attain near-linear runtime. Extensive experiments validate the theoretical predictions and demonstrate that the proposed algorithm significantly outperforms state-of-the-art active and passive ranking methods across different …
-
Tunable Volatile and Multi-bit Non-volatile Resistive Memory for Neuromorphic Computing Applications
… computing paradigm, to compute a function, data from memory needs to be transferred to the processor and upon processing the data, results need to move back to memory again to complete the computation. This data movement process consumes a significant amount of energy. Moreover, the …