Final grades published | |
|
Final assignments are now graded (except those submitted late). You all did a good job! Final grades were calculated with 50% for the final assignment and 50% for the average of the home assignments. |
| פורסם ב-8/8/2015, 08:38:45 Created on 8/8/2015, 08:38:45 Создано8/8/2015, 08:38:45 تم النشر ب-8/8/2015, 08:38:45 |
No office hour today | |
|
Due to the talk by Lenzen, Hagit won't hold her office hours today. Send email if you want to meet her. |
| פורסם ב-14/6/2015, 07:13:02 Created on 14/6/2015, 07:13:02 Создано14/6/2015, 07:13:02 تم النشر ب-14/6/2015, 07:13:02 |
Talk by Christoph Lenzen on Sunday 14/06/2015 | |
|
Dr. Lenzen from MPI Saarbruecken will speak about distributed algorithms for Max Flow Computation, on Sunday June 14, at 13:30. More details in http://www.cs.technion.ac.il/~colloq/20150614_13_30_Lenzen.html |
| פורסם ב-8/6/2015, 11:49:25 Created on 8/6/2015, 11:49:25 Создано8/6/2015, 11:49:25 تم النشر ب-8/6/2015, 11:49:25 |
Tutorial room next week | |
|
Next week the tutorial will be held in room 601. This is a one time change due to the alumni event. |
| עדכון אחרון ב-4/6/2015, 14:58:20 Last updated on 4/6/2015, 14:58:20 Последняя модификация4/6/2015, 14:58:20 تمت الحتلنة الأخيرة ب-4/6/2015, 14:58:20 |
Assignment 4 | |
|
The fourth (and last) home assignment is now on the site. Good luck, Maya. |
| פורסם ב-4/6/2015, 14:54:38 Created on 4/6/2015, 14:54:38 Создано4/6/2015, 14:54:38 تم النشر ب-4/6/2015, 14:54:38 |
Homework 3 more clarifications | |
|
In Question 3: 1. Use the algorithm presented in class (slide 90). This algorithm uses default values instead v_bottom. 2. In part (b) you can base your proof on the proof from the book (page 106). No need to re-write it, just present the changes. Good Luck, Maya |
| פורסם ב-1/6/2015, 09:12:25 Created on 1/6/2015, 09:12:25 Создано1/6/2015, 09:12:25 تم النشر ب-1/6/2015, 09:12:25 |
Homework 3 clarification | |
|
In Question 3 part (b): Modify the algorithm with input sets {0,1,2} so that the strong validity condition holds, for n > 6f. |
| עדכון אחרון ב-28/5/2015, 15:01:32 Last updated on 28/5/2015, 15:01:32 Последняя модификация28/5/2015, 15:01:32 تمت الحتلنة الأخيرة ب-28/5/2015, 15:01:32 |
Assignment 3 | |
|
The third home assignment is now on the site. Sorry for posting it on a Friday, this was supposed to be posted yesterday. Good luck, Maya. |
| פורסם ב-22/5/2015, 17:02:06 Created on 22/5/2015, 17:02:06 Создано22/5/2015, 17:02:06 تم النشر ب-22/5/2015, 17:02:06 |
Assignment 2 | |
|
The second home assignment is now on the site. Good luck, Maya. |
| פורסם ב-7/5/2015, 12:13:19 Created on 7/5/2015, 12:13:19 Создано7/5/2015, 12:13:19 تم النشر ب-7/5/2015, 12:13:19 |
Tutorial today | |
|
I might be a few minuets late due to my lecture at the CSL Luncheon. Maya |
| פורסם ב-7/5/2015, 12:23:53 Created on 7/5/2015, 12:23:53 Создано7/5/2015, 12:23:53 تم النشر ب-7/5/2015, 12:23:53 |
Special talk this week | |
|
This Thursday I will be giving a talk at the CSL Luncheon (12:30-13:30, in room 337). The context of this talk is synchronization in concurrent data structures. I will present Predicate RCU (PRCU), an RCU variant for concurrent updates. You are all welcome. If you wish to join the CSL mailing list and recieve e-mails regarding future luncheons please open a ticket at http://ds-panda.cs.technion.ac.il/osticket/index.php Maya |
| עדכון אחרון ב-3/5/2015, 18:11:54 Last updated on 3/5/2015, 18:11:54 Последняя модификация3/5/2015, 18:11:54 تمت الحتلنة الأخيرة ب-3/5/2015, 18:11:54 |
תרגול השלמה Complementary tutorial Дополнительное практическое занятие تمرين مكمل | |
|
A complementary tutorial will be held next Sunday (26/4) at 16:30 Taub 8. Maya. |
| עדכון אחרון ב-20/4/2015, 14:43:34 Last updated on 20/4/2015, 14:43:34 Последняя модификация20/4/2015, 14:43:34 تمت الحتلنة الأخيرة ب-20/4/2015, 14:43:34 |
Correction to Assignment 1 | |
| A correction was added to question 4 (written in red). |
| פורסם ב-19/4/2015, 18:43:59 Created on 19/4/2015, 18:43:59 Создано19/4/2015, 18:43:59 تم النشر ب-19/4/2015, 18:43:59 |
Assignment 1 typos | |
|
There were several typos in Burns' algorithm (Algorithm 4). Please make sure to use the updated version, which include the following changes: 1. The loops in lines 2,6 start from zero. 2. In all loops halt condition uses the variable j. 3. The goto statements in lines 4,8 jump to line 1. |
| פורסם ב-19/4/2015, 14:56:49 Created on 19/4/2015, 14:56:49 Создано19/4/2015, 14:56:49 تم النشر ب-19/4/2015, 14:56:49 |
Assignment 1 | |
|
The first home assignment is now on the site. Good luck, Maya. |
| פורסם ב-16/4/2015, 15:54:04 Created on 16/4/2015, 15:54:04 Создано16/4/2015, 15:54:04 تم النشر ب-16/4/2015, 15:54:04 |
No tutorial this week | |
|
There will be no tutorial this week (March 19th). |
| עדכון אחרון ב-15/3/2015, 18:20:50 Last updated on 15/3/2015, 18:20:50 Последняя модификация15/3/2015, 18:20:50 تمت الحتلنة الأخيرة ب-15/3/2015, 18:20:50 |
Welcome to Distributed Algorithms B | |
|
Welcome to Distributed Algorithms B. Have a good semester! |
| פורסם ב-9/3/2015, 16:04:30 Created on 9/3/2015, 16:04:30 Создано9/3/2015, 16:04:30 تم النشر ب-9/3/2015, 16:04:30 |