A computing environment for urban traffic systems

This paper presents a computing environment for building hierarchical traffic telematics distributed systems based on nonlocking distributed shared memory algorithm. The algorithm aims mainly at minimising the total amount of time for data retrieval in network of workstations, considering the point of view of distributed traffic modules. The framework presented in this paper adopts a nonlocking model to achieve the required performance. The presented framework develops further the successful features of DIME (developed and designed at SOCI, NTU) and at the same time avoids its shortcomings. The experimental results show that the new framework outperforms the old design of the system