Abstract
In this paper, we present the implementation of parallel road traffic simulation using the concept of Lane Cut Points (LCPs) in the Spider programming environment. LCPs are storage buffers that are inserted at the end of lanes, which cut across two partitions. Vehicles for other partitions enter the LCPs at the end of the lanes and are removed from the LCP buffers at the beginning of every simulation step. Spider, a programming environment, which runs on PVM, coordinates the execution of the parallel traffic simulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
