From Everywhere to Everywhere (FETE): Adaptation of a Pedestrian Movement Network Model to a Hybrid Parallel Environment-Reference-Cited by-同舟云学术

From Everywhere to Everywhere (FETE): Adaptation of a Pedestrian Movement Network Model to a Hybrid Parallel Environment

Published:2017 Issue: Volume: Page:347-353
ISSN:1867-2434
Container-title:Advances in Geocomputation
language:
Short-container-title:

Author:

Sorokine Alexandre,White Devin,Hardin Andrew

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-22786-3_31

Reference8 articles.

1. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271

2. Finn MP, Liu Y, Mattli DM, Guan Q, Yamamoto KH, Shook E, Behzad B (2012) pRasterBlaster: high-performance small-scale raster map projection transformation using the Extreme Science and Engineering Discovery Environment. In: Paper presented at the XXII International Society for Photogrammetry & Remote Sensing Congress, Melbourne, Australia, Aug 25–Sept 1, 2012. http://cegis.usgs.gov/projection/pdf/pRasterBlasterAbstract_ISPRS2012_V05.pdf . Accessed 3 Jan 2016

3. Hazel T, Toma L, Vahrenhold K, Wickremesinghe R (2008) Terracost: computing least-cost-path surfaces for massive grid terrains. J Exp Algorithmics 12:1–9

4. Madduri K, Bader DA, Berry JW, Crobak JR (2007) An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. In: Applegate D, Brodal GS (eds) Proceedings of the ninth workshop on algorithm engineering and experiments, pp 23–35. Society for Industrial and Applied Mathematics, Philadelphia, PA. doi: 10.1137/1.9781611972870.3

5. Matloff N (2006) Introduction to parallel processing. http://heather.cs.ucdavis.edu/~matloff/145/ParScript/MPI.pdf . Accessed 3 Jan 2016