DidaWiki - magistraleinformaticanetworking:spm

SPM Laboratory - A.Y. 2015/2016

anonymous@undisclosed.example.com (Anonymous) — Fri, 30 Sep 2016 12:46:42 +0000

SPM Laboratory - A.Y. 2015/2016 Machine name and access The machine is not registered on the DNS, you should use the IP address * 131.114.137.225, corresponding to the registered name * r720-phi.itc.unipi.it You should request the account to the SPM teacher sending an email with

List of assigned accounts

anonymous@undisclosed.example.com (Anonymous) — Thu, 19 Oct 2017 07:46:45 +0000

List of assigned accounts For the A. Y. 2016-2017 Account SPM16xx Name Assignment Status 01 Amin Ait Lamqadem Video (KNL) Passed 02 Francesco Sardaro Video (KNL) 03 Luca Guerrini Jacobi 04 Serklame Abebe Kassa 05 Hagos Lemlem Adhane

Exams Session April 2016

anonymous@undisclosed.example.com (Anonymous) — Tue, 12 Apr 2016 19:50:32 +0000

Exams Session April 2016 Projects submitted * Joao * Bici * Ragusa * Nicoletti * Di Rienzo Exams Discussions and oral session: Tuesday, April 19, 2016 * 2.30pm: Valdo Joao, Bici, Di Rienzo, Ragusa

SPM 2009-2010 Final project assignments

anonymous@undisclosed.example.com (Anonymous) — Wed, 26 May 2010 12:59:44 +0000

SPM 2009-2010 Final project assignments This are the assignments already agreed. Those having no “Ok” in the “Approval” column should contact the professor. Those with some detail left unspecified (application, implementation framework, etc.) should try to finalize it

SPM exams Feb 2016

anonymous@undisclosed.example.com (Anonymous) — Thu, 03 Mar 2016 17:09:55 +0000

SPM exams Feb 2016 Thursday, Feb 25, 9.00am: * Conte + (project discussion only) Rinaldi Monday, Feb 29, 9.30am: * Frati, Forti Monday, Feb 29, 4.00pm: * Marini, Ralli Friday, March 4, 10.00am: * Crecchi, Neri Friday, March 4, 11.00am:

Extraordinary exams - April 2016

anonymous@undisclosed.example.com (Anonymous) — Tue, 12 Apr 2016 14:59:22 +0000

Extraordinary exams - April 2016 Discussions and oral session: * 10am: Valdo Joao, Bici, Di Rienzo * 4pm: Nicoletti, Ragusa

Computer Facilities at the Polo Fibonacci

anonymous@undisclosed.example.com (Anonymous) — Fri, 26 Feb 2010 15:01:05 +0000

Computer Facilities at the Polo Fibonacci As students of the University of Pisa, and in particular being the Master organized also by the Dept. of Computer Science, you have right to have an “account” at the Polo Fibonacci. Once you get your “

Read and write images from files

anonymous@undisclosed.example.com (Anonymous) — Tue, 16 Jan 2018 09:46:48 +0000

Read and write images from files To run the Histogram project, students may consider to use the CImg library. The library consists in a single header file to be included and compiled linking the pthread and the X11 library g++/icc -pthread -lX11 file.cpp -o ...

RpcGen Sample code

anonymous@undisclosed.example.com (Anonymous) — Tue, 08 Dec 2015 09:37:15 +0000

