Interactive execution of distributed algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Interactive execution of distributed algorithms

Full text

Pdf (76 KB)

Source

Journal on Educational Resources in Computing (JERIC) archive
Volume 1 , Issue 2es (Summer 2001) table of contents

Article No. 2

Year of Publication: 2001

ISSN:1531-4278

Author

Mordechai Ben-Ari

Weizmann Institute of Science, Rehovot, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 95, Citation Count: 5

Additional Information:

appendices and supplements abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/384055.384057 What is a DOI?

APPENDICES and SUPPLEMENTS

ben-ari.zip (104 KB)

Distributed Algorithms in Java (version 2). This program is an interactive, visual aid for studying distributed algorithms. Download the ben-ari.zip file and open the index.html file. It contains instructions for using this resource.

ABSTRACT

DAJ (Distributed Algorithms in Java) is a framework for writing Java programs to implement distributed algorithms. The programs display the data structures at each node and enable the user to interactively construct scenarios. In a learning situation, active interactive execution is preferable to passively watching an animation. Programs have been implemented for commonly taught algorithms, including the Byzantine generals, mutual exclusion, termination, and snapshots. Adding a program for another algorithm requires only general Java programming experience, as the GUI aspects are encapsulated.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ATTIYA,H.AND WELCH, J. 1998. Distributed Computing. McGraw-Hill, London, UK.
	2	Mordechai Ben-Ari , Yifat Ben-David Kolikant, Thinking parallel: the process of learning concurrency, ACM SIGCSE Bulletin, v.31 n.3, p.13-16, Sept. 1999
	3	Mordechai Ben-Ari , Shawn Silverman, DPLab: an environment for distributed programming, ACM SIGCSE Bulletin, v.31 n.3, p.91-94, Sept. 1999
	4	Mordechai Ben-Ari, Using inheritance to implement concurrency, ACM SIGCSE Bulletin, v.28 n.1, p.180-184, March 1996
	5	M. Ben-Ari, Principles of concurrent and distributed programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	6	M. Ben-Ari, Principles of concurrent and distributed programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	7	A. Burns , G. Davies, Concurrent programming, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1993
	8	Stephen J. Hartley, Concurrent programming: the Java programming language, Oxford University Press, Inc., New York, NY, 1998
	9	KOLDEHOFE, B. 1999. Animation and analysis of distributed algorithms. Master's Thesis. University of Saarlandes, Germany.
	10	Leslie Lamport , Robert Shostak , Marshall Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.382-401, July 1982 [doi>10.1145/357172.357176]
	11	Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1996
	12	Yoram Moses , Zvi Polunsky , Ayellet Tal , Leonid Ulitsky, Algorithm Visualization For Distributed Environments, Proceedings of the 1998 IEEE Symposium on Information Visualization, p.71-78, October 19-20, 1998, North Carolina
	13	Yoav Tzruya , Mordechai Ben-Ari, A portable implementation of the distributed systems annex in Java, Proceedings of the 1998 annual ACM SIGAda international conference on Ada, p.204-211, November 08-12, 1998, Washington, D.C., United States

CITED BY 5

	Steve Carr , Jean Mayo , Ching-Kuang Shene, ThreadMentor: a pedagogical tool for multithreaded programming, Journal on Educational Resources in Computing (JERIC), v.3 n.1, p.1-es, March 2003
	Boris Koldehofe , Marina Papatriantafilou , Philippas Tsigas, Integrating a simulation-visualisation environment in a basic distributed systems course: a case study using LYDIAN, ACM SIGCSE Bulletin, v.35 n.3, September 2003
	Mordechai Ben-Ari, A suite of tools for teaching concurrency, ACM SIGCSE Bulletin, v.36 n.3, September 2004
	Ahuva Tikvati , Mordechai Ben-Ari , Yifat Ben-David Kolikant, Virtual trees for the byzantine generals algorithm, ACM SIGCSE Bulletin, v.36 n.1, March 2004
	Boris Koldehofe , Marina Papatriantafilou , Philippas Tsigas, LYDIAN: An extensible educational animation environment for distributed algorithms, Journal on Educational Resources in Computing (JERIC), v.6 n.2, p.1-es, June 2006