16 Search Results for "Lengauer, Christian"

Document
DOI: 10.4230/OASIcs.EVCS.2023.19
Eelco Visser as a Founding Member of the IFIP WG 2.11

Authors: Christian Lengauer and Jacques Carette

Published in: OASIcs, Volume 109, Eelco Visser Commemorative Symposium (EVCS 2023)

Abstract
Appreciation of Eelco Visser’s contribution to the IFIP WG 2.11 by two of its chairs. Christian Lengauer was chair from 2007 to 2013. Jacques Carette has been chair since 2019.
Cite as

Christian Lengauer and Jacques Carette. Eelco Visser as a Founding Member of the IFIP WG 2.11. In Eelco Visser Commemorative Symposium (EVCS 2023). Open Access Series in Informatics (OASIcs), Volume 109, pp. 19:1-19:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{lengauer_et_al:OASIcs.EVCS.2023.19,
  author =	{Lengauer, Christian and Carette, Jacques},
  title =	{{Eelco Visser as a Founding Member of the IFIP WG 2.11}},
  booktitle =	{Eelco Visser Commemorative Symposium (EVCS 2023)},
  pages =	{19:1--19:3},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-267-9},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{109},
  editor =	{L\"{a}mmel, Ralf and Mosses, Peter D. and Steimann, Friedrich},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.EVCS.2023.19},
  URN =		{urn:nbn:de:0030-drops-177891},
  doi =		{10.4230/OASIcs.EVCS.2023.19},
  annote =	{Keywords: IFIP WG 2.11}
}
Document
DOI: 10.4230/DagRep.10.3.58
Tensor Computations: Applications and Optimization (Dagstuhl Seminar 20111)

Authors: Paolo Bientinesi, David Ham, Furong Huang, Paul H. J. Kelly, Christian Lengauer, and Saday Sadayappan

Published in: Dagstuhl Reports, Volume 10, Issue 3 (2020)

Abstract
Tensors are higher-dimensional analogs of matrices, and represent a key data abstraction for many applications in computational science and data science. In contrast to the wide availability on diverse hardware platforms of high-performance numerical libraries for matrix computations, only limited software infrastructure exists today for high-performance tensor computations. Recent research developments have resulted in the formulation of many machine learning algorithms in terms of tensor computations. Tensor computations have also emerged as fundamental building blocks for many algorithms in data science and computational science. Therefore, several concurrent efforts have targeted the development of libraries, frameworks, and domain-specific compilers to support the rising demand for high-performance tensor computations. However, there is currently very little coordination among the various groups of developers. Further, the groups developing high-performance libraries/frameworks for tensor computations are still rather disconnected from the research community that develops applications using tensors as a key data abstraction. The main goal of this Dagstuhl Seminar has been to bring together the following two communities: first researchers from disciplines developing applications centered around tensor computations, and second researchers developing software infrastructure for efficient tensor computation primitives. Invitees from the former group included experts in machine learning and data analytics, and computational scientists developing tensor-based applications. Invitees from the latter group spanned experts in compiler optimization and experts in numerical methods. A very fruitful exchange of ideas across these four research communities took place, with discussions on the variety of needs and use-cases for tensor computations and the challenges/opportunities in the development of high-performance software to satisfy those needs.
Cite as

Paolo Bientinesi, David Ham, Furong Huang, Paul H. J. Kelly, Christian Lengauer, and Saday Sadayappan. Tensor Computations: Applications and Optimization (Dagstuhl Seminar 20111). In Dagstuhl Reports, Volume 10, Issue 3, pp. 58-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@Article{bientinesi_et_al:DagRep.10.3.58,
  author =	{Bientinesi, Paolo and Ham, David and Huang, Furong and Kelly, Paul H. J. and Lengauer, Christian and Sadayappan, Saday},
  title =	{{Tensor Computations: Applications and Optimization (Dagstuhl Seminar 20111)}},
  pages =	{58--70},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{10},
  number =	{3},
  editor =	{Bientinesi, Paolo and Ham, David and Huang, Furong and Kelly, Paul H. J. and Lengauer, Christian and Sadayappan, Saday},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.10.3.58},
  URN =		{urn:nbn:de:0030-drops-134303},
  doi =		{10.4230/DagRep.10.3.58},
  annote =	{Keywords: compilers, computational science, linear algebra, machine learning, numerical methods}
}
Document
DOI: 10.4230/DagRep.8.3.39
Loop Optimization (Dagstuhl Seminar 18111)

Authors: Sebastian Hack, Paul H. J. Kelly, and Christian Lengauer

Published in: Dagstuhl Reports, Volume 8, Issue 3 (2018)

