English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Finding single source shortest path is a very ubiquitous problem. But withthe increasing size of large datasets in important application like socialnetwork data-mining, network topology determination-efficient parallelizationof these techniques is needed to match the need of really large graphs. Wepresent a new Inter node-bellman cum Intra node Dijkstra technique implementedin MPI to solve SSSP problem. We have used a triangle based edge pruning foridle processes, and two different techniques for termination detection. Withineach node the algorithm works as Dijkstra and for outer communication itbehaves as inter node bellman ford. First termination detection technique isbased on the token ring and counter. Second is a heuristic based technique, inwhich the timeout is calculated from the number of inter-edges and number ofpartitions. In this project asynchronous mode of message passing is used.

SP Async:Single Source Shortest Path in Asynchronous Mode on MPI