Type:

Other

Description:

When a lot of people share one network (such as cars using roads, or messages getting through the Internet), there is the possibility that competing processes will create a “deadlock," or an interruption in movement through the resource. Learners model a network by cooperatively passing objects to their correct destinations. They devise algorithms to efficiently route objects to their destinations; they also learn ways to design a network to minimize deadlock. The activity includes the main activity and several extensions to explore how to design an efficient network. Background information is also included.

Subjects:

  • Computer Science > General
  • Mathematics > General
  • Education > General

Education Levels:

  • Grade 1
  • Grade 2
  • Grade 3
  • Grade 4
  • Grade 5
  • Grade 6
  • Grade 7
  • Grade 8
  • Grade 9
  • Grade 10
  • Grade 11
  • Grade 12

Keywords:

NSDL,parallel processing,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-056,Computer science,Problem Solving,Mathematics,Troubleshooting and Maintenance,technology,information,network,Upper Elementary,routing,Informal Education,Middle School,oai:nsdl.org:2200/20110926121554913T,buffering,Computing and Information,deadlock,computers,programming,Information and Communication,Engineering,Elementary School,Education,Technology

Language:

English

Access Privileges:

Public - Available to anyone

License Deed:

Creative Commons Attribution Non-Commercial Share Alike

Collections:

None
This resource has not yet been aligned.
Curriki Rating
'NR' - This resource has not been rated
NR
'NR' - This resource has not been rated

This resource has not yet been reviewed.

Not Rated Yet.

Non-profit Tax ID # 203478467