Messages
Thanx to all of you for taking the course and working hard to complete it. Herewith the (likely) final message for Spring 2022:
I have now sent out the grades for HE1/HE2/Oral/Final to each of you.
And included the comments for HE1 and HE2.
IF you are surprised by any of the grades then let us talk about it - please contact me.
Distribution of final grades:
A B C D E F
5 3 3 1 0 0
I appreciate the hard work that all of you did to get thru the course - it is a hard course because both of the theory, but even more the hard programing is tough (including that it is an experimental language - not a slick, well polished languag...
Today's oral exam will take place in:
seminarrom Pascal (2452)
-- Eric
It seems like everyone has now answered the Doodle.
I have set a schedule: one got an "if-need-be" time - because there were too many for the desired slots, and one got 17:00 because there was one more student than expected!
Rules:
You can bring all lecture materials plus ONE sheet of A4 paper per question. You can use picture/illustrations/etc from the lecture materials.
At the exam, you draw one of the questions for which you do a short presentation 3-8 minutes (or none at all, if you prefer merely being questioned).
You MUST show up on time for the exam. You should be there AT LEAST ONE HOUR before your scheduled time - except for the first three in the morning - they only need to be there 15 minutes before. You can "risk" being called in to the exam before your scheduled time - up to ONE HOUR before (again this does not apply to the first three in the morning - they should be ready 15 minutes b...
Hi.
If you have preferences for when you will be examined then please fill out this Doodle by 23:59 on Tuesday May 24th, 2022.
https://doodle.com/meeting/participate/id/aM8ypY5e
-- Eric
Lecture materials for F16 uploaded.
-- Eric
Reminder: Next lecture is tomorrow, May 18th, 2022 at 14:15.
I will review the course and go thru the oral exam questions and tell you what I expect that you should know about the answers to each question.
Thanx to all who replied re the late feedback on submission: the compensation will be that the grading will figure in that the feedback has been lacking.
-- Eric
Lecture materials for F15 uploaded.
-- Eric
F13 week 16: no lecture
F14 week 17: no lecture
F15 week 18: Implementation of Emerald including Distributed Garbage Collection
F16 week 19: no lecture
F17 week 20: Course review, exam prep
F18 week 21: no lecture (Kr. Himmelfartsdag)
F19 week 22: no lecture
*** END ***
Dear students,
Due to delayed feedback on Oblig1, we have decided to move the deadline for Oblig2 to Friday, March 11 for everyone.
Everyone will get feedback on Oblig1 by Thursday, March 10.
I am available to answer your questions on Mattermost today, Thursday, and Friday.
Best regards,
Oleks
Lecture materials for L7 uploaded.
Please note that the first half 45 was, unfortunately, not recorded.
-- Eric
Dear students,
Unfortunately, I am not able to hold today's exercise session due to ongoing developments in Ukraine. For the same reason I am delayed with my feedback on Oblig1.
However, I have now taken up a workplace where I can get feedback done by some time tomorrow, while helping deal with the consequences of the conflict and working towards its resolution.
I expect to be available on Mattermost today and going forth.
--
Oleks
LECTURE F6 CANCELLED, no lecture 2022-03-23
We are slightly ahead of the plan, so the lecture is cancelled - work on the oblig instead!
Dear students,
I will be physically present at OJD, Seminarrom Shell today.
The plan is to offer some initial group feedback on Oblig1, and offer an incursion on Oblig2.
I should be ready with individual feedback by the end of this week.
I will also be available to answer questions online during the time, and group feedback will be summarized in a subsequent post or screencast.
--
Oleks
Dear students,
Here are a couple clarifications with regards to Oblig1, which I have found to be suitable for general communication:
Task 1: Barriers
A cyclic barrier object should be constructed with a positive integer n - the number of threads to wait for, and have a single method - await. A process that calls await should get blocked on this call until n processes have called await. Such a barrier allows n processes to wait for one another before they go on to some subsequent stage in their (common) computation. A cyclic barrier can be used by n processes more than once, without re-initializing the object.
Task 2 - Producer/Consumer
Here, timing is important. You should be careful not to skew your resul...
Dear students,
The exercise session will again be virtual due to illness.
I will be present on Mattermost and here: https://uio.zoom.us/j/68334540491 with the password scheme as before.
--
Oleks
Dear students,
You can now find information on working with PlanetLab here. There you will find a (rather short) list of nodes that have been prepared for your work thus far.
Remember to check in on Zoom at https://uio.zoom.us/j/68334540491?pwd=aDlneEJYMEN6UUpRejZHNWMwSWtnUT09 at 10:15.
--
Oleks