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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Petersen graph has good performance in parallel and distributed computation because of its characteristics such as short diameter and regularity. On the basis of topology of double-loops, a new double-loops connected Petersen graph network DLCPG(k) is constructed. In addition, unicasting, broadcasting and a kind of fault-tolerant routing algorithms are designed respectively. It is proved that DLCPG(k) not only has good extensibility, short diameter and simple topology, but also has the following good characteristics for the networks with 10k nodes: The diameter of DLCPG(k) is shorter than that of 2-dimensional Torus and RP(k) networks, and the grouping ability of DLCPG(k) overmatches that of 2-dimensional Torus and RP(k) networks at the same time. It is also proved that the communication efficiency of both the unicasting and broadcasting algorithms are better than the unicasting and broadcasting algorithms of RP(k) network conspicuously. Simulation results conclude that the new fault-tolerant routing algorithm is of good fault-tolerant ability.

Topology and Routing Algorithms of Double-Loops Connected Petersen Graph Networks