11 Search Results for "Schulz, Martin"

Document
DOI: 10.4230/LIPIcs.ESA.2023.34
Faster Local Motif Clustering via Maximum Flows

Authors: Adil Chhabra, Marcelo Fonseca Faraj, and Christian Schulz

Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)

Abstract
Local clustering aims to identify a cluster within a given graph that includes a designated seed node or a significant portion of a group of seed nodes. This cluster should be well-characterized, i.e., it has a high number of internal edges and a low number of external edges. In this work, we propose SOCIAL, a novel algorithm for local motif clustering which optimizes for motif conductance based on a local hypergraph model representation of the problem and an adapted version of the max-flow quotient-cut improvement algorithm (MQI). In our experiments with the triangle motif, SOCIAL produces local clusters with an average motif conductance 1.7% lower than the state-of-the-art, while being up to multiple orders of magnitude faster.
Cite as

Adil Chhabra, Marcelo Fonseca Faraj, and Christian Schulz. Faster Local Motif Clustering via Maximum Flows. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 34:1-34:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{chhabra_et_al:LIPIcs.ESA.2023.34,
  author =	{Chhabra, Adil and Fonseca Faraj, Marcelo and Schulz, Christian},
  title =	{{Faster Local Motif Clustering via Maximum Flows}},
  booktitle =	{31st Annual European Symposium on Algorithms (ESA 2023)},
  pages =	{34:1--34:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-295-2},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{274},
  editor =	{G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.34},
  URN =		{urn:nbn:de:0030-drops-186871},
  doi =		{10.4230/LIPIcs.ESA.2023.34},
  annote =	{Keywords: local motif clustering, motif conductance, maximum flows, max-flow quotient-cut improvement}
}
Document
DOI: 10.4230/LIPIcs.ITP.2023.19
MizAR 60 for Mizar 50

Authors: Jan Jakubův, Karel Chvalovský, Zarathustra Goertzel, Cezary Kaliszyk, Mirek Olšák, Bartosz Piotrowski, Stephan Schulz, Martin Suda, and Josef Urban

Published in: LIPIcs, Volume 268, 14th International Conference on Interactive Theorem Proving (ITP 2023)

Abstract
As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60% of the Mizar theorems in the hammer setting. We also automatically prove 75% of the Mizar theorems when the automated provers are helped by using only the premises used in the human-written Mizar proofs. We describe the methods and large-scale experiments leading to these results. This includes in particular the E and Vampire provers, their ENIGMA and Deepire learning modifications, a number of learning-based premise selection methods, and the incremental loop that interleaves growing a corpus of millions of ATP proofs with training increasingly strong AI/TP systems on them. We also present a selection of Mizar problems that were proved automatically.
Cite as