Abstract
This report documents the programme of Dagstuhl Seminar 18111 "Loop Optimization". The seminar brought together experts from three areas: (1) model-based loop optimization, chiefly, in the polyhedron model, (2) rewriting and program transformation, and (3) metaprogramming and symbolic evaluation. Its aim was to review the 20+ years of progress since the Dagstuhl Seminar 9616 "Loop Parallelization" in 1996 and identify the challenges that remain.
Cite as

Sebastian Hack, Paul H. J. Kelly, and Christian Lengauer. Loop Optimization (Dagstuhl Seminar 18111). In Dagstuhl Reports, Volume 8, Issue 3, pp. 39-59, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{hack_et_al:DagRep.8.3.39,
  author =	{Hack, Sebastian and Kelly, Paul H. J. and Lengauer, Christian},
  title =	{{Loop Optimization (Dagstuhl Seminar 18111)}},
  pages =	{39--59},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Hack, Sebastian and Kelly, Paul H. J. and Lengauer, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.3.39},
  URN =		{urn:nbn:de:0030-drops-92960},
  doi =		{10.4230/DagRep.8.3.39},
  annote =	{Keywords: Autotuning, dependence analysis, just-in-time (JIT), loop parallelization, parallel programming, polyhedron model}
}
Document
DOI: 10.4230/DagRep.5.4.56
Advanced Stencil-Code Engineering (Dagstuhl Seminar 15161)

Authors: Christian Lengauer, Matthias Bolten, Robert D. Falgout, and Olaf Schenk

Published in: Dagstuhl Reports, Volume 5, Issue 4 (2015)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15161 "Advanced Stencil-Code Engineering". The seminar was hosted by the DFG project with the same name (ExaStencils for short) in the DFG priority programme "Software for Exascale Computing" (SPPEXA). It brought together experts from mathematics, computer science and applications to explore the challenges of very high performance and massive parallelism in solving partial differential equations. Its aim was to lay the basis for a new interdisciplinary research community on high-performance stencil codes.
Cite as

Christian Lengauer, Matthias Bolten, Robert D. Falgout, and Olaf Schenk. Advanced Stencil-Code Engineering (Dagstuhl Seminar 15161). In Dagstuhl Reports, Volume 5, Issue 4, pp. 56-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{lengauer_et_al:DagRep.5.4.56,
  author =	{Lengauer, Christian and Bolten, Matthias and Falgout, Robert D. and Schenk, Olaf},
  title =	{{Advanced Stencil-Code Engineering (Dagstuhl Seminar 15161)}},
  pages =	{56--75},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{5},
  number =	{4},
  editor =	{Lengauer, Christian and Bolten, Matthias and Falgout, Robert D. and Schenk, Olaf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.4.56},
  URN =		{urn:nbn:de:0030-drops-53503},
  doi =		{10.4230/DagRep.5.4.56},
  annote =	{Keywords: Code generation, domain-specific languages, exascale computing, high-performance computing, massive parallelism, multigrid, partial differential equations, program optimization, program parallelization, stencil codes}
}
Document
DOI: 10.4230/DagSemProc.07361.1
07361 Abstracts Collection – Programming Models for Ubiquitous Parallelism

Authors: David Chi-Leung Wong, Albert Cohen, María J. Garzarán, Christian Lengauer, and Samuel P. Midkiff

Published in: Dagstuhl Seminar Proceedings, Volume 7361, Programming Models for Ubiquitous Parallelism (2008)

Abstract
From 02.09. to 07.09.2007, the Dagstuhl Seminar 07361 ``Programming Models for Ubiquitous Parallelism'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. 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. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