RpcGen Sample code To test: * be sure portmap is installed (sudo apt-get install portmap) * run rpcgen server.x from command line * modify server_server.c and server_client.c suitably * compile and launch server in a shell (make -F Makefile.server server_server

Socket code

anonymous@undisclosed.example.com (Anonymous) — Tue, 08 Dec 2015 09:43:15 +0000

Socket code This code is sample code only. There are many details not completely processed in the code (see lesson material). * [Pipeline] code with “Chans” interface

Threadpool code

anonymous@undisclosed.example.com (Anonymous) — Tue, 29 Sep 2015 17:02:35 +0000

Threadpool code C tgz file C++ tgz file Java tgz file

SPM 2015/16 : Code

anonymous@undisclosed.example.com (Anonymous) — Tue, 08 Dec 2015 09:40:30 +0000

SPM 2015/16 : Code * Threadpool * Socket * RpcGen

SPM 2009-2010

anonymous@undisclosed.example.com (Anonymous) — Wed, 20 Jan 2010 12:43:57 +0000

SPM 2009-2010 This is the list of arguments actually presented during the course in the A.A. 2009-2010. * Evolution of computer architectures (multi/many core, clusters, grids, clouds) and urgency of effective parallel/distributed programming models and tools

SPM notes 2010--2011

anonymous@undisclosed.example.com (Anonymous) — Wed, 25 May 2011 15:52:09 +0000

SPM notes 2010--2011 This page will host the errata corrige as well as the integration material relative to the SPM notes published in April 2011. BACK to SPM home page. To signal errors or problems with the notes, please send a message to with subject

SPM recovery edition 2017

anonymous@undisclosed.example.com (Anonymous) — Thu, 22 Feb 2018 15:21:30 +0000

SPM recovery edition 2017 Project text This is the [PDF] of the first version of the project text. For the Histogram project, you may take into account CImg for the image read/write activities. This only runs on the PHI KNL. I'll provide the students that will pick up this project an account on the PHI KNL, just moving their current account to this other machine (see instructions for the access here).

SPM 1617 Exercise and assignments

anonymous@undisclosed.example.com (Anonymous) — Wed, 12 Oct 2016 15:36:42 +0000

SPM 1617 Exercise and assignments Matrix multiplication Write e program that generates two N by N matrixes A and B and computes C, the result of the multiplication of A by B. The computation has to be performed by M threads, each working on a partition of C. Check the correctness of the result against result computed sequentially. Plot scalability curve for the program.

Task farm (POSIX TCP/IP)

anonymous@undisclosed.example.com (Anonymous) — Tue, 22 Mar 2011 18:02:43 +0000

Task farm (POSIX TCP/IP) (The code presented here does not pretend to be efficient, nor completely correct. It has been designed with the aim of illustrating several of the problems related to the implementation of fairly simple parallel applications)

Dotprod

anonymous@undisclosed.example.com (Anonymous) — Wed, 27 Nov 2013 17:42:30 +0000

Dotprod /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of *…

Farm_Farm

anonymous@undisclosed.example.com (Anonymous) — Wed, 27 Nov 2013 17:45:09 +0000

Farm_Farm /* * * --------------------------------------------------------------- * | host0 | * | ------------------ | * | | | | * | | | | * | master ------|-----> Farm ------|-- * | -------------------------- | | …

MapFarm

anonymous@undisclosed.example.com (Anonymous) — Wed, 27 Nov 2013 17:41:11 +0000

MapFarm /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of *…

ParForTest

anonymous@undisclosed.example.com (Anonymous) — Wed, 27 Nov 2013 17:43:18 +0000

ParForTest /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of…

One stage pipeline (sample code)

anonymous@undisclosed.example.com (Anonymous) — Tue, 29 Oct 2013 17:18:52 +0000

One stage pipeline (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even t…

Three stage pipeline (sample code)

anonymous@undisclosed.example.com (Anonymous) — Tue, 29 Oct 2013 17:19:52 +0000

Three stage pipeline (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even…

Pipeline (C++11 version, sample code)

anonymous@undisclosed.example.com (Anonymous) — Tue, 29 Oct 2013 17:27:47 +0000

Pipeline (C++11 version, sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without e…

Pipeline with farm stage (sample code)

anonymous@undisclosed.example.com (Anonymous) — Tue, 29 Oct 2013 17:25:23 +0000

Pipeline with farm stage (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without …

Farm of pipe (sample code)

anonymous@undisclosed.example.com (Anonymous) — Wed, 30 Oct 2013 17:05:49 +0000

Farm of pipe (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the imp…

Map (sample code)

anonymous@undisclosed.example.com (Anonymous) — Wed, 30 Oct 2013 17:13:45 +0000

Map (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warr…

Master worker (sample code)

anonymous@undisclosed.example.com (Anonymous) — Wed, 30 Oct 2013 17:07:38 +0000

Master worker (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the im…

Master worker with explicit mapping (sample code)

anonymous@undisclosed.example.com (Anonymous) — Wed, 30 Oct 2013 17:09:59 +0000

Master worker with explicit mapping (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRAN…

Software accelerator (sample code)

anonymous@undisclosed.example.com (Anonymous) — Wed, 30 Oct 2013 17:11:43 +0000

Software accelerator (sample code) /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even…

FastFlow

anonymous@undisclosed.example.com (Anonymous) — Wed, 27 Nov 2013 17:44:18 +0000

FastFlow This page hosts the material used for the 2013/14 course of SPM related to FastFlow. Download Current public version of FastFlow may be downloaded from: * The svn version is the most recent one (the tarball is usually older than the svn version), therefore use a

Sample FastFlow farms

anonymous@undisclosed.example.com (Anonymous) — Wed, 21 Mar 2012 18:58:39 +0000

Sample FastFlow farms These are the programs used in the course notes. Comments may be found in the course notes book. #include #include #include using namespace ff; class Worker: public ff_node { public: void * svc(void * task) { int * t = (int *)task; std::cout << "Worker got " << *t << std::endl; (*t)++; std::cout << "Worker emitting " << *t << std::endl; return t; } }; class Collector: public ff_nod…

Sample pipeline applications in FastFlow

anonymous@undisclosed.example.com (Anonymous) — Wed, 21 Mar 2012 18:53:47 +0000

Sample pipeline applications in FastFlow The code appearing on this page is commented in the course notes PDF, Appendix A: FastFlow. This is the code of a single concurrent activity printing an “Hello World”. We use a single stage pipeline without any kind of stream.

Heratosthene Sieve in FastFlow

anonymous@undisclosed.example.com (Anonymous) — Wed, 21 Mar 2012 18:55:55 +0000

Heratosthene Sieve in FastFlow This computes the prime numbers using a variable number of stages. Printing is protected through a Pthread lock. #include #include #include using namespace ff; static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER; class Sieve: public ff_node { public: Sieve() { filter = 0; } void * svc(void * task) { unsigned int * t = (unsigned int *)task; if (filter == 0) { filter = *t; return…

SPM: first summer term

anonymous@undisclosed.example.com (Anonymous) — Thu, 16 Jun 2016 03:59:12 +0000

SPM: first summer term June 16, 2016, 9.30, at the Prof's studio * Donati, Loriga

SPM June 29 deadline

anonymous@undisclosed.example.com (Anonymous) — Sun, 03 Jul 2016 21:45:14 +0000

SPM June 29 deadline Preliminary exams for students with old project * Thu, June 30: Adami (9.30), Fiorenzani(11.00), Rinaldi (10.30) Exams for students with the project presented at the term deadline * Thu, June 7, 9am: Loriga, Idini * Fri, June 8, 9.30am: Bruno, Porciani

SPM Xeon PHI access 2014

anonymous@undisclosed.example.com (Anonymous) — Tue, 11 Nov 2014 09:41:38 +0000

SPM Xeon PHI access 2014 Machine name The machine is not registered on the DNS, you should use the IP address * 131.114.137.225, corresponding to the registered name * r720-phi.itc.unipi.it Account You should request the account to the SPM teacher sending an email with

Distributed Systems: Paradigms and Models

anonymous@undisclosed.example.com (Anonymous) — Wed, 27 Jul 2016 19:56:46 +0000

Distributed Systems: Paradigms and Models Last summer term calendar * Mon, Jul 25, 9am, at professor's office: Frati, Soave, Loddo, Gazzarri * Wed, Jul 27, 9.30am, at professor's office: Rosini * Thu, Jul 28, 9.30am, at professor's office: Di Paolo, Luchetti

OCAML

anonymous@undisclosed.example.com (Anonymous) — Thu, 31 Mar 2011 08:33:07 +0000

OCAML Download Ocaml may be downloaded from the INRIA official Ocaml web page (follow Download tab). Implementation exist running on Linux, Mac OS X and Windows. Documentation Documentation relative to Ocaml is available through the offical Ocaml documentation web page.

Introducing skeleton semantics with higher order functions

anonymous@undisclosed.example.com (Anonymous) — Wed, 23 Mar 2011 16:31:17 +0000

Introducing skeleton semantics with higher order functions This is an summary of the lesson given on March 23rd. We represent the functional semantics of skeletons with higher order functions. We use Ocaml for the examples (see the Ocaml online manual for the syntax).

SPM 2011-2012: first exam term

anonymous@undisclosed.example.com (Anonymous) — Fri, 08 Jun 2012 16:26:29 +0000

SPM 2011-2012: first exam term Projects due: June 4th Currently received projects Code Report Kosik yes yes Dabisias yes yes Brizzi yes yes as of June 4, 8pm Oral exams on Monday, June 11, from 3pm in Danelutto's office.

Results of the SPM questionnaire

anonymous@undisclosed.example.com (Anonymous) — Fri, 11 Mar 2011 15:04:28 +0000

Results of the SPM questionnaire The Students come from Course # Place # Computer Science 35 Pisa 24 Other 4 Other Univ. 15 Familiarity with programming languages Java C C++ ML Scripting High 27 15 9 0 7 Medium 9 14

SPM for the academic year 2017-2018

anonymous@undisclosed.example.com (Anonymous) — Tue, 17 Oct 2017 16:40:19 +0000

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

SPM 2017 recovery edition lessons

anonymous@undisclosed.example.com (Anonymous) — Wed, 13 Dec 2017 18:08:21 +0000

SPM 2017 recovery edition lessons Sep. 19 2h: Introduction to the course, structure of the lessons, hardware evolution and the urgency of parallel/distributed computing dictated by parallel hw (multicore CPUs, GPUs, clusters). ---------- Assignment: look at top500.org and green500.org and try to figure out evolution of parallel machines through the

FastFlow sample code

anonymous@undisclosed.example.com (Anonymous) — Thu, 19 May 2011 14:33:41 +0000

FastFlow sample code This is the code used during the FastFlow lesson. All code should be compiled with a command such as g++ -Idir-where-ff-dir-has-been-saved -lpthread -o file file.cpp // we include farm, pipeline and allocator hpp files // as we use only this three features of FastFlow #include #include #include // we use the FastFlow namespace using namespace ff; // we use the fastflow mem allocator // should be initialized (main…

SKEPU code in FastFlow

anonymous@undisclosed.example.com (Anonymous) — Mon, 11 Nov 2013 15:34:40 +0000

SKEPU code in FastFlow The code should be compiled with CUDA, using nvcc compiler: nvcc -I fastflowFfDirPath -I skepuIncludeDirPath -o pipemap pipemap.cu -lpthread #include #include #include #define SKEPU_CUDA // #define SKEPU_OPENMP #include #include using namespace ff; int N = 10; class Source: public ff_node { public: Source(unsigned int streamlen):streamlen(streamlen) {} void * svc(void * task) { if(st…

Vectorizing compiler (sample code)

anonymous@undisclosed.example.com (Anonymous) — Mon, 11 Nov 2013 15:41:52 +0000

Vectorizing compiler (sample code) This is the code for matrix multiplication we used during the lesson. To be compiled with the -O3 flag (Gnu compiler suite). Vectorization details can be obtained with the -ftree-vectorizer-verbose=NN with NN being 1 to 9 (see Gnu gcc/g++ compiler

anonymous@undisclosed.example.com (Anonymous) — Wed, 17 Dec 2014 06:33:30 +0000

/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANT…

anonymous@undisclosed.example.com (Anonymous) — Tue, 16 Dec 2014 10:21:34 +0000

Class work 2

anonymous@undisclosed.example.com (Anonymous) — Wed, 19 Nov 2014 07:23:14 +0000

Class work 2 Below you can find the code discussed in class and relative to: * the farm solution * the farm-map solution * the pipe solution * the pipe-discard solution /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /* *************************************************************************** * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published b…

Distributed systems: paradigms & models

anonymous@undisclosed.example.com (Anonymous) — Wed, 20 Mar 2013 07:30:56 +0000

Distributed systems: paradigms & models Lessons Here you can find the arguments discussed during lessons, the audio/video files relative to the already given lessons (when available) and, more in general, pointers to support material hosted on the

Program

anonymous@undisclosed.example.com (Anonymous) — Tue, 08 Mar 2011 12:03:45 +0000

Program The course covers the programming models and the paradigms used with distributed and parallel systems, for both the application and support tool software. Taking into account structured programming models (algorithmical skeletons, parallel design patterns) as well as those models based on components and services, all the problems related to the functional (expressive power, modularity and reuse) and non functional (performance, fault tolerance, adaptivity) concerns will be considered. T…

Distributed systems: paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Thu, 23 Sep 2010 15:36:49 +0000

Distributed systems: paradigms and models This page will host all the support material relative to the course: useful links, teacher's notes, articles, etc. The notes relative to the structured parallel programming models that were supposed to be available before Christmas will not be published before end of January (presumably). We apologize for this. All the course lessons are now available on the course web pages (slides and recordings) and we updated the support material web page in such a…

Distributed systems: paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Wed, 20 Mar 2013 07:30:26 +0000

Distributed systems: paradigms and models Academic Year 2010-2011 Day Hours Argument Support material Teacher March 8 4-6pm Introduction to course: course logistics, program, general motivation. Blackboard Audio1 Audio2 Danelutto March 9 9-11am Motivations: technological improvements. From single core to multi core and many core. Heterogeneous multicores. GPUs and FPGAs as (parallel) coprocessors

SPM support material 2010-2011

anonymous@undisclosed.example.com (Anonymous) — Tue, 28 Jun 2011 14:43:39 +0000

SPM support material 2010-2011 Course Notes The course notes are available and they have been distributed (hardcopy) to the students that managed to bring them to some “copy center” (I don't know which one(s)). If you need a copy, please ask your colleagues or ask me the master copy (to be given back after copying). The table of contents of the course notes can be find

SPM 2011-2012

anonymous@undisclosed.example.com (Anonymous) — Wed, 20 Mar 2013 07:29:40 +0000

SPM 2011-2012 Lessons This is the link to the official lesson register Day Hours Arguments Support material Feb 22 2 Introduction to the course, program, support material. Motivations Blackboard dump (1)Blackboard dump (2) Audio (1st hour)Audio (2nd hour) Feb 23 2 Evolution of CPU, supercomputers. Blackboard dump Audio (1st hour) (Second hour missing)

Program

anonymous@undisclosed.example.com (Anonymous) — Mon, 20 Feb 2012 11:15:45 +0000

Program The course covers the programming models and the paradigms used with distributed and parallel systems, for both the application and support tool software. The main focus of the course is on structured programming models (parallel design pattern, algorithimc skeletons) as the main

SPM A.A. 2011-2012 : support material

anonymous@undisclosed.example.com (Anonymous) — Mon, 16 Jul 2012 21:54:56 +0000

SPM A.A. 2011-2012 : support material Previous year material Link to the old page. Suggested reading These are texts that may be consulted as support to different parts of the course: * POSIX syscalls: Stevens “Advanced programming in the Unix Enviroment

SPM 2012-2013 Support material

anonymous@undisclosed.example.com (Anonymous) — Wed, 05 Jun 2013 21:23:58 +0000

SPM 2012-2013 Support material Textbooks This year we will use: * the “SPM course notes” by M. Danelutto (the new version of the course noted (more syntax fixes, chapter 11 on parallel bulding block added, section 8.5 on vectorization added) PDF can be found

SPM 2012-2013

anonymous@undisclosed.example.com (Anonymous) — Thu, 23 May 2013 13:48:30 +0000

SPM 2012-2013 Lessons This is the link to the official lesson register Day Hours Arguments Support material 18/02 16-18 Course introduction. Program. Web site. Exam/project. Overview of parallel architectures. Amdahl law. Blackboard 19/02 16-18 Power and parallelism. More on Amdahl law. Gustafson law. Work-span model

Program

anonymous@undisclosed.example.com (Anonymous) — Mon, 11 Feb 2013 17:23:34 +0000

SPM 2012-2013 exam page

anonymous@undisclosed.example.com (Anonymous) — Wed, 11 Dec 2013 16:06:41 +0000

SPM 2012-2013 exam page Exam procedure The SPM course exam consists in two parts: * the implementation of a project (sse below the project text), and * an oral exam, including a small demo/discussion relative to the project and some questions on the arguments covered by the course

Distributed Systems: Paradigms and Models (A.Y. 2013-2014)

anonymous@undisclosed.example.com (Anonymous) — Tue, 17 Dec 2013 19:39:54 +0000

Distributed Systems: Paradigms and Models (A.Y. 2013-2014) Link to the official lesson register page. Date Hour Arguments Support material 23/09/13 2-4pm Course introduction. Hardware evolution: multicores, GPUs, cloud. Blackboard Audio 1st hourAudio 2nd hour 24/09/13 4-6pm Parallelisation of sample applications: issues and advantages

Program

anonymous@undisclosed.example.com (Anonymous) — Sat, 21 Sep 2013 15:16:19 +0000

SPM 2013-2014 Support material

anonymous@undisclosed.example.com (Anonymous) — Fri, 16 May 2014 12:25:15 +0000

SPM 2013-2014 Support material Textbooks Most of the course material is covered by: * the “SPM course notes” by M. Danelutto (the 2013 version of the course noted (more syntax fixes, chapter 11 on parallel bulding block added, section 8.5 on vectorization added) PDF can be found

Distributed Systems: Paradigms and Models (A.Y. 2014-2015)

anonymous@undisclosed.example.com (Anonymous) — Wed, 17 Dec 2014 08:37:39 +0000

Distributed Systems: Paradigms and Models (A.Y. 2014-2015) Link to the official course lesson page. Exercise page. Date Hour Arguments Audio Blackboard 23/09 4-6pm Introduction to the course. Parallel programming scenario: multi core and many core H1H2 PDF 24/09 4-6pm More on scenario: cloud and mobile. Sample applications with possibilities for parallelism: mandelbrot, video stream processing (to be finshed)

Program

anonymous@undisclosed.example.com (Anonymous) — Fri, 05 Sep 2014 10:10:32 +0000

Textbooks

anonymous@undisclosed.example.com (Anonymous) — Thu, 11 Dec 2014 00:19:55 +0000

Textbooks Most of the course material is covered by: + * the “SPM course notes” by M. Danelutto PDF that can be found here (Version of Sept 2014, A4 size) and here (Version of Sept 2014, EPUB size) . Updates and additional material will be made available during the lessons and PDF links will included on this page, in case.

Distributed Systems: Paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Tue, 15 Dec 2015 16:31:36 +0000

Distributed Systems: Paradigms and models Official lesson register Lessons Day Hours Argument Blackboard Multimedia Sept. 21 0 Lessons will start on Sept. 22nd Sept. 22 2 Course introduction blackboard Video Sept. 23 2 Parallel programming: concurrent activity and orchestration concepts. Sample use cases (with patterns)

Program

anonymous@undisclosed.example.com (Anonymous) — Wed, 16 Sep 2015 17:06:59 +0000

SPM 2015/16 Support material

anonymous@undisclosed.example.com (Anonymous) — Thu, 14 Jul 2016 13:42:12 +0000

SPM 2015/16 Support material * the “SPM course notes” by M. Danelutto PDF that can be found here (Version of Sept 2014, A4 size) and here (Version of Sept 2014, EPUB size) . Updates and additional material will be made available during the lessons and PDF links will included on this page, in case.

Skandium.java

anonymous@undisclosed.example.com (Anonymous) — Mon, 18 Nov 2013 11:10:31 +0000

Skandium.java This is the correct code of the Skandium.java file (patch due to Tiziano De Matteis). /* Skandium: A Java(TM) based parallel skeleton library. * * Copyright (C) 2009 NIC Labs, Universidad de Chile. * * Skandium is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * Skandium…

Skandium

anonymous@undisclosed.example.com (Anonymous) — Mon, 26 Oct 2015 06:18:57 +0000

Skandium Skandium is the Java based skeleton based programming framework by Mario Leyton, targeting multicore architectures. The Skandium web page hosts sample code and documentation as well as links to download the source and compiled framework code. The Skandium material may also be found on a GIT repository as well at the side

Skandium

anonymous@undisclosed.example.com (Anonymous) — Wed, 03 Dec 2014 18:08:06 +0000

OCAML functional semantics for the sample skeleton set

anonymous@undisclosed.example.com (Anonymous) — Thu, 31 Mar 2011 08:36:00 +0000

OCAML functional semantics for the sample skeleton set We define here the functional semantics for the sample skeleton set presented in SPM lessons by means of Ocaml functions. * Here you'll find the ocamldoc documentation for the file. Below, the source file is shown.

SKEPU container sample code

anonymous@undisclosed.example.com (Anonymous) — Mon, 28 Oct 2013 17:29:09 +0000

SKEPU container sample code #include #define SKEPU_OMP #include "skepu/vector.h" #include "skepu/matrix.h" #define N 16 #define M 16 using namespace std; int main() { skepu::Vector v(N,0.0); skepu::Matrix m(N,M,0.0); cout << "Initialized matrix and vector" << endl; for(int i=0; i

SKEPU mapreduce code sample

anonymous@undisclosed.example.com (Anonymous) — Mon, 28 Oct 2013 17:35:08 +0000

SKEPU mapreduce code sample We show an implementation of vector dotproduct with both mapreduce and with a map followed by a reduce, to appreciate optimizations in the mapreduce skeleton. // following define to enable/disable OpenMP implmentation to be used // #define SKEPU_OPENMP #define SKEPU_CUDA // following define to enable/disable OpenCL implmentation to be used //#define SKEPU_OPENCL // With OpenCL, following define to specify number of GPUs to be used. Specifying 0 means all availab…

SKEPU (for SPM)

anonymous@undisclosed.example.com (Anonymous) — Mon, 28 Oct 2013 17:37:00 +0000

SKEPU (for SPM) The framework SKEPU is a C++ based skeleton programming framework targeting CPUs and GPUs. The framework (currently at version 1.0) may downloaded from the SKEPU web page, where source code and documentation are available. Sample code This is the code used to introduce the framework:

SKEPU reduce sample code

anonymous@undisclosed.example.com (Anonymous) — Mon, 28 Oct 2013 17:31:45 +0000

SKEPU reduce sample code #include #define SKEPU_OPENMP #include "skepu/vector.h" #include "skepu/matrix.h" #include "skepu/reduce.h" using namespace std; // definition of functions to be used in the map and reduce UNARY_FUNC(inc, int, a, return(a+1); ) UNARY_FUNC(dec, int, a, return(a-1); ) UNARY_FUNC(sq, int, a, return(a*a); ) BINARY_FUNC(add, int, a, b, return(a+b); ) BINARY_FUNC(sub, int, a, b, return(a-b); ) BINARY_FUNC(mul, int, a, b, return(a*b); ) BINARY_FUNC(div, in…

Using SkePU in FastFlow

anonymous@undisclosed.example.com (Anonymous) — Fri, 11 May 2012 13:15:59 +0000

Using SkePU in FastFlow Sample code We implement a three stage FastFlow pipeline where: * the first stage produces a stream of float Vectors * the second stage maps a dummy (time consuming) function on the Vector items * the third stage just prints results

SPM SkePU sample code

anonymous@undisclosed.example.com (Anonymous) — Fri, 11 May 2012 13:00:53 +0000

SPM SkePU sample code Containers Illustrates the usage of Vectors and Matrixes. To execute the code: * on CPU: compile it using g++ -I skepuinclude containers.cpp -o cpu_containers * on GPU: uncomment the macro defining SKEPU_CUDA and compile with

"Lesson" project slides

anonymous@undisclosed.example.com (Anonymous) — Thu, 18 Mar 2010 14:35:48 +0000

"Lesson" project slides These are the slides relative to the “lesson” projects for the A.A. 2009/2010 Author Argument Slides Marco Stronati Skeletons in Erlang [PDF]

Sample sources

anonymous@undisclosed.example.com (Anonymous) — Wed, 15 Oct 2014 15:13:46 +0000

Sample sources C version with timings (to be compiled with gcc -pthread -lm) #include #include #include #include #include #include pthread_mutex_t mutex; typedef struct __task { long n; float x; struct __task * next; } TASK; TASK * tasks = NULL; typedef unsigned long long ticks; static __inline__ ticks getticks(void) { unsigned a, d; asm volatile("rdtsc" : "=a" (a), "=d" (d)); return ((ticks)a) | (((ticks)d) << 32)…

Final project page : SPM 09-10

anonymous@undisclosed.example.com (Anonymous) — Fri, 26 Feb 2010 15:01:06 +0000

Final project page : SPM 09-10 Project text The project texts can be found in the Slides presented during lessons. Project types For Academic Year 2009-2010, several distinct classes of projects have been proposed: * RTS: implementation of a small run time/compiler tool for structured programming paradigms/models

SPM 2009-2010: Exams

anonymous@undisclosed.example.com (Anonymous) — Tue, 15 Feb 2011 07:11:24 +0000

SPM 2009-2010: Exams Final project More on the Project texts and Report format can be found at the project page. Slides of the "Lesson" projects This page hosts the slides presented for the “Lesson” projects.

Class work 1

anonymous@undisclosed.example.com (Anonymous) — Wed, 17 Dec 2014 06:29:20 +0000

Class work 1 Instructions to use the remote machine Once you have implemented on your own laptop the program, in order to test it on andromeda (the 8 core, 16 contexts machine remotely available, do the following steps: * ssh spm@andromeda.di.unipi.it

Pipeline with Pthreads, sample code

anonymous@undisclosed.example.com (Anonymous) — Thu, 30 Oct 2014 11:43:04 +0000

Pipeline with Pthreads, sample code Sample code relative to * implementation of an unbounded channel with standard C++ and Pthread mechanisms * implementation of the main forking the three stages and computing the pipeline * implementation of a bounded channel

SPM 2010-2011: Exams, lessons and support material

anonymous@undisclosed.example.com (Anonymous) — Wed, 07 Dec 2011 15:16:24 +0000

SPM 2010-2011: Exams, lessons and support material Exam calendar Date Time Candidates July 26, Tuesday 3pm Belli, Cicalese July 27, Wednesday 10am Dondi, Piermartini, Saracco July 28, Thursday 11am Vetrano July 29, Friday 11am Del Tessandoro

SPM 2011-2012 exam page

anonymous@undisclosed.example.com (Anonymous) — Thu, 17 Jan 2013 16:37:04 +0000

SPM 2011-2012 exam page Exam procedure The SPM course exam consists in two parts: * the implementation of a project (sse below the project text), and * an oral exam, including a small demo/discussion relative to the project and some questions on the arguments covered by the course

Collection of code (Academic Year 2012/2013)

anonymous@undisclosed.example.com (Anonymous) — Tue, 30 Apr 2013 16:54:15 +0000

Collection of code (Academic Year 2012/2013) Lesson: April 11, 2013 * Code for map and stencil with OpenMP * Code of a map implemented using a FastFlow farm (Matrix Multiplication code) * Map defined in FastFlow * Map targeting GPU with CUDA (trivial, draft code)

anonymous@undisclosed.example.com (Anonymous) — Tue, 16 Apr 2013 16:07:53 +0000

#include #include #include using namespace ff; using namespace std; int n; float ** mat; float * vec; typedef struct __task { int id; int start; int end; } TASK; class Emitter : public ff_node { private: int chunk; public: Emitter(int chunk):chunk(chunk) { } void * svc(void * t) { int given = 0; int id = 0; while(given < n) { TASK * otask = new TASK(); otask->start = given; otask…

anonymous@undisclosed.example.com (Anonymous) — Tue, 16 Apr 2013 16:08:30 +0000

#include #include #include #include using namespace ff; using namespace std; typedef struct __task { int id; int start; int end; } TASK; typedef union __res { float x; float pad[16]; } RES; int n; float ** mat; RES * vec; class Emitter : public ff_node { private: int chunk; public: Emitter(int chunk):chunk(chunk) { } void * svc(void * t) { int given = 0; int id = 0; while(given < n)…

anonymous@undisclosed.example.com (Anonymous) — Mon, 22 Apr 2013 16:19:03 +0000

#include #include #include #include #include #include #include "ff/farm.hpp" using namespace std; using namespace ff; float **a; int n; float calc(float x) { long iter = (long) x; for(long i=0; i

anonymous@undisclosed.example.com (Anonymous) — Wed, 24 Apr 2013 06:24:37 +0000

#include #include #include #include #include #include #include "ff/farm.hpp" using namespace std; using namespace ff; float **a; int n; float calc(float x) { long iter = (long) x; for(long i=0; ifro…

anonymous@undisclosed.example.com (Anonymous) — Thu, 11 Apr 2013 15:05:53 +0000

This is from the official distribution of FastFlow /* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */ /*! * \link * \file map.hpp * \ingroup high_level_patterns_shared_memory * * \brief This file describes the map skeleton. */ #ifndef _FF_MAP_HPP_ #define _FF_MAP_HPP_ /* *************************************************************************** * * This program is free software; you can redistribute it and/or modify it * under the terms of the …

anonymous@undisclosed.example.com (Anonymous) — Thu, 11 Apr 2013 15:04:02 +0000

#include #include #include #include using namespace ff; // a task requires to compute the matrix multiply C = A x B // we assume square matrixes, for the sake of simplicity typedef struct { int n; float **a; float **b; float **c; } TASK; // a subtask is the computation of the inner product or A, row i, by B, col j typedef struct { int i,j; TASK * t; } SUBTASK; // a partial result is the i,j item in the result matrix typedef struct…

anonymous@undisclosed.example.com (Anonymous) — Thu, 11 Apr 2013 15:08:29 +0000

Code to be compiled with a nvcc -I fastflowInclude #include #include #include #include using namespace ff; /* * map module running the map of function float f(float) * over a float vector whose size is known on a GPU through CUDA * */ #include #include /* * sample map function */ __device__ float f(float x) { float old = x; for(int i=0; i<8000000; i++) { x = sin(x); } return(old+1.0+x…

anonymous@undisclosed.example.com (Anonymous) — Tue, 30 Apr 2013 16:57:16 +0000

#include #include #include #include #include #include using namespace ff; using namespace std; int N = 10; class Source: public ff_node { public: Source(unsigned int streamlen):streamlen(streamlen) {} void * svc(void * task) { if(streamlen != 0) { skepu::Vector * v = new skepu::Vector(N,(float)streamlen); streamlen--; task = (void *) v; #ifdef DEBUG std::cout …

anonymous@undisclosed.example.com (Anonymous) — Tue, 30 Apr 2013 16:51:40 +0000

Compile with g++ -DSKEPU_CUDA -DSKEPU_OPENMP_THREADS=4 -fopenmp -o cpu -I . -I include pipemap.cpp -lpthread to target CPU cores via OpenMP SKEPU backend or nvcc -o cuda -I. -Iinclude pipemap.cu to target GPU via CUDA backend. #include #include #include #include #include using namespace ff; int N = 10; class Source: public ff_node { public: Source(unsigned int streamlen):streamlen(streamlen) {} …

anonymous@undisclosed.example.com (Anonymous) — Tue, 30 Apr 2013 16:55:20 +0000

#include #include #include #include "omp.h" #include using namespace std; float f(float x, long n) { for(long i=0; i

anonymous@undisclosed.example.com (Anonymous) — Mon, 22 Apr 2013 16:17:30 +0000

#include #include #include #include #include #include using namespace std; float **a; float calc(float x) { long iter = (long) x; for(long i=0; i

anonymous@undisclosed.example.com (Anonymous) — Thu, 11 Apr 2013 15:02:52 +0000

#include "omp.h" #include #include using namespace std; template class OmpMap { private: OutTask (*fun) (InTask t); int nw; public: OmpMap(OutTask (*fun) (InTask t), int nw):fun(fun),nw(nw) {} // map over std:vector std::vector compute(std::vector v) { int i, n = v.size(); vector * r = new vector(n); #pragma omp parallel for num_threads(nw) private(i) for(i=0; i

anonymous@undisclosed.example.com (Anonymous) — Tue, 30 Apr 2013 16:56:02 +0000

#include #include #include #include "omp.h" #include using namespace std; float f(float x, long n) { for(long i=0; i

anonymous@undisclosed.example.com (Anonymous) — Wed, 24 Apr 2013 06:25:41 +0000

#include #define SKEPU_OMP #include "skepu/vector.h" #include "skepu/matrix.h" #define N 16 #define M 16 using namespace std; int main() { skepu::Vector v(N,0.0); skepu::Matrix m(N,M,0.0); cout << "Initialized matrix and vector" << endl; for(int i=0; i

anonymous@undisclosed.example.com (Anonymous) — Wed, 24 Apr 2013 06:26:36 +0000

#include #define SKEPU_CUDA #include "skepu/vector.h" #include "skepu/matrix.h" #include "skepu/map.h" using namespace std; // definition of functions to be used in the map and reduce UNARY_FUNC(inc, int, a, return(a+1); ) UNARY_FUNC(dec, int, a, return(a-1); ) UNARY_FUNC(sq, int, a, return(a*a); ) BINARY_FUNC(add, int, a, b, return(a+b); ) BINARY_FUNC(sub, int, a, b, return(a-b); ) BINARY_FUNC(mul, int, a, b, return(a*b); ) BINARY_FUNC(div, int, a, b, return(a/b); ) #define…

anonymous@undisclosed.example.com (Anonymous) — Wed, 24 Apr 2013 06:27:51 +0000

#include #include "skepu/vector.h" #include "skepu/matrix.h" #include "skepu/reduce.h" using namespace std; // definition of functions to be used in the map and reduce UNARY_FUNC(inc, int, a, return(a+1); ) UNARY_FUNC(dec, int, a, return(a-1); ) UNARY_FUNC(sq, int, a, return(a*a); ) BINARY_FUNC(add, int, a, b, return(a+b); ) BINARY_FUNC(sub, int, a, b, return(a-b); ) BINARY_FUNC(mul, int, a, b, return(a*b); ) BINARY_FUNC(div, int, a, b, return(a/b); ) #define N 4 int main() …

Xeon PHI HOWTO (for SPM1314 course)

anonymous@undisclosed.example.com (Anonymous) — Tue, 17 Dec 2013 13:57:00 +0000

Xeon PHI HOWTO (for SPM1314 course) Access The machine with the Xeon PHI cards may be accessed using the IP address 131.114.137.225 and the credentials distributed during the lessons to the attending students. The credentials give access to a local account onto a Sandy Bridge multicore hosting the 2 PHI PCIe boards.

SPM 2013-2014 Project

anonymous@undisclosed.example.com (Anonymous) — Wed, 30 Jul 2014 07:51:17 +0000

SPM 2013-2014 Project Exam procedure The SPM course exam consists in two parts: * the implementation of a project (sse below the project text), and * an oral exam, including a small demo/discussion relative to the project and some questions on the arguments covered by the course

SPM 2015 final project

anonymous@undisclosed.example.com (Anonymous) — Mon, 05 Oct 2015 08:12:29 +0000

SPM 2015 final project Final project text The final project text includes three different possibilities for two different kind of projects, namely the implementation of a parallel pattern and the parallelization of a well known application/kernel. The full text (PDF document) of the project may be found following

SPM 2015/16 Exams

anonymous@undisclosed.example.com (Anonymous) — Mon, 03 Oct 2016 13:16:11 +0000

SPM 2015/16 Exams Project The text for the project is available on this page PHI performance In the lessons we stated performance of Xeon PHI is 2 to 4 times smaller than the performance observed on the host machine Xeon processors. Actually, performance scale factor varies depending on the kind of code executed. Code with quite a number of branches may experience 10x and more slowdown w.r.t. host Xeon processor.

Final project

anonymous@undisclosed.example.com (Anonymous) — Thu, 21 Jan 2016 12:18:57 +0000

Final project The final SPM project is structured in 5 different alternatives. Students should agree which one they want to choose with the Professor before actually starting to implement the project. Alternatives Game of Life (GOL) Game of Life has already been assigned as a kind of

Distributed systems : paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Mon, 19 Sep 2016 05:31:24 +0000

Distributed systems : paradigms and models Support material

Access to Xeon PHI

anonymous@undisclosed.example.com (Anonymous) — Tue, 21 Feb 2017 16:02:52 +0000

Access to Xeon PHI This instructions are relative to the Xeon PHI Knights Corner. The additional instructions to access the PHI Knights Landing may be found here. List of assigned accounts Here Machine name and access The machine is r720-phi.itc.unipi.it and has the IP address 131.114.137.225

First SPM term (oral)

anonymous@undisclosed.example.com (Anonymous) — Tue, 24 Jan 2017 17:49:09 +0000

First SPM term (oral) The oral exams relative to the first term of Academic Year 2016/17 will be run on Friday, January 27th, starting at 9.30am, at the professor's studio, in the following order (count 30-40 minutes per exam, ideally): * Bekele Biruk

SPM A.Y. 2016-17

anonymous@undisclosed.example.com (Anonymous) — Sun, 19 Feb 2017 20:16:19 +0000

SPM A.Y. 2016-17 Oral exams: * Tuesday, Feb. 21, 11am: Michienzi, Madotto

SPM Third term exam calendar

anonymous@undisclosed.example.com (Anonymous) — Wed, 21 Jun 2017 09:22:12 +0000

SPM Third term exam calendar The oral exams will be run on June, Thursday 22 and Friday 23. The precise schedule will published on this page by morning of June, Wed. 21. I've correctly got the projects from: * Busi, Carta, Cipressi, Errica, Palazzo, Erdem, Slovikovskaya, Sedghisaray

SPM extraordinary exam term (Nov. 2016): Calendar of the oral exams

anonymous@undisclosed.example.com (Anonymous) — Thu, 03 Nov 2016 16:11:57 +0000

SPM extraordinary exam term (Nov. 2016): Calendar of the oral exams Fri, Nov. 5, 9.30am * DiSotto, Dzevik, Parra Gutzman, Maggiordomo Mon, Nov. 7, 11am * Conticelli Wed, Nov. 9, 10am * Tsinu, Tesei All exams will be in my office, at the Dept. of Computer Science

Sample Cilk plus code

anonymous@undisclosed.example.com (Anonymous) — Tue, 08 Nov 2016 16:45:13 +0000

Sample Cilk plus code Fibonacci Codice: #include #include #include #include #include int fib(int n) { // std::cout << "This is thread " << std::this_thread::get_id() // << std::endl; if(n<2) return(1); else { #ifdef WITHCILK int f1 = _Cilk_spawn fib(n-1); int f2 = _Cilk_spawn fib(n-2); _Cilk_sync; return (f1 + f2); #else return(fib(n-1) + fib(n-2)); #endif } } int main(int argc, char * argv […

SPM 2015/16 Exams

anonymous@undisclosed.example.com (Anonymous) — Fri, 04 Aug 2017 10:42:38 +0000

SPM 2015/16 Exams Exam dates Term Deadline for submitting project Oral exams calendar Extraordinary term November 2nd, 2016 Calendar First term 2016-17 January 17th, 2017 Calendar Second term 2016-17 February 13rd, 2017 Calendar Extraordinary term April 6th, 2017 (deadline to submit the projects)

Xeon PHI KNL howto

anonymous@undisclosed.example.com (Anonymous) — Thu, 19 Jan 2017 16:10:24 +0000

Xeon PHI KNL howto README FIRST In case you see messages on the terminal(s) used requiring you to leave the machine from any one of the following users: * mau * cisterni * marcod * torquati please logout immediately after killing all your processes (foreground and backgroud). The machine is provided by the ITC and it may be the case it will be needed for short demos and experiments.

Distributed Systems: Paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Thu, 15 Dec 2016 09:34:32 +0000

Distributed Systems: Paradigms and models Official lesson register Register (official) Lessons Day Hours Argument Blackboard Multimedia Sept. 19 2 Course introduction. Real life examples of parallel and distributed computing. Motivations. (Partial audio video support due to laptop substitution)

Program

anonymous@undisclosed.example.com (Anonymous) — Mon, 19 Sep 2016 05:25:52 +0000

Sort (with Cilk and C++ (11) Threads)

anonymous@undisclosed.example.com (Anonymous) — Wed, 09 Nov 2016 15:22:25 +0000

Sort (with Cilk and C++ (11) Threads) Assignment Write a program that * generates a vector with N items filled with random values * sorts the vector (in parallel) Provide two versions of the program, one implemented using Cilk and one implemented using standard

Distributed systems: paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Wed, 05 Oct 2016 16:26:06 +0000

Distributed systems: paradigms and models Support material Books and notes * the “SPM course notes” by M. Danelutto PDF that can be found here (Version of Sept 2014, A4 size) and here (Version of Sept 2014, EPUB size) . Updates and additional material will be made available during the lessons and PDF links will included on this page, in case. This year I'm preparing a new introductory part that will be available before the end of the course, hopefully by end of October, beginning of Novemb…

Access to Xeon PHI

anonymous@undisclosed.example.com (Anonymous) — Fri, 12 Jan 2018 09:25:44 +0000

Access to Xeon PHI This instructions are relative to the Xeon PHI Knights Corner. The additional instructions to access the PHI Knights Landing may be found here. Machine name and access The machine is r720-phi.itc.unipi.it and has the IP address 131.114.137.225

Thesis arguments available

anonymous@undisclosed.example.com (Anonymous) — Tue, 21 May 2013 14:06:39 +0000

Thesis arguments available Related to the SPM courses, different thesis arguments are available, under supervision of course professor, including: Implementation of a generic macro data flow engine in FastFlow * joint supervision: M. Danelutto, M. Coppola

Distributed systems: paradigms and models

anonymous@undisclosed.example.com (Anonymous) — Thu, 18 Jan 2018 11:34:19 +0000

Distributed systems: paradigms and models Teacher: Marco Danelutto Assistant: Dr. Massimo Torquati Question time: Thu, 3pm - 6pm, room 364, Dept. Computer Science Master (Laurea Magistrale): Computer Science and Networking Lesson Timetable : Recover course (first semester) Day Time Place Tue 14-16 Aula Multimediale, Dept. Computer Science (without prof)

Timetable

anonymous@undisclosed.example.com (Anonymous) — Thu, 25 Jan 2018 14:17:56 +0000

Timetable Room Day Hour What X1 Tuesday 11.00-13.00 Lesson (with prof) Multimedia room Tuesday 14-16 Reading and Excercise (without prof) Next lessons will be on Tuesday Oct. 3, 11am Room X1 and Tuesday Oct. 3 14pm in the multimedia room (Dept. of Computer Science).

Sample code 1

anonymous@undisclosed.example.com (Anonymous) — Tue, 14 Nov 2017 11:18:03 +0000

Sample code 1 #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include using namespace std; typedef struct { int start; int end; } RANGE; int main(int argc, char * argv[]) { st…