Category Archives: Thesis Work – BlazeRouter

See attached PDF for details on the BlazeRouter-M (or as we’re now calling it BR-Q, Q for QoS). This diagram details the control packet/data packet flow from one node to another in our BlazeNoC. This is the first revision of … Continue reading →

The total number of states in the Arbiter’s control unit for BlazeRouter-M has reached 69 states. As far as Finite State Machines go, this diagram (located –> https://github.com/koru/BlazeRouter_M/tree/master/docs) isn’t your traditional looking Moore machine (rather complex), but nevertheless the design … Continue reading →

Update on where we’re at in the BlazeRouter design. Next steps. Continue reading →

Thus far, I’ve been trying to implement the main components of the arbiter. Namely, the Control Unit, Reservation Table and Scheduler have been designed to take in the PID (packet ID) and TID (expected arrival time ID) (respectively) from the … Continue reading →

Implemented some logic pertaining to the Reservation and Routing tables. Having some trouble with VHDL and finding an appropriate, synthesizable way to implement a multidimensional array that represents a ram block. Integer indexing of the array directly with a variable … Continue reading →

Back at it, now that school is a couple weeks out. Passed my class so that means I can fully concentrate my efforts in the coming summer months on getting this thesis work under control. In fact, I’ve already started … Continue reading →

Initial posting on BlazeRouter design. Continue reading →