E-resources
-
Deaconu, Adrian Marius; Spridon, Delia Elena; Ciupala, Laura
2023 22nd International Symposium on Parallel and Distributed Computing (ISPDC), 2023-JulyConference Proceeding
In this paper, a directed network in which there is a specific percentage of loss for each arc is considered. These losses are due to evaporation, leaks, energy dissipation, theft, etc. We deal with the problem of finding the directed path from a given source node s to a given sink node t that has the minimum loss among all directed paths from s to t. We show how Dijkstra's algorithm can be adapted to deal with this problem. Then, we consider the more general case when on some arcs there is the possibility to have a gain, instead of loss. For solving the latter problem, we adapt Bellman-Ford's algorithm. Since the applicability of these problems is for big networks such as national or international transportation networks of water, gas, electricity, etc., we also study how CPU or GPU parallelization can be applied to the proposed algorithms. The speed-up results are presented and discussed for different networks having various sizes.
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.