David Chi-Leung Wong, Albert Cohen, María J. Garzarán, Christian Lengauer, and Samuel P. Midkiff. 07361 Abstracts Collection – Programming Models for Ubiquitous Parallelism. In Programming Models for Ubiquitous Parallelism. Dagstuhl Seminar Proceedings, Volume 7361, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{wong_et_al:DagSemProc.07361.1,
  author =	{Wong, David Chi-Leung and Cohen, Albert and Garzar\'{a}n, Mar{\'\i}a J. and Lengauer, Christian and Midkiff, Samuel P.},
  title =	{{07361 Abstracts Collection – Programming Models for Ubiquitous Parallelism}},
  booktitle =	{Programming Models for Ubiquitous Parallelism},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7361},
  editor =	{Albert Cohen and Mar{\'\i}a J. Garzar\'{a}n and Christian Lengauer and Samuel P. Midkiff},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07361.1},
  URN =		{urn:nbn:de:0030-drops-13770},
  doi =		{10.4230/DagSemProc.07361.1},
  annote =	{Keywords: Parallel programming models, transactional memory, languages, compilers, optimizations, architecture, automatic parallelization}
}
Document
DOI: 10.4230/DagSemProc.07361.2
07361 Introduction – Programming Models for Ubiquitous Parallelism

Authors: David Chi-Leung Wong, Albert Cohen, María J. Garzarán, Christian Lengauer, and Samuel P. Midkiff

Published in: Dagstuhl Seminar Proceedings, Volume 7361, Programming Models for Ubiquitous Parallelism (2008)

Abstract
The goal of the seminar is to present a broad view of the research challenges and ongoing efforts to improve productivity, scalability, efficiency and reliability of general-purpose and embedded parallel programming.
Cite as

David Chi-Leung Wong, Albert Cohen, María J. Garzarán, Christian Lengauer, and Samuel P. Midkiff. 07361 Introduction – Programming Models for Ubiquitous Parallelism. In Programming Models for Ubiquitous Parallelism. Dagstuhl Seminar Proceedings, Volume 7361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{wong_et_al:DagSemProc.07361.2,
  author =	{Wong, David Chi-Leung and Cohen, Albert and Garzar\'{a}n, Mar{\'\i}a J. and Lengauer, Christian and Midkiff, Samuel P.},
  title =	{{07361 Introduction – Programming Models for Ubiquitous Parallelism}},
  booktitle =	{Programming Models for Ubiquitous Parallelism},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7361},
  editor =	{Albert Cohen and Mar{\'\i}a J. Garzar\'{a}n and Christian Lengauer and Samuel P. Midkiff},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07361.2},
  URN =		{urn:nbn:de:0030-drops-13736},
  doi =		{10.4230/DagSemProc.07361.2},
  annote =	{Keywords: Programming Models for Ubiquitous Parallelism}
}
Document
DOI: 10.4230/DagSemProc.07361.3
A Case for Deconstructing Hardware Transactional Memory Systems

Authors: Mark D. Hill, Derek Hower, Kevin E. Moore, Michael M. Swift, Haris Volos, and David A. Wood

Published in: Dagstuhl Seminar Proceedings, Volume 7361, Programming Models for Ubiquitous Parallelism (2008)

Abstract
Major hardware and software vendors are curious about transactional memory (TM), but are understandably cautious about committing to hardware changes. Our thesis is that deconstructing transactional memory into separate, interchangeable components facilitates TM adoption in two ways. First, it aids hardware TM refinement, allowing vendors to adopt TM earlier, knowing that they can more easily refine aspects later. Second, it enables the components to be applied to other uses, including reliability, security, performance, and correctness, providing value even if TM is not widely used. We develop some evidence for our thesis via experience with LogTM variants and preliminary case studies of scalable watchpoints and race recording for deterministic replay.
Cite as

Mark D. Hill, Derek Hower, Kevin E. Moore, Michael M. Swift, Haris Volos, and David A. Wood. A Case for Deconstructing Hardware Transactional Memory Systems. In Programming Models for Ubiquitous Parallelism. Dagstuhl Seminar Proceedings, Volume 7361, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{hill_et_al:DagSemProc.07361.3,
  author =	{Hill, Mark D. and Hower, Derek and Moore, Kevin E. and Swift, Michael M. and Volos, Haris and Wood, David A.},
  title =	{{A Case for Deconstructing Hardware Transactional Memory Systems}},
  booktitle =	{Programming Models for Ubiquitous Parallelism},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7361},
  editor =	{Albert Cohen and Mar{\'\i}a J. Garzar\'{a}n and Christian Lengauer and Samuel P. Midkiff},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07361.3},
  URN =		{urn:nbn:de:0030-drops-13759},
  doi =		{10.4230/DagSemProc.07361.3},
  annote =	{Keywords: Hardware transactional memory}
}
Document
DOI: 10.4230/DagSemProc.07361.4
Parallelism through Digital Circuit Design

Authors: John O'Donnell

Published in: Dagstuhl Seminar Proceedings, Volume 7361, Programming Models for Ubiquitous Parallelism (2008)

Abstract
Two ways to exploit chips with a very large number of transistors are multicore processors and programmable logic chips. Some data parallel algorithms can be executed efficiently on ordinary parallel computers, including multicores. A class of data parallel algorithms is identified which have characteristics that make implementation on multiprocessors inefficient, but they are well suited for direct design as digital circuits. This leads to a programming model called circuit parallelism. The characteristics of circuit parallel algorithms are discussed, and a prototype system for supporting them is described.
Cite as

John O'Donnell. Parallelism through Digital Circuit Design. In Programming Models for Ubiquitous Parallelism. Dagstuhl Seminar Proceedings, Volume 7361, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{odonnell:DagSemProc.07361.4,
  author =	{O'Donnell, John},
  title =	{{Parallelism through Digital Circuit Design}},
  booktitle =	{Programming Models for Ubiquitous Parallelism},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7361},
  editor =	{Albert Cohen and Mar{\'\i}a J. Garzar\'{a}n and Christian Lengauer and Samuel P. Midkiff},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07361.4},
  URN =		{urn:nbn:de:0030-drops-13724},
  doi =		{10.4230/DagSemProc.07361.4},
  annote =	{Keywords: Circuit parallelism, data parallelism, FPGA}
}
Document
DOI: 10.4230/DagSemProc.07361.5
Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures

Authors: Armin Größlinger

Published in: Dagstuhl Seminar Proceedings, Volume 7361, Programming Models for Ubiquitous Parallelism (2008)

Abstract
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in sequential programs. One of the challenges is to agglomerate the parallelism to a coarser grain, in order to map the operations of the program to the available cores in a multicore architecture. We consider shared-memory multicores as target architecture for space-time mapped loop programs and make some observations concerning code generation, load balancing and cache effects.
Cite as

Armin Größlinger. Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures. In Programming Models for Ubiquitous Parallelism. Dagstuhl Seminar Proceedings, Volume 7361, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{grolinger:DagSemProc.07361.5,
  author =	{Gr\"{o}{\ss}linger, Armin},
  title =	{{Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures}},
  booktitle =	{Programming Models for Ubiquitous Parallelism},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7361},
  editor =	{Albert Cohen and Mar{\'\i}a J. Garzar\'{a}n and Christian Lengauer and Samuel P. Midkiff},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07361.5},
  URN =		{urn:nbn:de:0030-drops-13748},
  doi =		{10.4230/DagSemProc.07361.5},
  annote =	{Keywords: Multicore, automatic parallelization, loop transformations, polyhedron model}
}
Document
DOI: 10.4230/DagSemRep.373
Domain-Specific Program Generation (Dagstuhl Seminar 03131)

Authors: Don Batory, Charles Consel, Christian Lengauer, and Martin Odersky

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Don Batory, Charles Consel, Christian Lengauer, and Martin Odersky. Domain-Specific Program Generation (Dagstuhl Seminar 03131). Dagstuhl Seminar Report 373, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)

Copy BibTex To Clipboard

@TechReport{batory_et_al:DagSemRep.373,
  author =	{Batory, Don and Consel, Charles and Lengauer, Christian and Odersky, Martin},
  title =	{{Domain-Specific Program Generation (Dagstuhl Seminar 03131)}},
  pages =	{1--8},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{373},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.373},
  URN =		{urn:nbn:de:0030-drops-152531},
  doi =		{10.4230/DagSemRep.373},
}
Document
DOI: 10.4230/DagSemRep.284
High Performance Computing and Java (Dagstuhl Seminar 00341)

Authors: Susan Flynn-Hummer, Vladimi Getov, Francois Irigoin, and Christian Lengauer

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Susan Flynn-Hummer, Vladimi Getov, Francois Irigoin, and Christian Lengauer. High Performance Computing and Java (Dagstuhl Seminar 00341). Dagstuhl Seminar Report 284, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2001)

Copy BibTex To Clipboard

@TechReport{flynnhummer_et_al:DagSemRep.284,
  author =	{Flynn-Hummer, Susan and Getov, Vladimi and Irigoin, Francois and Lengauer, Christian},
  title =	{{High Performance Computing and Java (Dagstuhl Seminar 00341)}},
  pages =	{1--27},
  ISSN =	{1619-0203},
  year =	{2001},
  type = 	{Dagstuhl Seminar Report},
  number =	{284},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.284},
  URN =		{urn:nbn:de:0030-drops-151686},
  doi =		{10.4230/DagSemRep.284},
}
Document
DOI: 10.4230/DagSemRep.237
Instruction-Level Parallelism and Parallelizing Compilation (Dagstuhl Seminar 99161)

Authors: D. K. Arvind, Kemal Ebcioglu, Christian Lengauer, Keshav Pingali, and Robert S. Schreiber

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

D. K. Arvind, Kemal Ebcioglu, Christian Lengauer, Keshav Pingali, and Robert S. Schreiber. Instruction-Level Parallelism and Parallelizing Compilation (Dagstuhl Seminar 99161). Dagstuhl Seminar Report 237, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1999)

Copy BibTex To Clipboard

@TechReport{arvind_et_al:DagSemRep.237,
  author =	{Arvind, D. K. and Ebcioglu, Kemal and Lengauer, Christian and Pingali, Keshav and Schreiber, Robert S.},
  title =	{{Instruction-Level Parallelism and Parallelizing Compilation (Dagstuhl Seminar 99161)}},
  pages =	{1--30},
  ISSN =	{1619-0203},
  year =	{1999},
  type = 	{Dagstuhl Seminar Report},
  number =	{237},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.237},
  URN =		{urn:nbn:de:0030-drops-151237},
  doi =		{10.4230/DagSemRep.237},
}
Document
DOI: 10.4230/DagSemRep.169
Theory and Practice of Higher-Order Parallel Programming (Dagstuhl Seminar 9708)

Authors: Murray Cole, Sergei Gorlatch, Christian Lengauer, and David Skillicorn

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Murray Cole, Sergei Gorlatch, Christian Lengauer, and David Skillicorn. Theory and Practice of Higher-Order Parallel Programming (Dagstuhl Seminar 9708). Dagstuhl Seminar Report 169, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1997)

Copy BibTex To Clipboard

@TechReport{cole_et_al:DagSemRep.169,
  author =	{Cole, Murray and Gorlatch, Sergei and Lengauer, Christian and Skillicorn, David},
  title =	{{Theory and Practice of Higher-Order Parallel Programming (Dagstuhl Seminar 9708)}},
  pages =	{1--30},
  ISSN =	{1619-0203},
  year =	{1997},
  type = 	{Dagstuhl Seminar Report},
  number =	{169},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.169},
  URN =		{urn:nbn:de:0030-drops-150561},
  doi =		{10.4230/DagSemRep.169},
}
Document
DOI: 10.4230/DagSemRep.142
Loop Parallelization (Dagstuhl Seminar 9616)

