Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Süß
Person information
- affiliation: University of Applied Science Fulda, Germany
- affiliation (former): University of Mainz, Institute of Computer Science, Germany
- affiliation (PhD 2011): University of Paderborn, Heinz Nixdorf Institute, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
[b1]Tim Süß:
Parallel real-time rendering using heterogeneous PC clusters. University of Paderborn, 2011, pp. 1-141
Journal Articles
- 2021
- [j6]Tim Süß, Lars Nagel
, Marc-André Vef, André Brinkmann, Dustin Feld, Thomas Soddemann:
Pure Functions in C: A Small Keyword for Automatic Parallelization. Int. J. Parallel Program. 49(1): 1-24 (2021) - 2020
- [j5]Marc-Andre Vef, Nafiseh Moti, Tim Süß, Markus Tacke, Tommaso Tocci, Ramon Nou, Alberto Miranda, Toni Cortes, André Brinkmann:
GekkoFS - A Temporary Burst Buffer File System for HPC Applications. J. Comput. Sci. Technol. 35(1): 72-91 (2020) - [j4]Wen Cheng, Tao Guo, Lingfang Zeng, Yang Wang, Lars Nagel, Tim Süß, André Brinkmann:
Improving LSM-trie performance by parallel search. Softw. Pract. Exp. 50(10): 1952-1965 (2020) - 2018
- [j3]Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß:
Scheduling shared continuous resources on many-cores. J. Sched. 21(1): 77-92 (2018) - [j2]Ramy Gad, Simon Pickartz, Tim Süß, Lars Nagel, Stefan Lankes, Antonello Monti, André Brinkmann:
Zeroing memory deallocator to reduce checkpoint sizes in virtualized HPC environments. J. Supercomput. 74(11): 6236-6257 (2018) - 2011
- [j1]Tobias Schumacher, Tim Süß, Christian Plessl, Marco Platzner:
FPGA Acceleration of Communication-Bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study. Int. J. Reconfigurable Comput. 2011: 760954:1-760954:11 (2011)
Conference and Workshop Papers
- 2023
- [c40]Lars Nagel, Nikolay Popov, Tim Süß, Ze Wang:
Analysis of Heuristics for Vector Scheduling and Vector Bin Packing. LION 2023: 583-598 - [c39]Anna-Lena Roth, Tim Süß:
Performance Analysis Tools for MPI Applications and their Use in Programming Education. ICPE (Companion) 2023: 361-368 - 2019
- [c38]Alvaro Frank, Dai Yang, André Brinkmann, Martin Schulz, Tim Süß:
Reducing False Node Failure Predictions in HPC. HiPC 2019: 323-332 - [c37]Alvaro Frank, Tim Süß, André Brinkmann:
Effects and Benefits of Node Sharing Strategies in HPC Batch Systems. IPDPS 2019: 43-53 - [c36]Yingjin Qian, Xi Li, Shuichi Ihara, Andreas Dilger, Carlos Thomaz, Shilong Wang, Wen Cheng, Chunyan Li, Lingfang Zeng, Fang Wang, Dan Feng, Tim Süß, André Brinkmann:
LPCC: hierarchical persistent client caching for lustre. SC 2019: 88:1-88:14 - [c35]Markus Mäsker, Tim Süß, Lars Nagel, Lingfang Zeng, André Brinkmann:
Hyperion: Building the Largest In-memory Search Tree. SIGMOD Conference 2019: 1207-1222 - 2018
- [c34]Marc-Andre Vef, Nafiseh Moti, Tim Süß, Tommaso Tocci, Ramon Nou, Alberto Miranda, Toni Cortes, André Brinkmann:
GekkoFS - A Temporary Distributed File System for HPC Applications. CLUSTER 2018: 319-324 - [c33]Tim Süß, Nils Döring, André Brinkmann, Lars Nagel:
And Now for Something Completely Different: Running Lisp on GPUs. CLUSTER 2018: 434-444 - [c32]Tim Süß, Tunahan Kaya, Markus Mäsker, André Brinkmann:
Deduplication Analyses of Multimedia System Images. HotEdge 2018 - [c31]Tim Süß, Tunahan Kaya, Dustin Feld:
Extending PluTo for Multiple Devices by Integrating OpenACC. PDP 2018: 288-291 - 2017
- [c30]Tim Süß, Lars Nagel, Marc-Andre Vef, André Brinkmann, Dustin Feld, Thomas Soddemann:
Pure Functions in C: A Small Keyword for Automatic Parallelization. CLUSTER 2017: 552-556 - [c29]Lars Nagel, Tim Süß:
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs. EDCC 2017: 58-65 - [c28]André Brinkmann, Jürgen Kaiser, Martin Löwer, Lars Nagel, Ugur Sahin, Tim Süß:
Secure Genome Processing in Public Cloud and HPC Environments. IWSG 2017 - [c27]Giuseppe Congiu, Matthias Grawinkel, Federico Padua, James Morse, Tim Süß, André Brinkmann:
MERCURY: A Transparent Guided I/O Framework for High Performance I/O Stacks. PDP 2017: 46-53 - [c26]Yingjin Qian, Xi Li, Shuichi Ihara, Lingfang Zeng, Jürgen Kaiser, Tim Süß, André Brinkmann:
A configurable rule based classful token bucket filter network request scheduler for the lustre file system. SC 2017: 6 - 2016
- [c25]Giuseppe Congiu, Sai Narasimhamurthy, Tim Süß, André Brinkmann:
Improving Collective I/O Performance Using Non-volatile Memory Devices. CLUSTER 2016: 120-129 - [c24]Jürgen Kaiser, Ramy Gad, Tim Süß, Federico Padua, Lars Nagel, André Brinkmann:
Deduplication Potential of HPC Applications' Checkpoints. CLUSTER 2016: 413-422 - [c23]Tim Süß, Nils Döring, Ramy Gad, Lars Nagel, André Brinkmann, Dustin Feld, Thomas Soddemann, Stefan Lankes:
VarySched: A Framework for Variable Scheduling in Heterogeneous Environments. CLUSTER 2016: 489-492 - [c22]Tim Süß, Nils Döring, Ramy Gad, Lars Nagel, André Brinkmann, Dustin Feld, Eric Schricker, Thomas Soddemann:
Impact of the Scheduling Strategy in Heterogeneous Systems That Provide Co-Scheduling. COSH@HiPEAC 2016: 37-42 - [c21]Tim Süß, Nils Döring, Ramy Gad, Lars Nagel, André Brinkmann, Dustin Feld, Eric Schricker, Thomas Soddemann:
Impact of the Scheduling Strategy in Heterogeneous Systems That Provide Co-Scheduling. COSH@HiPEAC (extended versions) 2016: 142-162 - [c20]Jürgen Kaiser, Tim Süß, Lars Nagel, André Brinkmann:
Sorted deduplication: How to process thousands of backup streams. MSST 2016: 1-14 - [c19]Markus Mäsker, Lars Nagel, Tim Süß, André Brinkmann, Lennart Sorth:
Simulation and performance analysis of the ECMWF tape library system. SC 2016: 252-263 - [c18]Ramy Gad, Simon Pickartz, Tim Süß, Lars Nagel, Stefan Lankes, André Brinkmann:
Accelerating Application Migration in HPC. ISC Workshops 2016: 663-673 - 2015
- [c17]Jürgen Kaiser, André Brinkmann, Tim Süß, Dirk Meister:
Deriving and comparing deduplication techniques using a model-based classification. EuroSys 2015: 11:1-11:13 - [c16]Matthias Grawinkel, Michael Mardaus, Tim Süß, André Brinkmann:
Evaluation of a hash-compress-encrypt pipeline for storage system applications. NAS 2015: 355-356 - 2014
- [c15]Giuseppe Congiu, Matthias Grawinkel, Federico Padua, James Morse, Tim Süß, André Brinkmann:
Optimizing scientific file I/O patterns using advice based knowledge. CLUSTER 2014: 282-283 - [c14]Simon Pickartz, Ramy Gad, Stefan Lankes, Lars Nagel, Tim Süß, André Brinkmann, Stephan Krempel:
Migration Techniques in HPC Environments. Euro-Par Workshops (2) 2014: 486-497 - [c13]Ramy Gad, Tim Süß, André Brinkmann:
Compiler Driven Automatic Kernel Context Migration for Heterogeneous Computing. ICDCS 2014: 389-398 - [c12]André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß:
Scheduling shared continuous resources on many-cores. SPAA 2014: 128-137 - 2013
- [c11]Dirk Meister, André Brinkmann, Tim Süß:
File recipe compression in data deduplication systems. FAST 2013: 175-182 - [c10]Tim Süß, Andrew Schoenrock, Sebastian Meisner, Christian Plessl:
Parallel Macro Pipelining on the Intel SCC Many-Core Computer. IPDPS Workshops 2013: 64-73 - 2012
- [c9]Tim Süß, Clemens Koch, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide:
Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. ISVC (1) 2012: 502-512 - [c8]Matthias Grawinkel, Tim Süß, Gregor Best, Ivan Popov, André Brinkmann:
Towards Dynamic Scripted pNFS Layouts. SC Companion 2012: 13-17 - 2011
- [c7]Tim Süß, Clemens Koch, Claudius Jähn, Matthias Fischer:
Approximative occlusion culling using the hull tree. Graphics Interface 2011: 79-86 - 2010
- [c6]Dominic Dumrauf, Tim Süß:
On the Complexity of Local Search for Weighted Standard Set Problems. CiE 2010: 132-140 - [c5]Tim Süß, Claudius Jähn, Matthias Fischer:
Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. EGPGV@Eurographics 2010: 43-51 - [c4]Tim Süß, Timo Wiesemann, Matthias Fischer:
Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. NAS 2010: 448-456 - 2009
- [c3]Tobias Schumacher, Tim Süß, Christian Plessl, Marco Platzner:
Communication Performance Characterization for Reconfigurable Accelerator Design on the XD1000. ReConFig 2009: 119-124 - 2008
- [c2]Tim Süß, Daniel Huber, Matthias Fischer, Christoph Laroque, Wilhelm Dangelmaier:
A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. ISPA 2008: 587-593 - [c1]Wilhelm Dangelmaier, Matthias Fischer, Daniel Huber, Christoph Laroque, Tim Süß:
Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. WSC 2008: 2012-2020
Informal and Other Publications
- 2018
- [i2]Lars Nagel, Tim Süß, Kevin Kremer, M. Umar Hameed, Lingfang Zeng, André Brinkmann:
Time-efficient Garbage Collection in SSDs. CoRR abs/1807.09313 (2018) - 2010
- [i1]Dominic Dumrauf, Tim Süß:
On the Complexity of Local Search for Weighted Standard Set Problems. CoRR abs/1004.0871 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
