Thursday, December 20, 2018

[DMANET] CFP PARS-Workshop 2019, Berlin, Germany

-------------------------------------------------------------
CALL FOR PAPERS

28th PARS-Workshop on March 21-22, 2019 in Berlin, Germany

http://fg-pars.gi.de/workshops/pars-workshop-2019/

PARS is the special interest group on parallel algorithms, parallel computer
structures and parallel system software within the German Informatics
Societies (GI/ITG). The goal of the bi-annual PARS Workshop is the
presentation of important research within the scope of PARS and an exchange
of ideas between the participants. Topics of interest include, but are
not restricted to:

* Parallel Algorithms (Presentation, Complexity, Applications)
* Parallel Models of Computation and Parallel Architectures
* Parallel Programming Languages and Libraries
* Tools for Parallelization (Compilers, Performance Analysis, Auto-Tuner)
* Parallel Embedded Systems / Cyber-Physical Systems
* Software Engineering for Parallel and Distributed Systems
* Multicore-, Manycore-, GPGPU-Computing and Heterogeneous Architectures
* Cluster Computing, Grid Computing, Cloud Computing
* Interconnect and Hardware Structures (e.g. reconfigurable systems)
* Future Technologies and new Computational Paradigms for Architectures
(SoC, PIM, STM, Memristor, DNA-Computing, Quantum Computing)
* Teaching Parallel Computation (Experiences, E-Learning)
* Parallel and Distributed Computing in Life Sciences (e.g. Bio-Informatics,
Medical Informatics)

Workshop languages are German and Englisch. Papers are limited to 10 pages.
The workshop proceedings will be published in the yearly newsletter of
the PARS special interest group (PARS-Mitteilungen, ISSN 0177-0454). The
Workshop fee will be about 100 Euros.

Important Dates:

Papers of at most 10 pages (Format: GI Lecture Notes in Informatics:
https://gi.de/service/publikationen/lni/, previously unpublished) are to
be submitted electronically until *January 23, 2019* via:
https://easychair.org/conferences/?conf=pars2019
Author notification: February 15, 2019
Submission of camera-ready papers: August 31, 2019 (after Workshop)

Program Committee:

A. Doering, Zuerich
N. Eicker, Juelich
T. Fahringer, Innsbruck
D. Fey, Erlangen
V. Heuveline, Heidelberg
R. Hoffmann, Darmstadt
B. Juurlink, Berlin
W. Karl, Karlsruhe
J. Keller, Hagen
E. Maehle, Luebeck
U. Margull, Ingolstadt
E. W. Mayr, Muenchen
J. Mottok, Regensburg
W. E. Nagel, Dresden
M. Philippsen, Erlangen
K. D. Reinartz, Hoechstadt
B. Schnor, Potsdam
M. Schulz, Muenchen
P. Sobe, Dresden
C. Trinitis, Muenchen
T. Ungerer, Augsburg
R. Wanka, Erlangen

Student paper award:

The best paper based on a master or PhD thesis, and presented by the thesis
author, will receive the student paper award of the PARS special interest
group (endowed with 500 Euros). Co-authors are allowed, the PhD
degree should not yet be awarded at the time of paper submission.
Application for the award by e-mail to the organizers at the time of
paper submission.

Sponsor:

GI/ITG Special Interest Group PARS
http://fg-pars.gi.de

Organisation:
Prof. Dr. Ben Juurlink
Technische Universitaet Berlin
Architektur eingebetteter Systeme,
10587 Berlin, Germany,
Tel.: +49-30-314-73130,
E-Mail: b.juurlink@tu-berlin.de

Daniel Maier
Technische Universitaet Berlin
Architektur eingebetteter Systeme,
10587 Berlin, Germany,
Tel.: +49-30-314-22286,
E-Mail: daniel.maier@tu-berlin.de

Prof. Dr. Wolfgang Karl (PARS-Sprecher)
Karlsruhe Institut fuer Technologie
Rechnerarchitektur und Parallelverarbeitung
Haid-und-Neu-Strasse 7
76131 Karlsruhe
Tel.: 0721-608-43771
E-Mail: karl@kit.edu

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************