Return-Path: Delivered-To: magniez@irif.fr Received: from mailhub.math.univ-paris-diderot.fr ([81.194.30.253]) by mailhost.irif.fr (Dovecot) with LMTP id CVjZL62fKV4KegAAP9ZUWg for ; Thu, 23 Jan 2020 14:29:17 +0100 Received: from mailhub.math.univ-paris-diderot.fr (localhost [127.0.0.1]) by mailhub.math.univ-paris-diderot.fr (Postfix) with ESMTP id BFC19C8F4F; Thu, 23 Jan 2020 14:29:17 +0100 (CET) X-Virus-Scanned: amavisd-new at math.univ-paris-diderot.fr X-Spam-Flag: NO X-Spam-Score: -1.898 X-Spam-Level: X-Spam-Status: No, score=-1.898 tagged_above=-10000 required=5 tests=[BAYES_00=-1.9, HTML_MESSAGE=0.001, URIBL_BLOCKED=0.001] autolearn=ham autolearn_force=no Received: from mailhub.math.univ-paris-diderot.fr ([127.0.0.1]) by mailhub.math.univ-paris-diderot.fr (mailhub.math.univ-paris-diderot.fr [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id DEFsJlYusSMY; Thu, 23 Jan 2020 14:29:13 +0100 (CET) Received: from potemkin.univ-paris7.fr (potemkin.univ-paris7.fr [194.254.61.141]) by mailhub.math.univ-paris-diderot.fr (Postfix) with ESMTPS id B4764C8F4D; Thu, 23 Jan 2020 14:29:13 +0100 (CET) Received: from mataram.parisdescartes.fr (mataram.parisdescartes.fr [193.51.86.55]) by potemkin.univ-paris7.fr (8.14.4/8.14.4/relay2/82085) with ESMTP id 00NDTACn027505; Thu, 23 Jan 2020 14:29:10 +0100 Received: from localhost (saroumane-i.univ-paris5.fr [192.168.253.9]) by mataram.parisdescartes.fr (Postfix) with ESMTP id 89F138C0EB; Thu, 23 Jan 2020 14:29:13 +0100 (CET) X-Virus-Scanned: amavisd-new at univ-paris5.fr Received: from mataram.parisdescartes.fr ([192.168.253.4]) by localhost (fourmilier.univ-paris5.fr [192.168.253.9]) (amavisd-new, port 10026) with ESMTP id nZ_CAGWyDqVK; Thu, 23 Jan 2020 14:29:12 +0100 (CET) Received: from [172.30.44.200] (wifi-pro-172-30-44-200.wifi.univ-paris5.fr [172.30.44.200]) by mataram.univ-paris5.fr (Postfix) with ESMTPSA id ECEF728C003; Thu, 23 Jan 2020 12:49:08 +0100 (CET) From: Themis Palpanas Subject: LIPADE: 4 lectures on concurrent computing, Jan28-31 at 11-1pm To: Themis Palpanas Message-ID: Date: Thu, 23 Jan 2020 12:49:08 +0100 User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:68.0) Gecko/20100101 Thunderbird/68.4.1 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="------------DC32C1182C95C55AE1E19B85" Content-Language: en-US X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-4.2.7 (potemkin.univ-paris7.fr [194.254.61.141]); Thu, 23 Jan 2020 14:29:10 +0100 (CET) X-Miltered: at potemkin with ID 5E299FA6.000 by Joe's j-chkmail (http : // j-chkmail dot ensmp dot fr)! X-j-chkmail-Enveloppe: 5E299FA6.000 from mataram.parisdescartes.fr/mataram.parisdescartes.fr/null/mataram.parisdescartes.fr/ X-j-chkmail-Score: MSGID : 5E299FA6.000 on potemkin.univ-paris7.fr : j-chkmail score : . : R=. U=. O=. B=0.000 -> S=0.000 X-j-chkmail-Status: Ham This is a multi-part message in MIME format. --------------DC32C1182C95C55AE1E19B85 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Dear colleagues, You may be interested in the concurrent computing lectures below. Please feel free to share the information with your students/other interested parties. Thanks, Themis Supported by ERASMUS: *Graduate Level (or Advanced Undergraduate) Seminar Series on* *Concurrent Computing is ubiquitous!* *Prof. Panagiota Fatourou * *University of Crete, FORTH (Greece)* * * *when: January 28, 29, 30, 31 at 11-1pm * *where: room Turing Reunion (45 rue des Saints Peres, 7th floor: right after exiting the elevators) * * * *Seminar Summary. *Due to the proliferation of multi-core machines and the growing applications' demands in computational power, we soon expect to see the first many-cores that will feature hundreds or even thousands of cores. Therefore, introducing as much parallelism as possible into software applications has become ever so urgent. A major obstacle in this direction comes from the difficulty of developing concurrent data structures and algorithms. This difficulty is inherent in achieving efficient synchronization and communication between processes that run concurrently. This seminar focuses on the design and analysis of concurrent algorithms and studies major techniques for the efficient introduction of parallelism in your sequential code and application. It is geared towards graduate students at all levels as well as advanced undergraduates. The seminar is comprised of four lectures of two hours each that will provide *independent* and complementary concurrent computing knowledge as described below. *Lecture 1 (Jan28 11-1pm): Welcome to the real world! The harsh realities of parallelization* The lecture will focus on answering 1) why is concurrent programming ubiquitous? 2) why is it so hard? 3) what are the laws that govern it? 3) which are the most naïve synchronization techniques and why aren’t they enough for the efficient synchronization of a concurrent system. *Lecture 2 (Jan29 11-1pm): Locks and contention. State of the art synchronization mechanisms. *** Welcome to real world! What are the subtleties encountered when moving from theory to practice? Why and how different lock implementations and synchronization mechanisms could make a difference? Contention bottlenecks and how can we analyze them and understand synchronization costs in our codes? *Lecture 3 (Jan30 11-1pm): *The art of designing concurrent data structures: queues and lists as case studies. From sequential to concurrent data structures. How do we come up with concurrent implementations of basic data structures? This lecture will cover all we need to know to efficiently design simple concurrent data structures, such as queues and linked lists. *Lecture 4 ( Jan31 11-1pm): *Enhanced concurrent data structures and garbage collection. This lecture will focus on elaborated concurrent data structures. We will also discuss how we define correctness and liveness in a concurrent setting. Finally, we will touch upon issues of garbage collection in concurrent settings. *Major learning outcomes. * The major objectives of the seminar are: ·To understand the major techniques that allow programmers to effectively program the parts of the code that require substantial communication and synchronization; ·To study the core ideas behind modern coordination and communication paradigms and concurrent data structures; ·To realize not only the basic principles but also the best practice engineering techniques of concurrent and distributed computing; ·To analyze the performance of current multi-core and future many-core systems. *Short Bio. * Panagiota Fatourou is an Associate Professor at the Department of Computer Science of the University of Crete , Greece and the Institute of Computer Science (ICS) of the Foundation for Research and Technology - Hellas (FORTH) . She has been a visiting Professor at the School of Computer and Communication Sciences , École Polytechnique Fédérale de Lausanne in Switzerland. Prior to joining the University of Crete and FORTH ICS , she was a full-time faculty member at the Department of Computer Science & Engineering of the University of Ioannina . She has worked as a postdoc at Max-Planck Institut für Informatik , Saarbrücken, Germany, and at the Computer Science Department of the University of Toronto , Canada. Panagiota Fatourou is the chair of the ACM Europe Council . She has served as the editor of the Distributed Computing Column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS ) and as the General Chair of the ACM Symposium on Principles of Distributed Computing (PODC 2013 ). She is a member-at-large of the steering committees of the ACM Symposium on Principles of Distributed Computing (PODC) and of the International Conference on Principles of Distributed Systems (OPODIS). She has participated in the PC of 38 conferences. She has been an ACM Distinguished Speaker . Panagiota Fatourou has been the coordinator of a Marie-Curie Initial Training Network and she has participated in many additional research and development projects mostly funded by the European Commission. Her research interests focus on parallel and distributed computing. Her research work appears in the most prestigious conferences and journals in her field. -- --------------------------------------------------------- Prof. Themis Palpanas Senior Member of the French University Institute (IUF) Director of LIPADE (Computer Science dept.) http://www.mi.parisdescartes.fr/~themisp/ LIPADE - University of Paris 45 Rue Des Saints-Peres Paris 75006, France tel: +33-1-7653-0365 --------------------------------------------------------- --------------DC32C1182C95C55AE1E19B85 Content-Type: text/html; charset=utf-8 Content-Transfer-Encoding: 8bit
Dear colleagues,

