Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticanetworking:spm:supportorec17 [17/10/2017 alle 16:38 (8 anni fa)] – creata Marco Danelutto
+++ magistraleinformaticanetworking:spm:supportorec17 [25/01/2018 alle 14:17 (7 anni fa)] (versione attuale) – [Course notes] Marco Danelutto
@@ Linea 1: / Linea 1: @@
-====== SPM for the academic year 2017-2018 =====
-The SPM course has been moved from first semester (last edition 2016-2017) to second semester (2017-2018 and following AY). To favour the students enrolled in 2016-17 that will therefore find the SPM lessons in the second semester, a "recover" version of the course will be run in the first semester 2017-2018 (i.e. from Sept 2017 to Dec 2017). However this version will not include full lessons in classroom. I'll give only 20 hours in classroom. The other lesson hours will be given "virtually" either providing audio/video material recorded offline or assigning material to be read on your own and discussed in the next physical classroom lesson. The course will be supported by some web tool (didawiki, Google classroom, ...). During the teaching period, several home work will be assigned. These are programming exercises to be implemented and run on the machine(s) available for the course (multicore servers with Intel PHI and/or GPU accelerators), using different kind of programming tools. Students may compare their implementation of the homework exercises with the solutions prepared by the teachers(s) or send the teacher their code for comments. The exam will include
-  * the preparation of a project (possibly re-using part of the homework achievements),
-  * a demo + discussion of the project, and
-  * an oral exam (questions on the theory part of the course)
-All the terms registered as "exam day" on the esami.unipi.it pages must be considered as the deadlines for the electronic (email) submission of the project. After that term, the teacher will mark the projects and eventually call you for the oral part (demo + discussion + questions).
@@ Linea 17: / Linea 11: @@
 Next lessons will be on Tuesday Oct. 3, 11am Room X1 and Tuesday Oct. 3 14pm in the multimedia room (Dept. of Computer Science).
+==== Course notes ====
+Course notes (last edition) may be found [[http://backus.di.unipi.it/~marcod/SPM1415/spmSept14.pdf|here]]
+==== Trivial ff_comp implementation ====
+In case, you may use this code to implement a trivial ff_comp that **only accepts sequential stages**.
+<code "ff_comp.hpp">
+#ifndef ff_comp_hpp
+#define ff_comp_hpp
+#include <ff/node.hpp>
+#include <vector>
+#include <functional>
+#include <initializer_list>
+using namespace ff;
+class ff_comp : public ff_node {
+protected:
+  std::vector<ff_node *>stages;
+  int stageno;
+public:
+  ff_comp(ff_node *s1, ff_node *s2) {
+    stages.push_back(s1);
+    stages.push_back(s2);
+    stageno = 2;
+  }
+  ff_comp(std::initializer_list<ff_node*> pats) {
+    stageno = 0;
+    for(auto i = pats.begin(); i != pats.end(); i++) {
+      stages.push_back(*i);
+      stageno++;
+    }
+  }
+  // for cloning
+  ff_comp() {
+    stageno=0;
+    return;
+  }
+  void add_stage(ff_node * stage) {
+    stages.push_back(stage);
+    stageno++;
+    return;
+  }
+  ff_comp * clone() {
+    ff_comp * p = new ff_comp();
+    for(int i=0; i<stageno; i++)
+      p->add_stage(stages[i]);
+    return(p);
+  }
+  // end of bad idea to clone
+  void * svc (void * t) {
+    auto x = stages[0]->svc(t);
+    for(int i=1; i<stageno; i++)
+      x = stages[i]->svc(x);
+    return(x);
+  }
+};
+</code>
+====== Support material 2017 (recovery edition) ======
 ==== Accounts =====
@@ Linea 40: / Linea 103: @@
 | spm17c15 | Cosimo Agati |
 | spm17c16 | Elena Bucchianeri |
+| spm17c17 | Maria Chiara Cecconi |
+| spm17c18 | Equi Massimo |