Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/377435.377670acmconferencesArticle/Chapter ViewAbstractPublication PagesiticseConference Proceedingsconference-collections
Article

Using actors in an interactive animation in a graduate course on distributed system

Published: 25 June 2001 Publication History

Abstract

We describe and evaluate an experiment where actors were used to simulate the behaviour of processes in a distributed system in order to explain the concept of self-stabilisation in a graduate course on distributed systems.A self-stabilising system is one that ensures that the system's behaviour eventually stabilises to a safe subset of states regardless of the initial state. Protocols satisfying this elegant property, which enables a system to recover from transient failures that can alter the state of the system, are often hard to understand, especially for students that have not studied distributed computing and systems before.The experiment was part of an introductory course on distributed computing and systems for graduates in October 2000. The purpose of this interactive animation was to introduce to the students the basic concepts behind self-stabilisation (eligible states, transient faults, execution convergence) before their formal introduction.All of the students had a degree either in mathematics or computing science and had taken a course on algorithms before. However, most of the students did not have a background in distributed systems or distributed algorithms. The latter was not only the motivation for preparing this method of presentation but also what made this a challenging effort.The feedback from the class was that the concept and this teaching method were very well received. We could observe that their understanding evolved to the point that they were able to successfully come up with ideas for solutions and argue for/prove their correctness. As suggested in [1], dramatisation of executions can help the students to understand new issues and complications. This work shows that this is true even for graduate level courses. In our experiment we could conclude that dramatisation can be almost as powerful as a programming exercise in the teaching process; sometimes even more efficient, especially when we need to teach new concepts to an audience with diverse educational backgrounds. In analysing the results of our method we make a combination of the qualitative and quantitative approaches [4].

References

[1]
M. Ben-Ari, Y.B-D. Kolikant. Thinking Parallel: The Process of Learning Concurrency. Proceedings of ACM ITiCSE 1999, pp. 13-16.
[2]
E.W. Dijkstra. Self-stabilizing Systems in Spite of Distributed Control. Communications of the A CM, Vol. 17, No. 11, Nov. 1974.
[3]
S. Dolev. Self-stabilization, MIT Press, 2000.
[4]
Y.B-D. Kolikant, M. Ben-Ari, S. Pollack. The Anthropology of Semaphores. Proceedings of ACM ITiCSE 2000, pp. 21- 24.
[5]
L. Lamport. Solved problems, unsolved problems and nonproblems in Concurrency. PODC84, pages 63-67, 1983.
[6]
Lydian - An Educational Animation Environment for Distributed Algorithms and Protocols (2000). http://www.cs.chalmers.se/-lydian/
[7]
M. Schneider. Self-Stabilization, ACM Computing Surveys, 1993.
[8]
The VADE project (2000). http://www.wisdom.weizmann.ac.il/~ulitsky/j ava/proj/
[9]
ViSiDiA Project: Visualization and Simulation of Distributed Algorithms (2000). http://dept-info.labri.u-bordeaux.fr/-stefan/

Index Terms

  1. Using actors in an interactive animation in a graduate course on distributed system

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ITiCSE '01: Proceedings of the 6th annual conference on Innovation and technology in computer science education
    June 2001
    198 pages
    ISBN:1581133308
    DOI:10.1145/377435
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 25 June 2001

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    ITICSE01
    Sponsor:

    Acceptance Rates

    ITiCSE '01 Paper Acceptance Rate 43 of 139 submissions, 31%;
    Overall Acceptance Rate 552 of 1,613 submissions, 34%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 214
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 24 Sep 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media