Authors: Christian Lengauer, Lothar Thiele, Michael Wolfe, and Hans Zima

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Christian Lengauer, Lothar Thiele, Michael Wolfe, and Hans Zima. Loop Parallelization (Dagstuhl Seminar 9616). Dagstuhl Seminar Report 142, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1996)

Copy BibTex To Clipboard

@TechReport{lengauer_et_al:DagSemRep.142,
  author =	{Lengauer, Christian and Thiele, Lothar and Wolfe, Michael and Zima, Hans},
  title =	{{Loop Parallelization (Dagstuhl Seminar 9616)}},
  pages =	{1--22},
  ISSN =	{1619-0203},
  year =	{1996},
  type = 	{Dagstuhl Seminar Report},
  number =	{142},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.142},
  URN =		{urn:nbn:de:0030-drops-150292},
  doi =		{10.4230/DagSemRep.142},
}
Document
DOI: 10.4230/DagSemRep.111
Object-Orientation with Parallelism and Persistence (Dagstuhl Seminar 9514)

Authors: Burkhard Freitag, Clifford B. Jones, Christian Lengauer, and Hans-Jörg Schek

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Burkhard Freitag, Clifford B. Jones, Christian Lengauer, and Hans-Jörg Schek. Object-Orientation with Parallelism and Persistence (Dagstuhl Seminar 9514). Dagstuhl Seminar Report 111, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1995)

