Searcharxiv⌕ Search

arXiv subjects

Daniel Grosu

Publications and source records attributed to Daniel Grosu.

3 recordsLinked to original sources

A Parallel Greedy Algorithm for Maximal b-Matching in Hypergraphs

We present \parallelBatchBMatch, a parallel batch-vote algorithm for maximal $b$-matching in hypergraphs. The algorithm is deterministic for a given ordering of edges and produces the same output as the sequential greedy algorithm, i.e., the lexicographically first maximal $b$-matching. Under a uniformly random priority order it performs $O(m')$ expected work in the binary fork--join model, where $m'$ is the number of pins, the total number of vertex--edge incidences. The algorithm performs at most $m$ rounds for every priority order, where $m$ is the number of edges. Every round of the algorithm has $O(\log^2 m')$ depth with high probability, and thus the total depth of the algorithm is $O(m \log^2 m')$ with high probability. We implement the parallel algorithm in CUDA and evaluate it on real-world hypergraphs with capacities $b \in \{1, 3, 5\}$. The parallel algorithm computes the same matchings as the greedy algorithms and for the case of $b = 5$ it is up to $19.07$ times faster than the existing state-of-the art greedy algorithm.

cs.DS↗

Speeding-up Graph Algorithms via Clique Partitioning

Reducing the running time of graph algorithms is vital for tackling real-world problems such as shortest paths and matching in large-scale graphs, where path information plays a crucial role. To address this critical challenge, this paper introduces a graph restructuring algorithm that identifies bipartite cliques and replaces them with tripartite graphs. This restructuring leads to fewer edges while preserving complete graph path information, enabling the direct application of algorithms like matching and all-pairs shortest paths to achieve significant runtime reductions, especially for large, dense graphs. The running time of the proposed algorithm for a graph $G(V,E)$, with $|V| = n$ and $|E| = m$ is~$O(mn^δ)$, which is better than $O(mn^δ\log^2 n)$, the running time of the best existing algorithm for speeding-up other graph algorithms (the Feder-Motwani (\textsf{FM}) algorithm), where $0 \leq δ\leq 1$. Both the \textsf{FM} algorithm and the proposed algorithm are originally formulated for bipartite graphs, but can also be applied to general directed or undirected graphs. Our extensive experimental analysis demonstrates that the proposed algorithm achieves up to 21.26\% higher reduction in the number of edges and runs up to 105.18$\times$ faster than the \textsf{FM} algorithm. On large synthetic graphs with up to 1.05 billion edges, it attains a reduction in the number of edges of up to 74.36\%. On real-world graphs, it achieves a reduction in the number of edges by up to 46.8\%. Furthermore, when used as a preprocessing step, our approach yields up to a 2.07$\times$ speedup for the matching algorithms on large synthetic graphs, and up to a 1.74$\times$ speedup for the All-Pairs Shortest Path algorithms on real-world graphs, when compared to using the given graph as input.

cs.DS↗

Are Turn-by-Turn Navigation Systems of Regular Vehicles Ready for Edge-Assisted Autonomous Vehicles?

Future private and public transportation will be dominated by Autonomous Vehicles (AV), which are potentially safer than regular vehicles. However, ensuring good performance for the autonomous features requires fast processing of heavy computational tasks. Providing each AV with powerful enough computing resources is certainly a practical solution but may result in increased AV cost and decreased driving range. An alternative solution being explored in research is to install low-power computing hardware on each AV and offload the heavy tasks to powerful nearby edge servers. In this case, the AV's reaction time depends on how quickly the navigation tasks are completed in the edge server. To reduce task completion latency, the edge servers must be equipped with enough network and computing resources to handle the vehicle demands. However, this demand shows large spatio-temporal variations. Thus, deploying the same amount of resources in different locations may lead to unnecessary resource over-provisioning. Taking these challenges into consideration, in this paper, we discuss the implications of deploying different amounts of resources in different city areas based on real traffic data to sustain peak versus average demand. Because deploying edge resources to handle the average demand leads to lower deployment costs and better system utilization, we then investigate how peak-hour demand affect the safe travel time of AVs and whether current turn-by-turn navigation apps would still provide the fastest travel route. The insights and findings of this paper will inspire new research that can considerably speed up the deployment of edge-assisted AVs in our society.

cs.NI↗