with Leigh Ann Yoder
Routing and Deadlock
Today was all about routing and deadlock. When you have a lot of people using one resource, such as cars using roads, there is a possibility of deadlock. Many students have experienced this in large cities.
Routing and deadlock are also problems in many types of networks, including computer systems. Engineers spend a lot of time figuring out how to solve these problems, and how to design networks that make the problems easier to solve.
The students learned these concepts by playing a game called The Orange Game. They had to develop their own strategies for avoiding deadlock and quickly learned that working cooperatively is imperative to avoid problems.
Toss 'n' Sort
We then played a second game called Toss ‘n’ Sort, which again mimicked routing and deadlock in networks. This time each student was like a “packet” of information, which had a destination. The “packet” had to travel along the edges of a graph to reach its required node. Of course there were rules regarding movement. We played several variations and discussed which methods were most successful. The students were stumped on the last challenge, but towards the end of the class they were close to solving the puzzle. I have asked them all to continue working on this for homework. Next week, we will try one more time!
We ran out of time, so next week we will play another game demonstrating Message Routing.