Please use this identifier to cite or link to this item: https://doi.org/10.1109/DS-RT.2012.38
DC FieldValue
dc.titleAn offline road network partitioning solution in distributed transportation simulation
dc.contributor.authorXu, Y.
dc.contributor.authorTan, G.
dc.date.accessioned2013-07-04T08:44:41Z
dc.date.available2013-07-04T08:44:41Z
dc.date.issued2012
dc.identifier.citationXu, Y., Tan, G. (2012). An offline road network partitioning solution in distributed transportation simulation. Proceedings - IEEE International Symposium on Distributed Simulation and Real-Time Applications : 210-217. ScholarBank@NUS Repository. https://doi.org/10.1109/DS-RT.2012.38
dc.identifier.isbn9780769548463
dc.identifier.issn15506525
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42153
dc.description.abstractOffline road network partitioning is the first step to space-parallel distributed transportation simulation. Currently, METIS is the most popular offline road network partitioning solution, but it cannot naturally formalize data distribution in various ITS applications, and cannot guarantee to minimize data exchanges between partitions. This paper introduces a hyper graph-based offline road network partitioning solution, which is suitable for future distributed transportation simulations with ITS applications. In [10], we proposed to formalize offline road network partitioning as a hyper graph partitioning problem, which makes it possible to minimize data exchanges between partitions. We then solved the hyper graph partitioning problem using hMETIS, a graph partitioning algorithm borrowed from Very Large Scale Integration (VLSI) applications. In this paper, our experiments based on Singapore road network showed that the hyper graph-based road network partitioning with ITS applications reduces data exchanges between partitions. We observed two features in data distributions in some ITS applications, which led us to develop the biased first choice (BFC) coarsening schema. Experiments show that BFC further reduces data exchanges between partitions. For distributed transportation simulations, where there are large amounts of data exchanged between partitions, especially by ITS applications, our proposal is one candidate solution to reduce the simulation time and increase the scalability © 2012 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/DS-RT.2012.38
dc.sourceScopus
dc.subjectbiased first choice coarsening schema
dc.subjectdistributed transportation simulation
dc.subjecthypergraph partitioning
dc.subjectITS applications
dc.subjectoffline road network partitioning
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/DS-RT.2012.38
dc.description.sourcetitleProceedings - IEEE International Symposium on Distributed Simulation and Real-Time Applications
dc.description.page210-217
dc.identifier.isiut000316990000028
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

16
checked on Oct 17, 2019

WEB OF SCIENCETM
Citations

13
checked on Oct 17, 2019

Page view(s)

81
checked on Oct 14, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.