메뉴 건너뛰기




Volumn , Issue , 2009, Pages 428-437

Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator

Author keywords

Load balancing; Parallel discrete event simulation; Transportation simulation

Indexed keywords

AGENT BASED SIMULATION; DAILY ACTIVITY; DESIGNING SYSTEMS; DIJKSTRA'S SHORTEST PATH ALGORITHM; DISTRIBUTED MEMORY; EXECUTION TIME; IN-BUILDINGS; LOAD-BALANCING; NEW YORK; OPTIMAL PATHS; OPTIMIZED ROUTING; PARALLEL DISCRETE-EVENT SIMULATION; REAL TIME; REAL-WORLD; ROAD LINKS; ROAD NETWORK; SYNTHETIC POPULATIONS; TRANSPORTATION NETWORK;

EID: 77952139252     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIPC.2009.5433183     Document Type: Conference Paper
Times cited : (19)

References (22)
  • 1
    • 77952189891 scopus 로고    scopus 로고
    • http://computing.lanl.gov/article/505.
  • 2
    • 77952145190 scopus 로고    scopus 로고
    • http://computing.lanl.gov/article/570.
  • 3
    • 0030101040 scopus 로고    scopus 로고
    • Paramics: Parallel microscopic simulation of road traffic
    • Springer
    • CAMERON, G., AND DUNCAN, G. Paramics: Parallel microscopic simulation of road traffic. In Journal of SuperComputing (1996), vol. 10, Springer, pp. 25-53.
    • (1996) Journal of SuperComputing , vol.10 , pp. 25-53
    • Cameron, G.1    Duncan, G.2
  • 6
    • 77952153023 scopus 로고    scopus 로고
    • CONCEPTS, I. T. VISSIM Simulation Tool. In http://www.itc-world.com/ VISSIMinfo.htm (2001).
    • (2001) VISSIM Simulation Tool
  • 7
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • DIJKSTRA, E. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959).
    • (1959) Numerische Mathematik , vol.1
    • Dijkstra, E.1
  • 9
    • 84976676590 scopus 로고
    • Parallel discrete event simulation
    • FUJIMOTO, R. M. Parallel discrete event simulation. Commun. ACM 33, 10 (1990), 30-53.
    • (1990) Commun. ACM , vol.33 , Issue.10 , pp. 30-53
    • Fujimoto, R.M.1
  • 12
    • 85007016157 scopus 로고    scopus 로고
    • A computational study of routing algorithms for realistic transportation networks
    • JACOB, R., MARATHE, M., AND NAGEL, K. A computational study of routing algorithms for realistic transportation networks. Journal of Experimental Algorithmics 4, 1999 (1999).
    • (1999) Journal of Experimental Algorithmics , vol.4 , Issue.1999
    • Jacob, R.1    Marathe, M.2    Nagel, K.3
  • 15
    • 46149108377 scopus 로고    scopus 로고
    • A systems approach to scalable transportation network modeling
    • PERUMALLA, K. A systems approach to scalable transportation network modeling. In 2006 Winter Simulation Conference (2006), pp. 1500-1507.
    • 2006 Winter Simulation Conference (2006) , pp. 1500-1507
    • Perumalla, K.1
  • 18
    • 52449147619 scopus 로고
    • Shortest paths in Euclidean graphs
    • SEDGEWICK, R., AND VITTER, J. Shortest paths in Euclidean graphs. Algorithmica 1, 1 (1986), 31-48.
    • (1986) Algorithmica , vol.1 , Issue.1 , pp. 31-48
    • Sedgewick, R.1    Vitter, J.2
  • 21
    • 0003693579 scopus 로고    scopus 로고
    • TRANSPORTATION RESEARCH BOARD
    • TRANSPORTATION RESEARCH BOARD. Highway Capacity Manual, 2000.
    • (2000) Highway Capacity Manual
  • 22
    • 73149106978 scopus 로고    scopus 로고
    • US DEPARTMENT OF TRANSPORTATION (DOT 2003) NHTS 2001, Highlights Report, BTS03-05
    • US DEPARTMENT OF TRANSPORTATION (DOT 2003). Bureau of Transporataion Statistics, NHTS 2001, Highlights Report, BTS03-05, 2003.
    • (2003) Bureau of Transporataion Statistics


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.