Re-engineering a concurrency simulator

  • Authors:
  • Yakov Persky;Mordechai Ben-Ari

  • Affiliations:
  • School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978 Israel;Department of Science Teaching, Weizmann Institute of Science, Rehovot 76100, Israel

  • Venue:
  • ITiCSE '98 Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

SimAda is a concurrency simulator, reengineered from the simulator given in M. Ben-Ari, Principles of Concurrent Programming. The language was written in Ada 95 to enhance portability and to utilise the structuring constructs of a modern language. The concurrency constructs simulated include protected types which are new for Ada 95, as well as the Ada rendezvous. Several task scheduling models can be chosen for experimentation. SimAda is intended for teaching concurrency, both by running programs and by studying the implementation techniques.