Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Publisher: IEEE Computer Society
Languages: English
Types: Part of book or chapter of book
Subjects: UOW3
In this paper, we present the implementation of a parallel road traffic simulation using the concept of Lane Cut Points (LCPs) in the Spider programming environment. LCPs are storage buffers inserted into lane data structures at the road network partition edges. Vehicles enter a partition at the edges from an LCP and exit a partition edge into an LCP at the end of every simulation step. Spider, a parallel programming environment, which runs on PVM, coordinates the execution of the parallel traffic simulation.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] C. Barrette, and D.J. Roberts, “The TRANSIMS micro simulation status”, Technical report, TSA-DO/SA, Los Alamos National Lab, New Mexico, USA, 1994.
    • [2] D. McArthur, The PARAMICS Model: Present and Future Directions. Technical report, SIAS Ltd., Edinburgh, 1994.
    • [3] Greg Pfisters , In search of Clusters , Prentice Hall ,1998.
    • [4] Ijaha S.E, S.C. Winter and N.Kalantery, “HIPERTRANS - High Performance Transport Modelling and Simulation”, Proc, 6th Intl Europar Conf., Munich, Germany, 28 August - 1st September, 2000.
    • [5] Kai Nagel and Marcus Ricket, “Parallel implementation of the TRANSIMSmicro-simulation” http://www.inf.ethz.ch/personal/nagel/papers/parallel/ parallel.pdf [Online: cited March 23, 2003].
    • [6] Matthias Schmidt, “Decomposition of a traffic flow model for a parallel simulation”, Proc. AI, Simulation and planning in High Autonomy Systems (AIS2000), Tucson, USA, March 6-8, 2000.
    • [7] Message Passing Interface (MPI) Standards, http://wwwunix.mcs.anl.gov/mpi/index.html [Online: cited August 8, 2003].
    • [8] N. Kalantery, S.C. Winter and D.R. Wilson, “ From BSP to a virtual Von Neumann Machine”, IEE journal of Computing & Control Eng., vol 6, no 3, June 1995, pp 131-136.
    • [9] N. Kalantery, “A distributed event processing method for general-purpose computation”, J. Systems Architecture, no 44, 1998, pp 547-558.
    • [10] Open Framework for Simulation of Transport Strategies and Assessment (OSSA), A European 5th Framework Collaborative Research Project in the Competitive and Sustainable Growth Programme, DG-TREN Project GRD1-10917 "OSSA", http://www.ossa-ig.com/. [Online: cited August 8, 2003].
    • [11] Parsifal Cluster page: http://parsifal.cpc.wmin.ac.uk/ [Online. Cited August 8, 2003].
    • [12] Paramics: http://www.paramics-online.com [Online: cited August 8, 2003].
    • [13] Parallel Virtual Machine (PVM) Library, http://netlib2.cs.utk.edu/pvm3 [Online: cited August 8, 2003].
    • [14] TRANSIMS, TRransportation Analysis and Simulation System, http://transims.tsasa.lanl.gov [Online: cited August 8, 2003].
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article