| 35 | |
| 36 | == Ideas for parallel computation == |
| 37 | |
| 38 | 1. First, we can have a simple "work" for simulator: we said that we don't need to use threads in the processing of GPS events and Cleanup events, so we'll have a queue for these types of events. And also, it would be another 2 queues: each one for a type of event - Send Event and Receive Event. |
| 39 | Three queues, each queue assigned for a processor. Each queue is assigned to a processor, so we'll have 3 processors. |
| 40 | Is a good step to divide the work, but is not enough. Presume that we have more processors, we can use them. |
| 41 | |
| 42 | 2. Another approach is to assign a processor to each road. In VANET simulators (and also, in real world VANETS), cars are processing messages. |