You may be interested in the concurrent computing lectures below.
Please feel free to share the information with your students/other interested parties.

Thanks,
Themis





Supported by ERASMUS:


Graduate Level (or Advanced Undergraduate) Seminar Series on

Concurrent Computing is ubiquitous!

Prof. Panagiota Fatourou

University of Crete, FORTH (Greece)


when: January 28, 29, 30, 31 at 11-1pm

where: room Turing Reunion (45 rue des Saints Peres, 7th floor: right after exiting the elevators)


Seminar Summary. Due to the proliferation of multi-core machines and the growing applications' demands in computational power, we soon expect to see the first many-cores that will feature hundreds or even thousands of cores. Therefore, introducing as much parallelism as possible into software applications has become ever so urgent. A major obstacle in this direction comes from the difficulty of developing concurrent data structures and algorithms. This difficulty is inherent in achieving efficient synchronization and communication between processes that run concurrently.

This seminar focuses on the design and analysis of concurrent algorithms and studies major techniques for the efficient introduction of parallelism in your sequential code and application. It is geared towards graduate students at all levels as well as advanced undergraduates.

The seminar is comprised of four lectures of two hours each that will provide independent and complementary concurrent computing knowledge as described below.

Lecture 1 (Jan28 11-1pm): Welcome to the real world! The harsh realities of parallelization

