A communication library to support concurrent programming courses

ABSTRACT

A number of communication libraries have been written to support concurrent programming. For a variety of reasons, these libraries generally are not well-suited for use in undergraduate courses. We have written a communication library uniquely tailored to an academic environment. The library provides two levels of communication abstraction (topology and channel) and supports communication among threads, processes on the same machine, and processes on different machines, via a unified interface. The routines facilitate controlled message loss along channels and can be integrated with an existing graphical tool that supports visualization of the communication that occurs. An editor has been developed for automatic code generation for arbitrary topologies via a graphical interface. All these tools run over Solaris, Linux, and Windows.

REFERENCES

• 1: ACM. Computing Curricula 2001 (Steelman Draft, August 1, 2001). http://www.acm.org/sigs/sigcse/cc2001/steelman/, 2001.
• 2: David M. Arnow, XDP: a simple library for teaching a distributed programming module, Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, p.82-86, March 02-04, 1995, Nashville, Tennessee, United States
• 3: Michael Bedy , Steve Carr , Xianlong Huang , Ching-Kuang Shene, A visualization system for multithreaded programming, Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, p.1-5, March 07-12, 2000, Austin, Texas, United States
• 4: Randal E. Bryant , David R. O'Hallaron, Introducing computer systems from a programmer's perspective, Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, p.90-94, February 2001, Charlotte, North Carolina, United States
• 5: George Coulouris , Jean Dollimore , Tim Kindberg, Distributed systems (3rd ed.): concepts and design, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
• 6: Dijkstra, E. W. A correctness proof for networks of communicating sequential processes - a small exercise. EWD-607, 1977.
• 7: C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
• 8: Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
• 9: Mattern, F. Virtual time and global states of distributed systems. In Parallel and Distributed Algorithms: Proceedings of the International Workshop on Parallel and Distributed Algorithms, M. C. et. al., Ed. Elsevier Science Publishers B. V., 1989, pp. 215-226.
• 10: Chris McDonald , Kamran Kazemi, Teaching parallel algorithm with process topologies, Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, p.70-74, March 07-12, 2000, Austin, Texas, United States
• 11: N. Soundararajan, Axiomatic semantics of communicating sequential processes, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.4, p.647-662, Oct. 1984 [doi>10.1145/1780.1805]