Results 11 to 20 of about 3,982 (139)

Generation of shortest path search dataflow networks of actors for parallel multi-core implementation

open access: yesInformatika, 2023
Objectives. The problem of parallelizing computations on multicore systems is considered. On the Floyd – Warshall blocked algorithm of shortest paths search in dense graphs of large size, two types of parallelism are compared: fork-join and network ...
A. A. Prihozhy
doaj   +1 more source

Group Communication Patterns for High Performance Computing in Scala [PDF]

open access: yes, 2014
We developed a Functional object-oriented Parallel framework (FooPar) for high-level high-performance computing in Scala. Central to this framework are Distributed Memory Parallel Data structures (DPDs), i.e., collections of data distributed in a shared ...
Hargreaves, Felix P.   +2 more
core   +1 more source

Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train

open access: yesIJID (International Journal on Informatics for Development), 2019
This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip.  The best route is the path, which has the minimum price of a train journey.
Tri Setya Dermawan
doaj   +1 more source

ALGORITMA FLOYD WARSHALL UNTUK MENENTUKAN JALUR TERPENDEK EVAKUASI TSUNAMI DI KELURAHAN SANUR

open access: yesE-Jurnal Matematika, 2013
Sanur village is one of beautiful tourism spots in Bali. Sanur is located in south of Bali, Indonesia. There are many beaches in that place. Besides of beautifulness of it, Sanur potentially to be attacked by Tsunami disaster because of it is location ...
AJENG FITRAH SANI   +2 more
doaj   +1 more source

Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks

open access: yesAlgorithms, 2023
Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies.
Konstantin Gaipov   +6 more
doaj   +1 more source

A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]

open access: yesJisuanji gongcheng, 2020
Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj   +1 more source

Shortest Path Discovery in the Multi-layered Social Network [PDF]

open access: yes, 2011
Multi-layered social networks consist of the fixed set of nodes linked by multiple connections. These connections may be derived from different types of user activities logged in the IT system.
Bródka, Piotr   +2 more
core   +1 more source

Generalized blocked Floyd – Warshall algorithm

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2019
One of the most commonly used on practice all-pairs shortest paths algorithms on weighted graphs is Floyd – Warshall algorithm. Blocked version serves as a basis for obtaining effective parallel algorithms to be implemented on multicore central ...
Nikolai A. Likhoded
doaj   +1 more source

Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem

open access: yesJurnal Sisfokom, 2023
The Sumba region, Indonesia, is known for its extraordinary natural beauty and unique cultural richness. There are 19 interesting tourist attractions spread throughout the area, but tourists often face difficulties in planning efficient visiting routes ...
Yosefina Finsensia Riti   +2 more
doaj   +1 more source

An Algorithm for the Cycled Shortest Path Problem [PDF]

open access: yesMuṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2011
For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with
Asghar Aini, Amir Salehipour
doaj  

Home - About - Disclaimer - Privacy