Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: GPU Algorithm for Earliest Arrival Time Problem in Public Transport
  Networks   Given a temporal graph G, a source vertex s, and a departure time at source
vertex t_s, the earliest arrival time problem EAT is to start from s on or
after t_s and reach all the vertices in G as early as possible. Ni et al. have
proposed a parallel algorithm for EAT and obtained a speedup up to 9.5 times on
real-world graphs with respect to the connection-scan serial algorithm by using
multi-core processors.
  We propose a topology-driven parallel algorithm for EAT on public transport
networks and implement using general-purpose programming on the graphics
processing unit GPU. A temporal edge or connection in a temporal graph for a
public transport network is associated with a departure time and a duration
time, and many connections exist from u to v for an edge (u,v). We propose two
pruning techniques connection-type and clustering, and use arithmetic
progression technique appropriately to process many connections of an edge,
without scanning all of them. In the connection-type technique, the connections
of an edge with the same duration are grouped together. In the clustering
technique, we follow 24-hour format and the connections of an edge are
partitioned into 24 clusters so that the departure time of connections in the
i^{th} cluster is at least i-hour and at most i+1-hour. The arithmetic
progression technique helps to store a sequence of departure times of various
connections in a compact way. We propose a hybrid approach to combine the three
techniques connection-type, clustering and arithmetic progression in an
appropriate way. Our techniques achieve an average speedup up to 59.09 times
when compared to the existing connection-scan serial algorithm running on CPU.
Also, the average speedup of our algorithm is 12.48 times against the parallel
edge-scan-dependency graph algorithm running on GPU.

13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
30
The categories of this paper are: q-alg
2
The categories of this paper are: math
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics