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 16 of 16 for “"Irregular Graph"”.
-
Experiences in data-parallel simulation and analysis of complex systems with irregular graph structures : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand
… and artificial systems can be described using a graph. These graphs often have an irregular structure with non-trivial topological features. Complex system behaviour emerges on the macroscopic scale from a large number of relatively simple interactions on the microscopic scale. To better …
-
Properties of random graphs
… new results for several problems in random graph theory. The first problem relates to the uniform random graph model in the supercritical phase; i.e. a graph, uniformly distributed, on $n$ vertices and $M=n/2+s$ edges for $s=s(n)$ satisfying $n^{2/3}=o(s)$ and $s=o(n)$. The property studied …
-
Design and implementation of distributed Galois
… a solution to the hard problem of parallelizing irregular algorithms using amorphous data-parallelism. The present system works on the shared-memory programming model. The programming model has limitations on the memory and processing power available to the application. A scalable distributed …
-
HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD
… on transforming the execution paradigms of graph workloads through hardware–software co-design and algorithmic innovations. Graph applications are characterized by irregular memory access and sparse computation, which limit the efficiency of traditional processors across diverse deployment …
-
Intelligent scheduling for simultaneous CPU-GPU applications
… specialized accelerators has emerged recently. Graphics processing unit (GPU) is the most widely used accelerator. To fully utilize such a heterogeneous system’s full computing power, coordination between the two distinct devices, CPU and GPU, is necessary. Previous research has addressed this …
-
Data parallel algebraic multigrid
… we show that performance is severely limited by irregular sparse matrix operations, most notably sparse matrix-matrix multiplication. In the second phase, we address this performance bottleneck using novel techniques to optimize irregular sparse matrix operations. This dissertation is also …
-
Characterizing the Performance Bottlenecks of Irregular GPU Kernels
Graphics processing units (GPUs) are increasingly being used to accelerate general-purpose applications, including applications with data-dependent, irregular memory access patterns and control flow. However, relatively little is known about the behavior of irregular GPU codes, and there has been …
-
Efficient Computation Using Near-Memory Processing and High-Level Synthesis
… types of applications: data integration, irregular graph processing, and graph neural networks. Our work in efficient computing leverages Near-Memory Processing (NMP) with 3D-stacked memory and High-Level Synthesis (HLS) on Field-Programmable Gate Arrays (FPGAs) to accelerate these …
-
Innovative mining, processing, and application of big graphs
… advances in science and technology, big graph (or network) data, such as World Wide Web, social networks, academic collaboration networks, transportation networks, telecommunication networks, biological networks, and electrical networks, have grown at an astonishing rate in terms of …
-
Using Workload Characterization to Guide High Performance Graph Processing
Graph analytics represent an important application domain widely used in many fields such as web graphs, social networks, and Bayesian networks. The sheer size of the graph data sets combined with the irregular nature of the underlying problem pose a significant challenge for performance, …
-
Parallel pointer analysis for large-scale software
… this analysis, which is essentially an irregular graph algorithm. In general, pointer analysis comes in two styles: whole-program and demand-driven. Whole-program analysis, which computes the points-to information of all variables in a program, is often formulated as a graph-rewriting …
-
Efficient and secure message passing for machine learning
… unnoticeable perturbations in data. Meanwhile, graph is a kind of prevalent data structure for many real-world data that encodes pairwise relations between entities such as social networks, transportation networks, and chemical molecules. Graph neural networks (GNNs) generalize and extend the …
-
Monolithically Integrated SRAM-ReRAM Cache-Main Memory System
… circuitry and wiring disrupts the layouts of irregular logic like CPUs. Caches are very regular and composed of smaller subarrays, making them a better candidate to place beneath crosspoint subarrays. By co-designing the cache subarrays and ReRAM crosspoint subarrays, minimal disruption to the …
-
Enhancing Smart Grid Security and Reliability through Graph Signal Processing and Energy Data Analytics
… using various data-driven, machine learning, and graph signal processing (GSP) techniques. The presented work provides valuable insight into the data-driven analysis of the dynamics of cyber-physical power systems and contributes to the research regarding the security and reliability of smart …
-
Circuit architecture co-design for machine learning and 3D deep learning
… frequent access to large model parameters or irregular data structures. For example, in LLM inference, the decoding stage operates with small batch sizes, making the dominant operation matrix–vector multiplication (GEMV). This results in limited weight reuse and requires repeatedly loading …
-
Strategic Stochastic Coordination and Learning In Regular Network Games
… we examined the characteristics of both regular graphical coordination games and non-regular graphical games using this particular bi-matrix game model.