Using rate monotonic scheduling technology for real-time communications in a wormhole network

The demand for systems with predictable communication delays is growing as the number of applications for real-time systems expands. We present a design for guaranteeing deadline constraints for real-time communications in a wormhole network. An important feature of the design is that it requires few changes to current wormhole networks that support logical channels. The design approach applies rate monotonic scheduling technology to wormhole networks, which allows us to verify whether an assignment of real-time traffic can have deadlines guaranteed. We provide a tool that analyzes the feasibility of real-time traffic assignments, which aids designers who develop applications that use real-time communication features of a wormhole network