Differences

This shows you the differences between two versions of the page.

--- workshops:tutorial3 [2018/09/11 17:15] – sbs
+++ workshops:tutorial3 [2018/11/03 10:11] – tema
@@ Line 11: / Line 11: @@
 network algorithms in less than two hours.
-===== Schedule (November 3rd 2018)  =====
+===== Schedule (Saturday, November 3rd 2018)  =====
-|14:00 - 16:00| Getting started with array programming in SaC.|
-|16:00 - 16:30| Coffee break|
+| 14:30 - 16:30  | Getting started with array programming in SaC.                                       |
-|16:30 - 18:00| Live coding session "How to implement your parallel CNN from scratch in 90 minutes"|
+| 16:30 - 17:00  | Coffee break                                                                         |
+| 17:00 - 18:30  | Live coding session "How to implement your parallel CNN from scratch in 90 minutes"  |
+===== Useful Links =====
+  * Login to Jupyter Hub [[https://sachub.oi.pe/jhub|here]].  Pick any username; use the password that will be announced during the tutorial.  This will create a session (persists for 24 hours) where you can run notebooks or work via the terminal.
+  * The notebook with code snippets from the first part of the tutorial is [[https://www.macs.hw.ac.uk/gitlab/tema/pact-slides|here]]
+  * Full code for the CNN is [[https://github.com/SacBase/CNN|here]].  The ''cnn.sac'' is a version without set comprehension, and it uses a few tricks to make it run faster.  The ''cnn_template.sac'' replaces all the with-loops with set-comprehensions; this becomes more readable but it may have a bit more runtime overheads.
 ===== Rationale =====
@@ Line 45: / Line 53: @@
 [[http://www.macs.hw.ac.uk/~sbs/|Sven-Bodo Scholz]] and [[http://ashinkarov.github.io/|Artjoms  Šinkarovs]] are computer science researchers working in the area of high-performance compilers and functional languages.  Sven-Bodo Scholz is the original author of the SaC compiler and Artjoms  Šinkarovs is one of the main contributors.