Thomas Soddemann

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:99/5495 · DBLP profile ↗

← Back

6ranked-venue papers

1as first author

0since 2021 · last 2017

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems 1 paper		Distributed systems · 77% High-performance computing · 23%
Network and information security 1 paper		Authentication and access control · 100%

Topics — the 1 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Distributed systems › grid computing science gateway	0.1	1	2006	Science gateway - Science gateway, portal and other community interfaces to high end resources · SC 2006

Year	Publication	Venue	Position
2017	Pure Functions in C: A Small Keyword for Automatic Parallelization abstract The need for parallel task execution has been steadily growing in recent years since manufacturers mainly improve processor performance by scaling the number of installed cores instead of the frequency of processors. To make use of this potential, an essential technique to increase the parallelism of a program is to parallelize loops. However, a main restriction of available tools for automatic loop parallelization is that the loops often have to be 'polyhedral' and that it is, e.g., not allowed to call functions from within the loops. In this paper, we present a seemingly simple extension to the C programming language which marks functions without side-effects. These functions can then basically be ignored when checking the parallelization opportunities for polyhedral loops. We extended the GCC compiler toolchain accordingly and evaluated several real-world applications showing that our extension helps to identify additional parallelization chances and, thus, to significantly enhance the performance of applications. Tim Süß, Lars Nagel 0001, Marc-Andre Vef, André Brinkmann, Dustin Feld, Thomas Soddemann	CLUSTER	6
2016	VarySched: A Framework for Variable Scheduling in Heterogeneous Environments abstract Despite many efforts to better utilize the potential of GPUs and CPUs, it is far from being fully exploited. Although many tasks can be easily sped up by using accelerators, most of the existing schedulers are not flexible enough to really optimize the resource usage of the complete system. The main reasons are (i) that each processing unit requires a specific program code and that this code is often not provided for every task, and (ii) that schedulers may follow the run-until-completion model and, hence, disallow resource changes during runtime. In this paper, we present VarySched, a configurable task scheduler framework tailored to efficiently utilize all available computing resources in a system. VarySched allows a more fine-grained task-to-resource placement which is even further enhanced by allowing the tasks to migrate to another resource during their runtime. In addition, VarySched can manage multiple scheduling strategies - optimizing, for instance, throughput or energy efficiency - and switch between them at any time. Tim Süß, Nils Döring, Ramy Gad, Lars Nagel 0001, André Brinkmann, Dustin Feld, Thomas Soddemann, Stefan Lankes	CLUSTER	7
2010	Large scale computational science on federated international grids: The role of switched optical networks Peter V. Coveney, Giovanni Giupponi, Shantenu Jha, Steven Manos, Jon MacLaren, Stephen Pickles, R. S. Saksena, Thomas Soddemann, James L. Suter, Mary-Ann Thyveetil, Stefan J. Zasada	Future Gener. Comput. Syst.	8
2009	Interoperation of world-wide production e-Science infrastructures abstract Abstract Many production Grid and e‐Science infrastructures have begun to offer services to end‐users during the past several years with an increasing number of scientific applications that require access to a wide variety of resources and services in multiple Grids. Therefore, the Grid Interoperation Now—Community Group of the Open Grid Forum—organizes and manages interoperation efforts among those production Grid infrastructures to reach the goal of a world‐wide Grid vision on a technical level in the near future. This contribution highlights fundamental approaches of the group and discusses open standards in the context of production e‐Science infrastructures. Copyright © 2009 John Wiley & Sons, Ltd. Morris Riedel, Erwin Laure, Thomas Soddemann, Laurence Field, John-Paul Navarro, James Casey, Maarten Litmaath, Jean-Philippe Baud, Birger Koblitz, Charles E. Catlett, Dane Skow, Cindy Zheng, Philip M. Papadopoulos, Mason J. Katz, Neha Sharma 0001, Oxana Smirnova, Balázs Kónya, Peter W. Arzberger, Frank Würthwein, Abhishek Singh Rana, Terrence Martin, M. Wan, Von Welch, Tony Rimovsky, Steven J. Newhouse, Andrea Vanni, Yoshio Tanaka, Yusuke Tanimura, Tsutomu Ikegami, David Abramson 0001, Colin Enticott, Graham Jenkins, Ruth Pordes, Steven Timm, Gidon Moont, Mona Aggarwal, Dave Colling, Olivier van der Aa, Alex Sim, Vijaya Natarajan, Arie Shoshani, Junmin Gu, Gerson Galang, Riccardo Zappi, Luca Magnoni, Vincenzo Ciaschini, Michele Pace, Valerio Venturi, Moreno Marzolla, Paolo Andreetto, Robert Cowles, Shaowen Wang 0001, Yuji Saeki, Hitoshi Sato, Satoshi Matsuoka, Putchong Uthayopas, Somsak Sriprayoonsakul, Oscar Koeroo, Matthew Viljoen, Laura Pearlman, Stephen Pickles, David Wallom, Glenn Moloney, Jerome Lauret, Jim Marsteller, Paul Sheldon, Surya Pathak, Shaun De Witt, Jirí Mencák, Jens Jensen, Matt Hodges, Derek Ross, Sugree Phatanapherom, Gilbert Netzer, Anders Rhod Gregersen, Mike Jones 0002, Péter Kacsuk, Achim Streit, Daniel Mallmann, Felix Wolf 0001, Thomas Lippert, Thierry Delaitre, Eduardo Huedo, Neil Geddes	Concurr. Comput. Pract. Exp.	3
2007	Science gateways to DEISA: user requirements, technologies, and the material sciences and plasma physics gateway abstract Abstract DEISA (Distributed European Infrastructure for Supercomputer Applications) is collecting experience with science gateways in different scientific areas and aims at combining all current efforts. This paper describes the development of the DEISA material sciences and plasma physics Web portal application from the view of a project engineer and software architect. It analyzes user requirements, motivates technology choices, and describes the realization of an application that is very similar to the first release candidate. The outlook gives insight into the development steps currently being undertaken towards a release and the planning phase for a future release, as well as the DEISA aims. Copyright © 2006 John Wiley & Sons, Ltd. Thomas Soddemann	Concurr. Comput. Pract. Exp.	1
2006	Science gateway - Science gateway, portal and other community interfaces to high end resources abstract Increasingly, scientists are using portals and desktop applications as to access computational capabilities, information services, data collections, instruments and other resources. Developers are building community-specific tools and applications that are integrated via a portal or a suite of applications, providing access to high end resources. These gateways often support orchestrated workflow, resource directories (databases, compute resources, etc.), and execution services.The purpose of the BOF is to bring together developers, researchers or resource providers who are developing, deploying or using these types of capabilities to discuss common issues including usage models, authentication and authorization, access mechanisms and what to consider when accessing shared resources. Nancy Wilkins-Diehr, Thomas Soddemann	SC	2