COSC6490A

Anonymous (anonymous@undisclosed.example.com) — 2007-09-25T05:20:05+00:00

How do you implement a bounded FIFO buffer in C-Linda? Assume the buffer contains integers (to make life a little easier). There are a number of producers and a number of consumer. Assume that the functions consume and produce have already been defined. Now consider the functions consumer and producer.

Bounded buffer in Java

Anonymous (anonymous@undisclosed.example.com) — 2007-10-04T14:03:47+00:00

Bounded buffer in Java The class Buffer can be implemented as follows. /** This class represents a bounded buffer. @author Franck van Breugel */ public class Buffer { private static final int SIZE = 10; private Object[] buffer; private int inCount; private int outCount; /** Creates an empty buffer. */ public Buffer() { this.buffer = new Object[Buffer.SIZE]; this.inCount = 0; this.outCount = 0; } /** Puts the given element in this buffer. @p…

Anonymous (anonymous@undisclosed.example.com) — 2007-09-30T16:24:12+00:00

Let us implement a bounded FIFO buffer in C-Linda. There are a number of producers and a number of consumer. Assume that the functions consume and produce have already been defined. Now consider the functions consumer and producer. void consumer() { int data; while (1) { data = get(); consume(data); } } void producer() { int data; while (1) { data = produce(); put(data); } }

Calendar

Anonymous (anonymous@undisclosed.example.com) — 2007-11-23T13:50:30+00:00

Calendar September 6 No lecture. September 11 Herb Sutter and James Larus. Software and the Concurrency Revolution. Queue, 3(7):54-62, September 2005. Celeste Biever. Chip revolution poses problems for programmers. New Scientist, 2594:26-27, March 2007. September 13 No lecture. September 18

Concurrent ML

Anonymous (anonymous@undisclosed.example.com) — 2007-09-25T18:43:54+00:00

Concurrent ML John H. Reppy. CML: A Higher-order Concurrent Language. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991. SIGPLAN Notices, 26(6):293-305, June 1991. Reppy, J. H. 1993. Concurrent ML: Design, Application and Semantics. In Functional Programming, Concurrency, Simulation and Automated Reasoning: international Lecture Series 1991-1992

Contact

Anonymous (anonymous@undisclosed.example.com) — 2007-08-01T13:57:34+00:00

Contact Course Director * Bob J. Smith * Office: CSE 999 (Computer Science and Engineering Building) * Phone: (416) 736-2100 x. 11111 * Email: bobsmith AT cse DOT yorku DOT ca You may contact the course director by e-mail at any time. Teaching Assistants

Course Outline

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T19:53:17+00:00

Course Outline The course outline is a guideline to topics that will be discussed in the course, and when they will be discussed: Week 1 Your notes here. Week 2 Midterm Drop Deadline Week 13 Final Exam

Discussion

Anonymous (anonymous@undisclosed.example.com) — 2007-11-23T13:46:25+00:00

Discussion Comments, remarks, suggestions, corrections etcetera can be posted here. Slawomir's Sleeping Barber Please download the SleepingBarber.jar (the source code is in the jar), then run: java -jar SleepingBarber.jar The main logic is in the run() method of the Barber class:

Frequently Asked Questions

Anonymous (anonymous@undisclosed.example.com) — 2007-08-01T14:34:50+00:00

Frequently Asked Questions Here, you can list frequently asked questions from your students along with responses. General Do I need to register for a CSE Computer Account? Yes. Do I need to attend class? If you wish to pass. Tests Do I need to write all tests?

Forums

Anonymous (anonymous@undisclosed.example.com) — 2007-08-02T17:22:57+00:00

Forums This page acts as a future placeholder for a link to a forum system.

Grades

Anonymous (anonymous@undisclosed.example.com) — 2007-09-13T18:44:13+00:00

Grades The performance of the students will be evaluated as a combination of three assignments (45%), three presentations (15%), a paper (30%) and participation (10%). The latter includes, for example, participation during lectures, adding to this wiki, etcetera. Conversion from numeric to letter grade is applied to the

Important Dates

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T17:53:24+00:00

Important Dates Here, you would list important dates for your course. * Sept 1 - Assignment 1 Due * Oct 1 - Course finished

Tips for literature search

Anonymous (anonymous@undisclosed.example.com) — 2007-09-22T22:03:37+00:00

Tips for literature search For Starters General Information * Scientific publication cycle * Kinds of documents: * patents: government granted license to an invention * standards: agreed upon methodology: e.g. 802.11 * journals: research results presented in a periodical/magazine

Paper

Anonymous (anonymous@undisclosed.example.com) — 2007-08-15T21:57:09+00:00

Paper The paper should cover the material discussed in the three assignments. The paper should not be produced by cutting and pasting parts of the assignments. The paper should have an abstract, introduction, conclusion and bibliography. The rest of the paper should address your algorithm, your implementation in Java and your verification effort. The paper should not exceed 15 pages, and it should be formatted according to Springer-Verlag Lecture Notes in Computer Science Series guidelines. For…

Concurrency paradigms

Anonymous (anonymous@undisclosed.example.com) — 2007-09-18T18:46:54+00:00

Concurrency paradigms Parallel Programming Models and Paradigms Shared variables E.W. Dijkstra. Cooperating Sequential Processes. EWD 123. 1968. Languages that exploit shared variables include Java. Synchronous message passing C.A.R. Hoare. Communicating Sequential Processes . Communications of the ACM, 21(8):666-677, August 1978.

Policies

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T18:55:53+00:00

Policies Here, you can list specific course policies. Academic Dishonesty For more information on Academic Dishonesty, click here.

Presentations

Anonymous (anonymous@undisclosed.example.com) — 2007-10-21T23:17:24+00:00

Presentations There will be three presentations. Each presentation covers an assignment. Each presentation is 20 minutes. The presentations will be scheduled around the due dates of the assignments. October 9 Slot Student 1 Marcin Kwietniewski

A solution to the readers-writers problem in Java

Anonymous (anonymous@undisclosed.example.com) — 2007-10-05T12:24:27+00:00

A solution to the readers-writers problem in Java We start with the database. /** This class represents a database. There are many competing threads wishing to read and write. It is acceptable to have multiple processes reading at the same time, but if one thread is writing then no other process may either read or write. */ public class Database { private int readers; // number of active readers /** Initializes this database. */ public Database() { this.rea…

Resources

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T18:59:29+00:00

Resources Use this page to list additional Resources that may be helpful to your students. * Department of CSE Home Page * York Exam Schedule

Anonymous (anonymous@undisclosed.example.com) — 2024-03-08T14:02:31+00:00

* Announcements * Calendar * Assignments * Assignment 1 * Assignment 2 * Assignment 3 * Presentations * Paper * Grades

Anonymous (anonymous@undisclosed.example.com) — 2007-10-29T20:51:36+00:00

Another classical problem takes place in a barber shop. This problem is due to Dijkstra. The barber shop has one barber, a barber chair, and n chairs for waiting customers, if any, to sit on. If there are no customers present, the barber sits down in the barber chair and falls asleep. When a customer arrives, he has to wake up the sleeping barber. If additional customers arrive while the barber is cutting a customer's hair, then they sit down (if there are empty chairs) or leave the shop (i…

Anonymous (anonymous@undisclosed.example.com) — 2007-10-28T16:43:56+00:00

Below we implement the following Stack interface in several different ways. /** * A Stack. */ public interface Stack { /** * Removes the top element from this stack and returns it. * * @return the top element of this stack. * @throw EmptyException if this stack is empty. */ public Integer pop() throws EmptyException; /** * Pushes the given element onto this stack. * * @param the element to be pushed onto this stack. */ public void push(Integer element); }

Concurrent Object Oriented Languages

Anonymous (anonymous@undisclosed.example.com) — 2008-01-21T20:50:37+00:00

Concurrent Object Oriented Languages Description In this course, we focus on concurrent programming in the object oriented language Java. The course consists of three main parts. In the first part, we discuss concurrent programming in general. In the second part, we concentrate on writing concurrent programs in Java. In the third and final part, we look at techniques and tools to verify concurrent Java programs.

Textbook

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T18:42:03+00:00

Textbook You will require the following textbook for this course: * Jane Doe. Absolute Computing. Second edition. Addison Wesley, 2007. You may purchase this book through the York University Bookstore.

Why do we need software verification tools?

Anonymous (anonymous@undisclosed.example.com) — 2007-11-01T14:13:48+00:00

The following is taken from Peter H. Roosen-Runge. Software Verification Tools. 2000. Why do we need software verification tools? Software errors are expensive. It has been estimated that in North America perhaps $3 billion a year is lost in “crashes”, with the average cost of a major outage running at $330,000. The airlines estimate that every minute a reservation system is down costs $70,000. But the error rate in programming resists any significant reduction: error estimates for programmer…

Announcements

Anonymous (anonymous@undisclosed.example.com) — 2007-11-06T17:38:14+00:00

Announcements November 6 The course evaluation will take place on November 20. October 25 The suggested date to hand in Assignment 2 and 3 is November 6 and November 27, respectively. The later you hand in your assignments, the less time there may be for giving feedback. The deadline for the paper is December 19.