The lecture will focus on answering 1) why is concurrent programming ubiquitous? 2) why is it so hard? 3) what are the laws that govern it? 3) which are the most naïve synchronization techniques and why aren’t they enough for the efficient synchronization of a concurrent system.

Lecture 2 (Jan29 11-1pm): Locks and contention. State of the art synchronization mechanisms.

Welcome to real world! What are the subtleties encountered when moving from theory to practice? Why and how different lock implementations and synchronization mechanisms could make a difference? Contention bottlenecks and how can we analyze them and understand synchronization costs in our codes?

Lecture 3 (Jan30 11-1pm): The art of designing concurrent data structures: queues and lists as case studies.

From sequential to concurrent data structures. How do we come up with concurrent implementations of basic data structures? This lecture will cover all we need to know to efficiently design simple concurrent data structures, such as queues and linked lists.

Lecture 4 ( Jan31 11-1pm): Enhanced concurrent data structures and garbage collection.

This lecture will focus on elaborated concurrent data structures. We will also discuss how we define correctness and liveness in a concurrent setting. Finally, we will touch upon issues of garbage collection in concurrent settings.


Major learning outcomes.

The major objectives of the seminar are:

·       To understand the major techniques that allow programmers to effectively program the parts of the code that require substantial communication and synchronization;

·       To study the core ideas behind modern coordination and communication paradigms and concurrent data structures;

·       To realize not only the basic principles but also the best practice engineering techniques of concurrent and distributed computing;

·       To analyze the performance of current multi-core and future many-core systems.

 

Short Bio.

Panagiota Fatourou is an Associate Professor at the Department of Computer Science of the University of Crete, Greece and the Institute of Computer Science (ICS) of the Foundation for Research and Technology - Hellas (FORTH). She has been a visiting Professor at the School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne in Switzerland. Prior to joining the University of Crete and FORTH ICS, she was a full-time faculty member at the Department of Computer Science & Engineering of the University of Ioannina. She has worked as a postdoc at Max-Planck Institut für Informatik, Saarbrücken, Germany, and at the Computer Science Department of the University of Toronto, Canada.

Panagiota Fatourou is the chair of the ACM Europe Council. She has served as the editor of the Distributed Computing Column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS) and as the General Chair of the ACM Symposium on Principles of Distributed Computing (PODC 2013). She is a member-at-large of the steering committees of the ACM Symposium on Principles of Distributed Computing (PODC) and of the International Conference on Principles of Distributed Systems (OPODIS). She has participated in the PC of 38 conferences. She has been an ACM Distinguished Speaker. 

Panagiota Fatourou has been the coordinator of a Marie-Curie Initial Training Network and she has participated in many additional research and development projects mostly funded by the European Commission. Her research interests focus on parallel and distributed computing. Her research work appears in the most prestigious conferences and journals in her field.



-- 
---------------------------------------------------------
  Prof. Themis Palpanas
  Senior Member of the French University Institute (IUF)
  Director of LIPADE (Computer Science dept.)
  http://www.mi.parisdescartes.fr/~themisp/

  LIPADE - University of Paris
  45 Rue Des Saints-Peres
  Paris 75006, France

  tel:   +33-1-7653-0365
---------------------------------------------------------
--------------DC32C1182C95C55AE1E19B85--