Jan Jakubův, Karel Chvalovský, Zarathustra Goertzel, Cezary Kaliszyk, Mirek Olšák, Bartosz Piotrowski, Stephan Schulz, Martin Suda, and Josef Urban. MizAR 60 for Mizar 50. In 14th International Conference on Interactive Theorem Proving (ITP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 268, pp. 19:1-19:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{jakubuv_et_al:LIPIcs.ITP.2023.19,
  author =	{Jakub\r{u}v, Jan and Chvalovsk\'{y}, Karel and Goertzel, Zarathustra and Kaliszyk, Cezary and Ol\v{s}\'{a}k, Mirek and Piotrowski, Bartosz and Schulz, Stephan and Suda, Martin and Urban, Josef},
  title =	{{MizAR 60 for Mizar 50}},
  booktitle =	{14th International Conference on Interactive Theorem Proving (ITP 2023)},
  pages =	{19:1--19:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-284-6},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{268},
  editor =	{Naumowicz, Adam and Thiemann, Ren\'{e}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.19},
  URN =		{urn:nbn:de:0030-drops-183942},
  doi =		{10.4230/LIPIcs.ITP.2023.19},
  annote =	{Keywords: Mizar, ENIGMA, Automated Reasoning, Machine Learning}
}
Document
DOI: 10.4230/LIPIcs.ITP.2022.8
Seventeen Provers Under the Hammer

Authors: Martin Desharnais, Petar Vukmirović, Jasmin Blanchette, and Makarius Wenzel

Published in: LIPIcs, Volume 237, 13th International Conference on Interactive Theorem Proving (ITP 2022)

Abstract
One of the main success stories of automatic theorem provers has been their integration into proof assistants. Such integrations, or "hammers," increase proof automation and hence user productivity. In this paper, we use Isabelle/HOL’s Sledgehammer tool to find out how useful modern provers are at proving formulas in higher-order logic. Our evaluation follows in the steps of Böhme and Nipkow’s Judgment Day study from 2010, but instead of three provers we use 17, including SMT solvers and higher-order provers. Our work offers an alternative yardstick for comparing modern provers, next to the benchmarks and competitions emerging from the TPTP World and SMT-LIB.
Cite as

Martin Desharnais, Petar Vukmirović, Jasmin Blanchette, and Makarius Wenzel. Seventeen Provers Under the Hammer. In 13th International Conference on Interactive Theorem Proving (ITP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 237, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{desharnais_et_al:LIPIcs.ITP.2022.8,
  author =	{Desharnais, Martin and Vukmirovi\'{c}, Petar and Blanchette, Jasmin and Wenzel, Makarius},
  title =	{{Seventeen Provers Under the Hammer}},
  booktitle =	{13th International Conference on Interactive Theorem Proving (ITP 2022)},
  pages =	{8:1--8:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-252-5},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{237},
  editor =	{Andronick, June and de Moura, Leonardo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2022.8},
  URN =		{urn:nbn:de:0030-drops-167178},
  doi =		{10.4230/LIPIcs.ITP.2022.8},
  annote =	{Keywords: Automatic theorem proving, interactive theorem proving, proof assistants}
}
Document
DOI: 10.4230/DagRep.11.7.16
Understanding I/O Behavior in Scientific and Data-Intensive Computing (Dagstuhl Seminar 21332)

Authors: Philip Carns, Julian Kunkel, Kathryn Mohror, and Martin Schulz

Published in: Dagstuhl Reports, Volume 11, Issue 7 (2021)

Abstract
Two key changes are driving an immediate need for deeper understanding of I/O workloads in high-performance computing (HPC): applications are evolving beyond the traditional bulk-synchronous models to include integrated multistep workflows, in situ analysis, artificial intelligence, and data analytics methods; and storage systems designs are evolving beyond a two-tiered file system and archive model to complex hierarchies containing temporary, fast tiers of storage close to compute resources with markedly different performance properties. Both of these changes represent a significant departure from the decades-long status quo and require investigation from storage researchers and practitioners to understand their impacts on overall I/O performance. Without an in-depth understanding of I/O workload behavior, storage system designers, I/O middleware developers, facility operators, and application developers will not know how best to design or utilize the additional tiers for optimal performance of a given I/O workload. The goal of this Dagstuhl Seminar was to bring together experts in I/O performance analysis and storage system architecture to collectively evaluate how our community is capturing and analyzing I/O workloads on HPC systems, identify any gaps in our methodologies, and determine how to develop a better in-depth understanding of their impact on HPC systems. Our discussions were lively and resulted in identifying critical needs for research in the area of understanding I/O behavior. We document those discussions in this report.
Cite as

Philip Carns, Julian Kunkel, Kathryn Mohror, and Martin Schulz. Understanding I/O Behavior in Scientific and Data-Intensive Computing (Dagstuhl Seminar 21332). In Dagstuhl Reports, Volume 11, Issue 7, pp. 16-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{carns_et_al:DagRep.11.7.16,
  author =	{Carns, Philip and Kunkel, Julian and Mohror, Kathryn and Schulz, Martin},
  title =	{{Understanding I/O Behavior in Scientific and Data-Intensive Computing (Dagstuhl Seminar 21332)}},
  pages =	{16--75},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{7},
  editor =	{Carns, Philip and Kunkel, Julian and Mohror, Kathryn and Schulz, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.7.16},
  URN =		{urn:nbn:de:0030-drops-155891},
  doi =		{10.4230/DagRep.11.7.16},
  annote =	{Keywords: I/O performance measurement, Understanding user I/O patterns, HPC I/O, I/O characterization}
}
Document
DOI: 10.4230/LIPIcs.STACS.2018.43
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling

Authors: Sven Jäger and Martin Skutella

Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)

Abstract
Minimizing the sum of weighted completion times on m identical parallel machines is one of the most important and classical scheduling problems. For the stochastic variant where processing times of jobs are random variables, Möhring, Schulz, and Uetz (1999) presented the first and still best known approximation result, achieving, for arbitrarily many machines, performance ratio 1+1/2(1+Delta), where Delta is an upper bound on the squared coefficient of variation of the processing times. We prove performance ratio 1+1/2(sqrt(2)-1)(1+Delta) for the same underlying algorithm---the Weighted Shortest Expected Processing Time (WSEPT) rule. For the special case of deterministic scheduling (i.e., Delta=0), our bound matches the tight performance ratio 1/2(1+sqrt(2)) of this algorithm (WSPT rule), derived by Kawaguchi and Kyan in a 1986 landmark paper. We present several further improvements for WSEPT's performance ratio, one of them relying on a carefully refined analysis of WSPT yielding, for every fixed number of machines m, WSPT's exact performance ratio of order 1/2(1+sqrt(2))-O(1/m^2).
Cite as

Sven Jäger and Martin Skutella. Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 43:1-43:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{jager_et_al:LIPIcs.STACS.2018.43,
  author =	{J\"{a}ger, Sven and Skutella, Martin},
  title =	{{Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{43:1--43:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Niedermeier, Rolf and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.43},
  URN =		{urn:nbn:de:0030-drops-85034},
  doi =		{10.4230/LIPIcs.STACS.2018.43},
  annote =	{Keywords: Stochastic Scheduling, Parallel Machines, Approximation Algorithm, List Scheduling, Weighted Shortest (Expected) Processing Time Rule}
}
Document
DOI: 10.4230/DagMan.5.1.1
Connecting Performance Analysis and Visualization (Dagstuhl Perspectives Workshop 14022)

Authors: Peer-Timo Bremer, Bernd Mohr, Valerio Pascucci, Martin Schulz, Todd Gamblin, and Holger Brunst

Published in: Dagstuhl Manifestos, Volume 5, Issue 1 (2015)

Abstract
In the first week of January 2014 Schloss Dagstuhl hosted a Perspectives Workshop on “Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing”. The workshop brought together two previously separate communities – from Visualization and Performance Analysis for High Performance Computing – to discuss a long term joint research agenda. The goal was to identify and address the challenges in using visual representations to understand and optimize the performance of extreme-scale applications running on today's most powerful computing systems like climate modeling, combustion, material science or astro-physics simulations.
Cite as

Peer-Timo Bremer, Bernd Mohr, Valerio Pascucci, Martin Schulz, Todd Gamblin, and Holger Brunst. Connecting Performance Analysis and Visualization (Dagstuhl Perspectives Workshop 14022). In Dagstuhl Manifestos, Volume 5, Issue 1, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{bremer_et_al:DagMan.5.1.1,
  author =	{Bremer, Peer-Timo and Mohr, Bernd and Pascucci, Valerio and Schulz, Martin and Gamblin, Todd and Brunst, Holger},
  title =	{{Connecting Performance Analysis and Visualization (Dagstuhl Perspectives Workshop 14022)}},
  pages =	{1--24},
  journal =	{Dagstuhl Manifestos},
  ISSN =	{2193-2433},
  year =	{2015},
  volume =	{5},
  number =	{1},
  editor =	{Bremer, Peer-Timo and Mohr, Bernd and Pascucci, Valerio and Schulz, Martin and Gamblin, Todd and Brunst, Holger},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagMan.5.1.1},
  URN =		{urn:nbn:de:0030-drops-55099},
  doi =		{10.4230/DagMan.5.1.1},
  annote =	{Keywords: Performance Analysis, Performance Tools, Information Visualization, Visual Analytics}
}
Document
DOI: 10.4230/OASIcs.ICCSW.2015.37
A Survey of CUDA-based Multidimensional Scaling on GPU Architecture

Authors: Hasmik Osipyan, Martin Kruliš, and Stéphane Marchand-Maillet

Published in: OASIcs, Volume 49, 2015 Imperial College Computing Student Workshop (ICCSW 2015)

Abstract
The need to analyze large amounts of multivariate data raises the fundamental problem of dimensionality reduction which is defined as a process of mapping data from high-dimensional space into low-dimensional. One of the most popular methods for handling this problem is multidimensional scaling. Due to the technological advances, the dimensionality of the input data as well as the amount of processed data is increasing steadily but the requirement of processing these data within a reasonable time frame still remains an open problem. Recent development in graphics hardware allows to perform generic parallel computations on powerful hardware and provides an opportunity to solve many time-constrained problems in both graphical and non-graphical domain. The purpose of this survey is to describe and analyze recent implementations of multidimensional scaling algorithms on graphics processing units and present the applicability of these algorithms on such architectures based on the experimental results which show a decrease of execution time for multi-level approaches.
Cite as

Hasmik Osipyan, Martin Kruliš, and Stéphane Marchand-Maillet. A Survey of CUDA-based Multidimensional Scaling on GPU Architecture. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 37-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{osipyan_et_al:OASIcs.ICCSW.2015.37,
  author =	{Osipyan, Hasmik and Kruli\v{s}, Martin and Marchand-Maillet, St\'{e}phane},
  title =	{{A Survey of CUDA-based Multidimensional Scaling on GPU Architecture}},
  booktitle =	{2015 Imperial College Computing Student Workshop (ICCSW 2015)},
  pages =	{37--45},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-000-2},
  ISSN =	{2190-6807},
  year =	{2015},
  volume =	{49},
  editor =	{Schulz, Claudia and Liew, Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.37},
  URN =		{urn:nbn:de:0030-drops-54798},
  doi =		{10.4230/OASIcs.ICCSW.2015.37},
  annote =	{Keywords: Dimensionality Reduction, Pattern Recognition, Graphics Hardware, Compute Unified Device Architecture, Parallel Programming}
}
Document
DOI: 10.4230/DagRep.4.1.17
Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing (Dagstuhl Perspectives Workshop 14022)

Authors: Peer-Timo Bremer, Bernd Mohr, Valerio Pascucci, and Martin Schulz

Published in: Dagstuhl Reports, Volume 4, Issue 1 (2014)

Abstract
In the first week of January 2014 Dagstuhl hosted a Perspectives Workshop on "Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing". The event brought together two previously separate communities - from Visualization and HPC Performance Analysis - to discuss a long term joined research agenda. The goal was to identify and address the challenges in using visual representations to understand and optimize the performance of extreme-scale applications running on today's most powerful computing systems like climate modeling, combustion, material science or astro-physics simulations.
Cite as

Peer-Timo Bremer, Bernd Mohr, Valerio Pascucci, and Martin Schulz. Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing (Dagstuhl Perspectives Workshop 14022). In Dagstuhl Reports, Volume 4, Issue 1, pp. 17-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{bremer_et_al:DagRep.4.1.17,
  author =	{Bremer, Peer-Timo and Mohr, Bernd and Pascucci, Valerio and Schulz, Martin},
  title =	{{Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing (Dagstuhl Perspectives Workshop 14022)}},
  pages =	{17--35},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{1},
  editor =	{Bremer, Peer-Timo and Mohr, Bernd and Pascucci, Valerio and Schulz, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.1.17},
  URN =		{urn:nbn:de:0030-drops-45166},
  doi =		{10.4230/DagRep.4.1.17},
  annote =	{Keywords: Large scale data presentation and analysis, Exascale class machine optimization, Performance data analysis and root cause detection, High dimensional}
}
Document
DOI: 10.4230/LIPIcs.STACS.2013.269
Algorithms for Designing Pop-Up Cards

Authors: Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow

Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)

Abstract
We prove that every simple polygon can be made as a (2D) pop-up card/book that opens to any desired angle between 0 and 360°. More precisely, given a simple polygon attached to the two walls of the open pop-up, our polynomial-time algorithm subdivides the polygon into a single-degree-of-freedom linkage structure, such that closing the pop-up flattens the linkage without collision. This result solves an open problem of Hara and Sugihara from 2009. We also show how to obtain a more efficient construction for the special case of orthogonal polygons, and how to make 3D orthogonal polyhedra, from pop-ups that open to 90°, 180°, 270°, or 360°.
Cite as

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow. Algorithms for Designing Pop-Up Cards. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 269-280, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{abel_et_al:LIPIcs.STACS.2013.269,
  author =	{Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Lubiw, Anna and Schulz, Andr\'{e} and Souvaine, Diane L. and Viglietta, Giovanni and Winslow, Andrew},
  title =	{{Algorithms for Designing Pop-Up Cards}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{269--280},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Portier, Natacha and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.269},
  URN =		{urn:nbn:de:0030-drops-39407},
  doi =		{10.4230/LIPIcs.STACS.2013.269},
  annote =	{Keywords: geometric folding, linkages, universality}
}
Document
DOI: 10.4230/DagSemProc.10181.1
10181 Abstracts Collection – Program Development for Extreme-Scale Computing

Authors: Jesus Labarta, Barton P. Miller, Bernd Mohr, and Martin Schulz

Published in: Dagstuhl Seminar Proceedings, Volume 10181, Program Development for Extreme-Scale Computing (2010)

Abstract
From May 2nd to May 7th, 2010, the Dagstuhl Seminar 10181 ``Program Development for Extreme-Scale Computing '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. Links to extended abstracts or full papers are provided, if available.
Cite as

Jesus Labarta, Barton P. Miller, Bernd Mohr, and Martin Schulz. 10181 Abstracts Collection – Program Development for Extreme-Scale Computing. In Program Development for Extreme-Scale Computing. Dagstuhl Seminar Proceedings, Volume 10181, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{labarta_et_al:DagSemProc.10181.1,
  author =	{Labarta, Jesus and Miller, Barton P. and Mohr, Bernd and Schulz, Martin},
  title =	{{10181 Abstracts Collection – Program Development for Extreme-Scale Computing}},
  booktitle =	{Program Development for Extreme-Scale Computing},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10181},
  editor =	{Jesus Labarta and Barton P. Miller and Bernd Mohr and Martin Schulz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10181.1},
  URN =		{urn:nbn:de:0030-drops-26840},
  doi =		{10.4230/DagSemProc.10181.1},
  annote =	{Keywords: Parallel programming, performance analysis, debugging, scalability}
}
Document
DOI: 10.4230/DagSemProc.10181.2
10181 Executive Summary – Program Development for Extreme-Scale Computing

Authors: Jesus Labarta, Barton P. Miller, Bernd Mohr, and Martin Schulz

Published in: Dagstuhl Seminar Proceedings, Volume 10181, Program Development for Extreme-Scale Computing (2010)

Abstract
From May 2nd to May 7th, 2010, the Dagstuhl Seminar 10181 ``Program Development for Extreme-Scale Computing '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. This paper provides an executive summary of the seminar.
Cite as

Jesus Labarta, Barton P. Miller, Bernd Mohr, and Martin Schulz. 10181 Executive Summary – Program Development for Extreme-Scale Computing. In Program Development for Extreme-Scale Computing. Dagstuhl Seminar Proceedings, Volume 10181, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{labarta_et_al:DagSemProc.10181.2,
  author =	{Labarta, Jesus and Miller, Barton P. and Mohr, Bernd and Schulz, Martin},
  title =	{{10181 Executive Summary – Program Development for Extreme-Scale Computing}},
  booktitle =	{Program Development for Extreme-Scale Computing},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10181},
  editor =	{Jesus Labarta and Barton P. Miller and Bernd Mohr and Martin Schulz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10181.2},
  URN =		{urn:nbn:de:0030-drops-26741},
  doi =		{10.4230/DagSemProc.10181.2},
  annote =	{Keywords: Parallel programming, performance analysis, debugging, scalability}
}
  • Refine by Author
  • 5 Schulz, Martin
  • 4 Mohr, Bernd
  • 2 Bremer, Peer-Timo
  • 2 Labarta, Jesus
  • 2 Miller, Barton P.
  • Show More...

  • Refine by Classification
  • 1 Computing methodologies → Theorem proving algorithms
  • 1 Networks → Network performance analysis
  • 1 Software and its engineering → Software design engineering
  • 1 Theory of computation → Automated reasoning
  • 1 Theory of computation → Design and analysis of algorithms

  • Refine by Keyword
  • 2 Parallel programming
  • 2 debugging
  • 2 performance analysis
  • 2 scalability
  • 1 Approximation Algorithm
  • Show More...

  • Refine by Type
  • 11 document

  • Refine by Publication Year
  • 2 2010
  • 2 2015
  • 2 2023
  • 1 2013
  • 1 2014
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact