Show simple item record

dc.contributor.author
Nagel, Kai
dc.contributor.author
Rickert, Marcus
dc.date.accessioned
2017-07-20T14:23:38Z
dc.date.available
2017-06-10T17:57:56Z
dc.date.available
2017-07-20T14:23:38Z
dc.date.issued
2000
dc.identifier.uri
http://hdl.handle.net/20.500.11850/67935
dc.identifier.doi
10.3929/ethz-a-009900754
dc.description.abstract
This paper describes the parallel implementation of the TRANSIMS traffic micro-simulation. The parallelization method is domain decomposition, which means that each CPU of the parallel computer is responsible for a different geographical area of the simulated region. We describe how information between domains is exchanged, and how the transportation network graph is partitioned. An adaptive scheme is used to optimize load balancing. We then demonstrate how computing speeds of our parallel micro-simulations can be systematically predicted once the scenario and the computer architecture are known. This makes it possible, for example, to decide if a certain study is feasible with a certain computing budget, and how to invest that budget. The main ingredients of the prediction are knowledge about the parallel implementation of the micro-simulation, knowledge about the characteristics of the partitioning of the transportation network graph, and knowledge about the interaction of these quantities with the computer system. In particular, we investigate the differences between switched and non-switched topologies, and the effects of 10 Mbit, 100 Mbit, and Gbit Ethernet. As one example, we show that with a common technology – 100 Mbit switched Ethernet – one can run the 20 000-link EMME/2-network for Portland (Oregon) more than 20 times faster than real time on 16 coupled Pentium CPUs.
en_US
dc.format
application/pdf
dc.language.iso
en
en_US
dc.publisher
ETH, Department of Computer Science
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.subject
Parallel computing
en_US
dc.subject
PARALLELVERARBEITUNG + NEBENLÄUFIGKEIT (BETRIEBSSYSTEME)
en_US
dc.subject
SIMULATION (COMPUTER SYSTEMS)
en_US
dc.subject
DATA COMMUNICATIONS (COMPUTER SYSTEMS)
en_US
dc.subject
DATENKOMMUNIKATION (COMPUTERSYSTEME)
en_US
dc.subject
Traffic simulation
en_US
dc.subject
PARALLEL PROCESSORS + PARALLEL COMPUTERS + PARALLEL ARCHITECTURES (COMPUTER SYSTEMS)
en_US
dc.subject
PARALLELPROZESSOREN + PARALLELCOMPUTER + PARALLELARCHITEKTUREN (COMPUTERSYSTEME)
en_US
dc.subject
SIMULATION (COMPUTERSYSTEME)
en_US
dc.subject
PARALLEL PROCESSING + CONCURRENCY (OPERATING SYSTEMS)
en_US
dc.subject
Transportation planning
en_US
dc.title
Parallel implementation of the TRANSIMS micro-simulation
en_US
dc.type
Report
dc.rights.license
In Copyright - Non-Commercial Use Permitted
dc.date.published
2013
ethz.journal.title
Technical Report / ETH Zurich, Department of Computer Science
ethz.journal.volume
344
en_US
ethz.size
32 p.
en_US
ethz.code.ddc
DDC - DDC::0 - Computer science, information & general works::004 - Data processing, computer science
en_US
ethz.identifier.nebis
009900754
ethz.publication.place
Zürich
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science
en_US
ethz.date.deposited
2017-06-10T17:59:30Z
ethz.source
ECOL
ethz.source
ECIT
ethz.identifier.importid
imp59366b400892d72721
ethz.identifier.importid
imp593650aedd80962167
ethz.ecolpid
eth:7084
ethz.ecitpid
pub:108016
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2017-07-13T07:32:16Z
ethz.rosetta.lastUpdated
2020-02-15T06:25:20Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Parallel%20implementation%20of%20the%20TRANSIMS%20micro-simulation&rft.jtitle=Technical%20Report%20/%20ETH%20Zurich,%20Department%20of%20Computer%20Science&rft.date=2000&rft.volume=344&rft.au=Nagel,%20Kai&Rickert,%20Marcus&rft.genre=report&
 Search print copy at ETH Library

Files in this item

Thumbnail

Publication type

Show simple item record