Game playing as a technique for teaching parallel computing concepts

ABSTRACT

Blackboard tracing of algorithms, while an effective tool for the teaching of sequential programming, is singularly ineffective and confusing when applied to parallel computing. The use of classroom games to illustrate concepts and pathologies proves to be a useful alternative technique. Games in which students play the role of processors can be used to illustrate simple parallel algorithms as well as more complex concepts. Live demonstrations are stimulating for both the participants and the class as a whole. This paper discusses guidelines regarding the development of such exercises and presents several examples.

REFERENCES

• 1: Selim G. Akl, The design and analysis of parallel algorithms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
• 2: Bruce R. Maxim , Gregory Bachelis , David James , Quentin Stout, Introducing parallel algorithms in undergraduate computer science courses (tutorial session), ACM SIGCSE Bulletin, v.22 n.1, p.255, Feb. 1990
• 3: Nicholas Carriero , David Gelernter, How to write parallel programs: a first course, MIT Press, Cambridge, MA, 1990
• 4: G. C. Fox, Solving problems on concurrent processors, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
• 5: C. A. R. Hoare, Monitors: an operating system structuring concept, Communications of the ACM, v.17 n.10, p.549-557, Oct. 1974 [doi>10.1145/355620.361161]
• 6: Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
• 7: James S. Jones, Participatory teaching methods in computer science, ACM SIGCSE Bulletin, v.19 n.1, p.155-160, Feb. 1987
• 8: Michael J. Quinn, Designing efficient algorithms for parallel computers, McGraw-Hill, Inc., New York, NY, 1987
• 9: Nan C. Schaller, Panel: parallel computing in the undergraduate computer science curriculum, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.148, November 18-22, 1991, Albuquerque, New Mexico, United States [doi>10.1145/125826.125919]

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

Additional Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.2 Multiple Data Stream Architectures (Multiprocessors)
          Subjects: Multiple-instruction-stream, multiple-data-stream processors (MIMD)

  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Parallelism and concurrency

General Terms:
Algorithms