• Corpus ID: 38818994

Dynamic Shortest Paths using JavaScript on GPUs

  title={Dynamic Shortest Paths using JavaScript on GPUs},
  author={Anurag Ingole},
Information on the internet is growing rapidly and its processing needs high-speed infrastructure, both in hardware and software. JavaScript is now an integral ingredient of web applications which perform tasks ranging from error checking in online forms to processing Google maps. Due to their interactive nature, performance of JavaScript applications is critical, especially while handling huge volumes of evolving data. Therefore, parallelization of JavaScript code has been pursued in the… 

Figures and Tables from this paper

A Shared-Memory Parallel Algorithm for Updating Single-Source Shortest Paths in Large Dynamic Networks

This work presents a novel two-step shared-memory algorithm for updating SSSP on large dynamic graphs, i.e. graphs whose structure evolves with time, and is one of the first practical parallel algorithms for updating networks on shared- memory systems that is also scalable to large networks.

The Need for Speed of AI Applications: Performance Comparison of Native vs. Browser-based Algorithm Implementations

This paper presents a comparison study between native code and different browser-based implementations: JavaScript, ASM.js as well as WebAssembly on a representative mix of algorithms, showing that current efforts in runtime optimization push the boundaries well towards (and even beyond) native binary performance.

A Parallel Fully Dynamic Iterative Bio-Inspired Shortest Path Algorithm

A fully dynamic bio-inspired parallel algorithm for solving the shortest path problem on dynamically changing graphs based on Physarum Solver, which is an amoeba shortest path algorithm that computes effectively dynamic shortest path even if percentage of changing edges is large.

Single-Source Shortest Path Tree for Big Dynamic Graphs

This paper proposes a novel distributed computing approach, SSSPIncJoint, to update SSSP on big dynamic graphs using GraphX, and considerably speeds up the recomputation of the SSSP tree by reducing the number of map-reduce operations required for implementing SSSP in the gather-apply- scatter programming model used by GraphX.

Drone-Truck Cooperated Delivery Under Time Varying Dynamics

This paper presents a drone-truck co-operated delivery framework that minimizes the total delivery time while considering low energy consumption as the secondary objective and shows that the algorithm can help to complete the deliveries time efficiently and saves energy.

A Parallel Algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks

This work presents a novel parallel algorithmic framework for updating the Single Source Shortest Path in large-scale dynamic networks and implements it on the shared-memory and GPU platforms.



ParallelJS: An Execution Framework for JavaScript on Heterogeneous Systems

A framework for flexible mapping of JavaScript onto heterogeneous systems that have both CPUs and GPUs is proposed, which achieves up to 26.8x speedup executing JavaScript applications on parallel GPUs over a mainstream web browser that runs on CPUs.

Accelerating Large Graph Algorithms on the GPU Using CUDA

This work presents a few fundamental algorithms - including breadth first search, single source shortest path, and all-pairs shortest path - using CUDA on large graphs using the G80 line of Nvidia GPUs.

Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2

This paper presents fast parallel implementations of three fundamental graph theory problems, breadth-first search, st-connectivity and shortest paths for unweighted graphs, on multithreaded architectures such as the Cray MTA-2, and reports impressive results, both for algorithm execution time and parallel performance.

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

This paper presents a distributed breadth- first search (BFS) scheme that scales for random graphs with up to three billion vertices and 30 billion edges, and develops efficient collective communication functions for the 3D torus architecture of BlueGene/L that take advantage of the structure in the problem.

Chronos: a graph engine for temporal graph analysis

The result is a high-performance temporal-graph system that offers up to an order of magnitude speedup for temporal iterative graph mining compared to a straightforward application of existing graph engines on a series of snapshots.

A Query Based Approach for Mining Evolving Graphs

This paper addresses the novel problem of querying evolving graphs using spatio-temporal patterns by answering selection queries, which can discover evolving subgraphs that satisfy both a temporal and a spatial predicate.

Mining Temporally Evolving Graphs

This paper provides a framework to approach problems of this kind and identifies interesting problems at each level and can be applied to other domains, where data can be mode led as graph, such as network intrusion detection o r social networks.

GraphScope: parameter-free mining of large time-evolving graphs

The efficiency and effectiveness of the GraphScope is demonstrated, which is designed to operate on large graphs, in a streaming fashion, on real datasets from several diverse domains, and produces meaningful time-evolving patterns that agree with human intuition.

Optimistic parallelism requires abstractions

The design and implementation of a programming abstractions that permit programmers to highlight opportunities for exploiting parallelism in sequential programs are described, and a runtime system that uses these hints to execute the program in parallel is described.

SNAP: A General-Purpose Network Analysis and Graph-Mining Library

Stanford Network Analysis Platform (SNAP) is described, a general-purpose, high-performance system that provides easy to use,high-level operations for analysis and manipulation of large networks and a set of social and information real-world networks and datasets, which it makes publicly available.