Onward! Essays 2020
ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and
Reflections on Programming and Software
Renaissance Chicago Downtown Hotel
Chicago, USA
November 18--20 2020
Part of SPLASH 2020
Systems, Programming Languages and Applications:
Software for Humanity
https://2020.splashcon.org/track/splash-2020-Onward-essays
Onward! is a premier multidisciplinary conference focused on everything to
do with programming and software: including processes, methods, languages,
communities, applications and education.
Compared to other conferences, Onward! is more radical, more visionary, and
more open to ideas that are well-argued but not yet proven. It is not
looking for research-as-usual papers. To allow room for bigger, bolder
and/or less mature ideas, it accepts less exact methods of validation, such
as compelling arguments, exploratory implementations, and substantial
examples.
Onward! Essays is looking for clear and compelling pieces of writing about
topics important to the software community (there is also a parallel Papers
track with a seperate announcement).
An essay can be an exploration of the topic and its impact, or a story about
the circumstances of its creation; it can present a personal view of what
is, explore a terrain, or lead the reader in an act of discovery; it can be
a philosophical digression or a deep analysis. It can describe a personal
journey, perhaps the one the author took to reach an understanding of the
topic. The subject area—software, programming, and programming
languages—should be interpreted broadly and can include the relationship of
software to human endeavors, or its philosophical, sociological,
psychological, historical, or anthropological underpinnings.
Format and Selection:
Onward! essays must describe unpublished work that is not currently
submitted for publication elsewhere as described by SIGPLAN's Republication
Policy. Submitters should also be aware of ACM's Policy and Procedures on
Plagiarism. Onward! essays should use the ACM SIGPLAN Conference acmart
format. Please refer to the conference's website above for full details.
The Onward! Essays track follows a two-phase review process. Essays are
peer-reviewed in a single-blind manner. Accepted essays will appear in the
Onward! Proceedings in the ACM Digital Library, and must be presented at the
conference. Submissions will be judged on the potential impact of the ideas
and the quality of the presentation.
Important dates:
All deadlines are midnight, anywhere on Earth.
Essay submission: 23 April
First-round notification: 11 June
Second-round submission: 15 July
Final notification: 30 July
Conference: 18--20 November
Programme Committee:
Didier Verna, EPITA Research lab, France (Program Chair)
Anya Helene Bagge, University of Bergen, Norway
Alexandre Bergel, University of Chile
Jean Bresson, Ableton, Germany
Maxime Chevalier-Boisvert, Université de Montréal, Québec
Elisa Gonzalez Boix, Vrije Universiteit Brussel, Belgium
Hidehiko Masuhara, Tokyo Institute of Technology, Japan
Kent Pitman, PTC, USA
Donya Quick, Stevens Institute of Technology, USA
Gordana Rakić, University of Novi Sad, Serbia
--
Resistance is futile. You will be jazzimilated.
Jazz site: http://www.didierverna.com
Other sites: http://www.didierverna.info
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 12 février 2020 (10h -- 11h30), Amphi 1.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2020-02-12
[4] http://www.lrde.epita.fr/wiki/Contact
Au programme du Mercredi 12 février 2020 :
* 10h -- 11h30: Informatique Quantique
-- Georges Uzbelger, IBM France
http://www.ibm.com/cognitive/
Dans ce séminaire, nous parlerons d'une technologie émergente qu'est
l'informatique quantique, exploitant les phénomènes quantiques de
l'infiniment petit. Nous verrons que, quand dans le monde de
l'informatique classique, les données sont représentées par des bits
valant chacun 0 ou 1 exclusivement, alors que l'informatique quantique
est déroutante dans le sens où les qubits (bits quantiques) peuvent
valoir simultanément 0 et 1. Afin de pouvoir appréhender cette
technologie, nous rappellerons ce que sont la dualité onde/corpuscule,
la superposition d'états, ainsi que intrication quantique. Nous verrons
aussi comment IBM a créé le premier processeur quantique (ou QPU)
quelques dizaines d'années après l'idée révolutionnaire du père de
l'informatique quantique, Richard Feynman, et quels sont les défis
technologiques qui en découlent. Nous verrons que l’informatique
quantique offre de nouvelles perspectives dans les domaines comme la
cryptographie et l'intelligence artificielle pour ne citer qu'eux. Une
étude des complexités des différents algorithmes vus durant le séminaire
sera évoqué.
Durant cette plénière interactive, une démonstration sera réalisée via
l’environnement de développement Qiskit avec accès à distance à une
machine quantique IBM. Merci donc d'apporter votre ordinateur portable !
-- Diplômé de l’Université Paris IX Dauphine en Mathématiques et
Applications Fondamentales, Georges Uzbelger est depuis 2002 ingénieur
chez IBM France, en charge actuellement de prestations de consulting et
de design de solutions dans le domaine de l’IA, de l’advance analytics
et de l’informatique quantique. Il participe au programme IBM Quantum
Experience pour le développement de l’informatique quantique et
notamment du calcul et de l’algorithmique quantique. Adhérent à la SMF
(Société Mathématique de France) entre autre, il enseigne également à
l’Ecole Polytechnique, à Sorbonne Université (UPMC) et à l’Université
Paris-Dauphine.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d'orateurs.
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
13th European Lisp Symposium
Special Focus on Compilers
In cooperation with: ACM SIGPLAN
Call for papers
April 27 - April 28, 2020
GZ Riesbach
Zürich, Switzerland
http://www.european-lisp-symposium.org/2020
Sponsored by EPITA, Igalia S.L.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Invited Speakers
~~~~~~~~~~~~~~~~
Andrew W. Keep (Cisco Systems, Inc.), on the Nanopass Framework.
Daniel Kochmański (Turtleware), on ECL, the Embeddable Common Lisp.
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: February 13, 2020
- Author notification: March 16, 2020
- Final papers due: April 6, 2020
- Symposium: April 27 - 28, 2020
Scope
~~~~~
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp dialects, including
Common Lisp, Scheme, Emacs Lisp, Clojure, Racket, ACL2, AutoLisp,
ISLISP, Dylan, ECMAScript, SKILL and so on. We encourage everyone
interested in Lisp to participate.
The European Lisp Symposium 2020 invites high quality papers about
novel research results, insights and lessons learned from practical
applications, and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
This year's focus will be directed towards "Compilers".
We especially invite submissions in the following areas:
- Compiler techniques
- Compiler passes
- Compiler compilers
- Showcasing of industrial or experimental compilers
- Code generation
- Compiler verification
- Compiler optimizations
- JIT compilers
Contributions are also welcome in other areas, including but not
limited to:
- Context-, aspect-, domain-oriented and generative programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Language design and implementation
- Language integration, inter-operation and deployment
- Development methodologies, support and environments
- Educational approaches and perspectives
- Experience reports and case studies
Technical Program
~~~~~~~~~~~~~~~~~
We invite submissions in the following forms:
* Papers: Technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
* Demonstrations: Abstracts of up to 4 pages for demonstrations of
tools, libraries, and applications.
* Tutorials: Abstracts of up to 4 pages for in-depth presentations
about topics of special interest for at least 90 minutes and up to
180 minutes.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
http://www.easychair.org/conferences/?conf=els2020
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Ioanna M. Dimitriou H. - Igalia, Spain/Germany
Local Chair
~~~~~~~~~~~
Nicolas Hafner - Shinmera, Switzerland
Programme Committee
~~~~~~~~~~~~~~~~~~~
Andy Wingo - Igalia, Spain/France
Asumu Takikawa - Igalia, Spain/USA
Charlotte Herzeel - Imec, ExaScience Lab, Belgium
Christophe Rhodes - Google, UK
Irène Durand - Université Bordeaux 1, France
Jim Newton - EPITA Research Lab, France
Kent Pitman - HyperMeta, USA
Leonie Dreschler-Fischer - University of Hamburg, Germany
Marco Heisig - FAU Erlangen-Nürnberg, Germany
Mark Evenson - not.org, Austria
Max Rottenkolber - Interstellar Ventures, Germany
Paulo Matos - Igalia, Spain/Germany
Robert Goldman - SIFT, USA
Robert Strandh - Université Bordeaux 1, France
Sky Hester - consultant, USA
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
Hi Everyone,
We are pleased to announce that we have a paper accepted for presentation at the 2020 Trends in Functional Programming Symposium (http://www.cse.chalmers.se/~rjmh/tfp/).
The corresponding paper is available reading at https://www.lrde.epita.fr/dload/papers/newton.20.tfp.pdf
The article is entitled: Performance Comparison of Several Folding Strategies
Abstract: In this article we examine the computation order and consequent
performance of three different conceptual implementations of the
fold function. We explore a set of performance based
experiments on different implementations of this function. In
particular, we contrast the fold-left implementation with two
other implements we refer to as pair-wise-fold and
tree-like-fold. We explore two application areas: ratio
arithmetic and Binary Decisions Diagram construction. We demonstrate
several cases where the performance of certain algorithms is very
different depending on the approach taken. In particular iterative
computations where the object size accumulates are good candidates for
the tree-like-fold.
I hope you enjoy reading the paper, and I’m happy to have anyone’s feedback.
Kind regards
Jim NEWTON
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mardi 17 décembre 2019 (10h -- 11h), IP12A.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr <http://seminaire.lrde.epita.fr/>
[2] http://seminaire.lrde.epita.fr/Archives <http://seminaire.lrde.epita.fr/Archives>
[3] http://seminaire.lrde.epita.fr/2019-12-17 <http://seminaire.lrde.epita.fr/2019-12-17>
[4] http://www.lrde.epita.fr/wiki/Contact <http://www.lrde.epita.fr/wiki/Contact>
Au programme du Mardi 17 décembre 2019 :
* 10h -- 11h: Learning the relationship between neighboring pixels for some vision tasks
-- Yongchao Xu, Associate Professor at the School of Electronic Information and Communications, HUST, China
http://www.vlrlab.net/~yxu/ <http://www.vlrlab.net/~yxu/>
The relationship between neighboring pixels plays an important role in
many vision applications. A typical example of a relationship between
neighboring pixels is the intensity order, which gives rise to some
morphological tree-based image representations (e.g., Min/Max tree and
tree of shapes). These trees have been shown useful for many
applications, ranging from image filtering to object detection and
segmentation. Yet, these intensity order based trees do not always
perform well for analyzing complex natural images. The success of deep
learning in many vision tasks motivates us to resort to convolutional
neural networks (CNNs) for learning such a relationship instead of
relying on the simple intensity order. As a starting point, we propose
the flux or direction field representation that encodes the relationship
between neighboring pixels. We then leverage CNNs to learn such a
representation and develop some customized post-processings for several
vision tasks, such as symmetry detection, scene text detection, generic
image segmentation, and crowd counting by localization. This talk is
based on [1] and [2], as well as extension of those previous works that
are currently under review.
[1] Xu, Y., Wang, Y., Zhou, W., Wang, Y., Yang, Z. and Bai, X., 2019.
Textfield: Learning a deep direction field for irregular scene text
detection. IEEE Transactions on Image Processing. [2] Wang, Y., Xu, Y.,
Tsogkas, S., Bai, X., Dickinson, S. and Siddiqi, K., 2019. DeepFlux for
Skeletons in the Wild. In Proceedings of the IEEE Conference on Computer
Vision and Pattern Recognition.
-- Yongchao Xu received in 2010 both the engineer degree in electronics &
embedded systems at Polytech Paris Sud and the master degree in signal
processing & image processing at Université Paris Sud, and the Ph.D.
degree in image processing and mathematical morphology at Université
Paris Est in 2013. After completing his Ph.D. study at LRDE, EPITA,
ESIEE Paris, and LIGM, He worked at LRDE as an assistant professor
(Maître de Conférences). He is currently an Associate Professor at the
School of Electronic Information and Communications, HUST. His research
interests include mathematical morphology, image segmentation, medical
image analysis, and deep learning.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d'orateurs.
-------------- section suivante --------------
Une pièce jointe HTML a été nettoyée...
URL: <http://lists.lrde.epita.fr/pipermail/seminaire/attachments/20191211/c06b5da…>
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire
Bonjour à tous,
J'ai le plaisir de vous inviter à la soutenance de ma thèse intitulée :
"A new minimum barrier distance for multivariate images with
applications to salient object detection, shortest path finding, and
segmentation."
L'exposé se déroulera en anglais.
Vous êtes également cordialement invité au pot qui suivra.
Date : le mardi 17 Décembre à 14h
Lieu : en salle KB604 à l'EPITA, 14-16 rue Voltaire, Le Kremlin-Bicêtre
94270
Vous trouverez également toutes les informations sur la page web
suivante :
https://www.lrde.epita.fr/wiki/Affiche-these-MOVN
Le jury sera composé de :
Rapporteurs :
* Nicole VINCENT, Pr., Université Paris Descartes, LIPADE
* Jean-Christophe BURIE, Pr., Université La Rochelle, L3I
Examinateurs :
* Benoît NAEGEL, MdC, Université de Strasbourg, ICube
* Béatriz MARCOTEGUI, Pr., Mines ParisTech, CMM
Encadrants :
* Thierry GÉRAUD, Pr., EPITA, LRDE
* Jonathan FABRIZIO, MdC, EPITA, LRDE
Mots clés : Arbre de formes, morphologie mathématique, représentation
hiérarchique, images multivariées, pseudo-distance de Dahu, distance de
barrière minimale, saillance visuelle, document détection, segmentation
de l’image.
Résumé de la thèse :
Les représentations hiérarchiques d’images sont largement utilisées dans
le traitement d’images
pour modéliser le contenu d’une image par un arbre. Une hiérarchie bien
connue est l’arbre des formes (AdF)
qui encode la relation d’inclusion entre les composants connectés à
partir de différents niveaux de seuil.
Ce genre d’arbre est auto-dual et invariant au changement de contraste;
il est utilisé dans de
nombreuses applications de vision par ordinateur. En raison de ses
propriétés, dans cette thèse, nous utilisons
cette représentation pour calculer la nouvelle distance qui appartient
au domaine de la morphologie mathématique.
Les transformations de distance et les cartes de saillance qu’elles
induisent sont généralement utilisées
dans le traitement d’images, la vision par ordinateur et la
reconnaissance de formes. L’une des transformations
de distance les plus couramment utilisées est la géodésique.
Malheureusement, cette distance n’obtient pas
toujours des résultats satisfaisants sur des images bruitées ou floues.
Récemment, une nouvelle pseudo-distance,
appelée distance de barrière minimum (MBD), plus robuste aux variations
de pixels, a été introduite. Quelques
années plus tard, Géraud et al. ont proposé une bonne approximation
rapide de cette distance : la pseudo-distance
de Dahu. Puisque cette distance a été initialement développée pour les
images en niveaux de gris, nous proposons
ici une extension de cette transformation aux images multivariées ; nous
l’appelons la pseudo-distance vectorielle de Dahu.
Cette nouvelle distance est facilement calculée grâce à l’arbre
multivarié des formes (AdFM). Nous vous proposons
une méthode de calcul efficace de cette distance et de sa carte de
saillants dans cette thèse.
Nous étudions également les propriétés de cette distance dans le
traitement d’images floutées ou bruitées.
Pour valider cette nouvelle distance, nous fournissons des repères
démontrant à quel point la pseudo-distance
vectorielle de Dahu est plus robuste et compétitive par rapport aux
autres distances basées sur la
barrière minimum. Cette distance est prometteuse pour la détection des
objets saillants, la recherche du chemin
le plus court et la segmentation des objets. De plus, nous appliquons
cette distance pour détecter
des documents dans des vidéos. Notre méthode est une approche basée sur
les régions qui s’appuie sur
la saillance visuelle déduite de la pseudo-distance de Dahu. Nous
montrons que la performance de notre méthode
est compétitive par rapport aux méthodes de pointe utilisées dans le
concours Smartdoc 2015 ICDAR.
A bientôt,
Minh ON VU NGOC
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
13th European Lisp Symposium
Special Focus on Compilers
Call for papers
April 27 - April 28, 2020
GZ Riesbach
Zürich, Switzerland
http://www.european-lisp-symposium.org/2020
Sponsored by EPITA, Igalia S.L.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Invited Speakers
~~~~~~~~~~~~~~~~
Andrew W. Keep (Cisco Systems, Inc.), on the Nanopass Framework.
Daniel Kochmański (Turtleware), on ECL, the Embeddable Common Lisp.
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: February 13, 2020
- Author notification: March 16, 2020
- Final papers due: April 6, 2020
- Symposium: April 27 - 28, 2020
Scope
~~~~~
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp dialects, including
Common Lisp, Scheme, Emacs Lisp, Clojure, Racket, ACL2, AutoLisp,
ISLISP, Dylan, ECMAScript, SKILL and so on. We encourage everyone
interested in Lisp to participate.
The European Lisp Symposium 2020 invites high quality papers about
novel research results, insights and lessons learned from practical
applications, and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
This year's focus will be directed towards "Compilers".
We especially invite submissions in the following areas:
- Compiler techniques
- Compiler passes
- Compiler compilers
- Showcasing of industrial or experimental compilers
- Code generation
- Compiler verification
- Compiler optimizations
- JIT compilers
Contributions are also welcome in other areas, including but not
limited to:
- Context-, aspect-, domain-oriented and generative programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Language design and implementation
- Language integration, inter-operation and deployment
- Development methodologies, support and environments
- Educational approaches and perspectives
- Experience reports and case studies
Technical Program
~~~~~~~~~~~~~~~~~
We invite submissions in the following forms:
* Papers: Technical papers of up to 15 pages that describe original
results or explain known ideas in new and elegant ways.
* Demonstrations: Abstracts of up to 4 pages for demonstrations of
tools, libraries, and applications.
* Tutorials: Abstracts of up to 4 pages for in-depth presentations
about topics of special interest for at least 90 minutes and up to
180 minutes.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
http://www.easychair.org/conferences/?conf=els2020
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Ioanna M. Dimitriou H. - Igalia, Spain/Germany
Local Chair
~~~~~~~~~~~
Nicolas Hafner - Shinmera, Switzerland
Programme Committee
~~~~~~~~~~~~~~~~~~~
Andy Wingo - Igalia, Spain/France
Asumu Takikawa - Igalia, Spain/USA
Charlotte Herzeel - IMEC, Intel Exascience Lab, Belgium
Christophe Rhodes - Google, UK
Iréne Durand - Université Bordeaux 1, France
Jim Newton - EPITA Research Lab, France
Kent Pitman - HyperMeta, USA
Leonie Dreschler-Fischer - University of Hamburg, Germany
Marco Heisig - FAU Erlangen-Nürnberg, Germany
Mark Evenson - not.org, Austria
Max Rottenkolber - Interstellar Ventures, Germany
Paulo Matos - Igalia, Spain/Germany
Robert Goldman - SIFT, USA
Robert Strandh - Université Bordeaux 1, France
(more PC members to be announced)
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
Following yesterday's release of Declt, I'm happy to announce the
release of Quickref 3.0, our documentation aggregator for Quicklisp
libraries. This release is synchronized with that of Declt and the
latest Quicklisp distribution, resulting in 1792 reference manual for
Common Lisp libraries.
The official website has been updated yesterday:
https://quickref.common-lisp.net/
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
I'm pleased to announce the release of Declt 3.0 "Montgomery Scott", my
Texinfo reference manual generator for Common Lisp libraries.
This is a new major release of the library, although the changes may not
be so visible from the outside. The main concern in this release has
been to increase the robustness of the output, from three different
angles.
1. Many places from where Declt attempts to extract meaningful
information are underspecified (ASDF system slots notably).
2. The pretty-printing of Lisp items can be difficult, given the
liberalism and extensibility of the language.
3. Finally, several restrictions in the syntax of Texinfo itself (anchor
names notably) get in the way.
These issues were described in a paper presented at the TeX Users Group
conference, this summer in Palo Alto. This release goes a long way
toward fixing them.
The new generated reference manuals look mostly the same as before, but
some important things have changed under the hood, notably the names of
hyperlinks and cross-references (backward-incompatible, hence the
increase in the major version number). The output is now also much more
robust with respect to the final output format: the generation of HTML,
DVI, Postscript, PDF, and even plain Info should work fine and has been
tested on all Quicklisp libraries (in fact, Quickref will also be
upgraded in the near future to provide all those formats at once).
Those improvements do come at a cost. Unicode is now required (even for
Info readers). To be honest, many Lisp libraries already had that
implicit requirement. Also, this release depends on improvements and bug
fixes only available in Texinfo 6.7, now a requirement as well. I have
to thank Gavin Smith, from the Texinfo team, for his collaboration.
Apart from that, this release also has a number of bug fixes.
- Some method specializers were not handled properly.
- The manuals were missing documentation for some non-Lisp source files.
- There were some glitches in the pretty-printing of unreadable objects.
Declt's homepage:
https://www.lrde.epita.fr/~didier/software/lisp/typesetting.php#declt
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mardi 1 octobre 2019 (11h -- 12h), Amphi 4.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2019-10-01
[4] http://www.lrde.epita.fr/wiki/Contact
Au programme du Mardi 1 octobre 2019 :
* 11h -- 12h: The Loci Auto-Parallelizing Framework: An Overview and Future
Directions
-- Edward A. Luke, Professor, Department of Computer Science and Engineering,
Mississippi State University
http://web.cse.msstate.edu/~luke/loci/index.html
The Loci Auto-Parallelizing framework provides a Domain Specific
Language (DSL) for the creation of high performance numerical models.
The framework uses a logic-relation model to describe irregular
computations, provide guarantees of internal logical consistency, and
provides for automatic parallel execution. The framework has been used
to develop a number of advance computational models used in production
engineering processes. Currently Loci based tools form the backbone of
computational fluid dynamics tools used by NASA Marshall and Loci based
codes account for more than 20% of the computational workload on NASA’s
Pleiades supercomputer. This talk will provide an overview of the
framework, discuss its general approach, and provide comparisons to
other programming models through a mini-app benchmark. In addition,
future plans for developing efficient schedules of fine-grained parallel
and memory bandwidth constrained computations will be discussed.
Finally, some examples of the range of engineering simulations enabled
by the technology will be introduced and briefly discussed.
-- Dr. Ed Luke is a professor of computer science in the computer science
department of Mississippi State University. He received his Ph.D. in the
field of Computational Engineering in 1999 and conducts research at the
intersection between applied math, computer science. His research
focuses on creating systems to automatically parallelize numerical
algorithms, particularly those used to solve systems of partial
differential equations. Currently Dr. Luke is participating in active
collaborations with INRIA in Paris conducting research in the areas of
solver parallelization and mesh generation.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d'orateurs.
--
Edwin Carlinet
Laboratoire R&D de l'EPITA (LRDE)
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire