Distributing Synchronous Programs Using Bounded Queues, a coordinated traffic signal application

Marco Zennaro and Raja Sengupta

Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley

Abstract: This paper is about the modular compilation and distribution of a sub-class of Simulink programs [10] across networks using bounded FIFO queues. The problem is first addressed mathematically. Then, based on these formal results, a software library for the modular compilation and distribution of Simulink program is given. The performance the library is given. The value of synchronous programming for the next generation of traffic control value is discussed. The adoption of these tools seems to be the natural candidate to address the needs of the traffic engineers. As a case study we present an implementation in Simulink of a controller for coordinated traffic signal in an asymmetric peak hour traffic scenario and we evaluate its computational performances in a distributed environment.

Date: 2005-05-01
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.escholarship.org/uc/item/0846252m.pdf;origin=repeccitec (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cdl:itsrrp:qt0846252m

Access Statistics for this paper

More papers in Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().