hrcak mascot   Srce   HID

Prethodno priopćenje

Performance Issues And Gains Of Caching The Pathfinding Data

Ivan Porkolab ; University College Algebra, Zagreb, Croatia
Goran Đambić ; University College Algebra, Zagreb, Croatia
Danijel Kučak   ORCID icon orcid.org/0000-0003-2947-2389 ; University College Algebra, Zagreb, Croatia

Puni tekst: engleski, pdf (663 KB) str. 1-10 preuzimanja: 95* citiraj
APA 6th Edition
Porkolab, I., Đambić, G. i Kučak, D. (2018). Performance Issues And Gains Of Caching The Pathfinding Data. International Journal of Digital Technology & Economy, 3. (1.), 1-10. Preuzeto s https://hrcak.srce.hr/216171
MLA 8th Edition
Porkolab, Ivan, et al. "Performance Issues And Gains Of Caching The Pathfinding Data." International Journal of Digital Technology & Economy, vol. 3., br. 1., 2018, str. 1-10. https://hrcak.srce.hr/216171. Citirano 20.09.2020.
Chicago 17th Edition
Porkolab, Ivan, Goran Đambić i Danijel Kučak. "Performance Issues And Gains Of Caching The Pathfinding Data." International Journal of Digital Technology & Economy 3., br. 1. (2018): 1-10. https://hrcak.srce.hr/216171
Harvard
Porkolab, I., Đambić, G., i Kučak, D. (2018). 'Performance Issues And Gains Of Caching The Pathfinding Data', International Journal of Digital Technology & Economy, 3.(1.), str. 1-10. Preuzeto s: https://hrcak.srce.hr/216171 (Datum pristupa: 20.09.2020.)
Vancouver
Porkolab I, Đambić G, Kučak D. Performance Issues And Gains Of Caching The Pathfinding Data. International Journal of Digital Technology & Economy [Internet]. 2018 [pristupljeno 20.09.2020.];3.(1.):1-10. Dostupno na: https://hrcak.srce.hr/216171
IEEE
I. Porkolab, G. Đambić i D. Kučak, "Performance Issues And Gains Of Caching The Pathfinding Data", International Journal of Digital Technology & Economy, vol.3., br. 1., str. 1-10, 2018. [Online]. Dostupno na: https://hrcak.srce.hr/216171. [Citirano: 20.09.2020.]

Sažetak
Using non-cached methods for finding the shortest path between nodes is the most common case when using pathfinding systems. That approach generates a couple of issues. Foremost, it has a significant impact on processing resources as calculations must be done over again for each iteration, even for the repeating events. That’s not a big concern if pathfinding is invoked a reasonable number of times or the nodes involved are always different, but if pathfinding occurs many times on the same nodes, then the caching of once calculated path becomes an acceptable course of action. This paper has explored one of such caching algorithms, FAST-N algorithm and compared it with standard non-cached pathfinding. Doing so, it outlined margins of justifiable use of such systems.
On a small number of pathfinding requests or simple node structure, because of increase in memory usage and rather hefty initial calculation processing requirements, it has been concluded that non-cached system makes more sense than cached one. On the other hand, when confronted with a large number of pathfinding requests and more complex node structure, caching can generate significant benefits concerning processing power and speed.

Ključne riječi
pathfinding; caching; FAST-N; C#

Hrčak ID: 216171

URI
https://hrcak.srce.hr/216171

Posjeta: 133 *