Copy BibTex To Clipboard

@TechReport{freitag_et_al:DagSemRep.111,
  author =	{Freitag, Burkhard and Jones, Clifford B. and Lengauer, Christian and Schek, Hans-J\"{o}rg},
  title =	{{Object-Orientation with Parallelism and Persistence (Dagstuhl Seminar 9514)}},
  pages =	{1--22},
  ISSN =	{1619-0203},
  year =	{1995},
  type = 	{Dagstuhl Seminar Report},
  number =	{111},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.111},
  URN =		{urn:nbn:de:0030-drops-149997},
  doi =		{10.4230/DagSemRep.111},
}
  • Refine by Author
  • 13 Lengauer, Christian
  • 2 Cohen, Albert
  • 2 Garzarán, María J.
  • 2 Kelly, Paul H. J.
  • 2 Midkiff, Samuel P.
  • Show More...

  • Refine by Classification
  • 1 Information systems → Data structures
  • 1 Software and its engineering
  • 1 Software and its engineering → Compilers

  • Refine by Keyword
  • 2 automatic parallelization
  • 2 compilers
  • 2 polyhedron model
  • 1 Autotuning
  • 1 Circuit parallelism
  • Show More...

  • Refine by Type
  • 16 document

  • Refine by Publication Year
  • 5 2008
  • 1 1993
  • 1 1995
  • 1 1996
  • 1 1997
  • 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