default search action
Lars Nagel 0001
Person information
- affiliation: Loughborough University, UK
- affiliation (former): Johannes Gutenberg-Universität Mainz, Germany
Other persons with the same name
- Lars Nagel 0002 — Fraunhofer-Institut für Materialfluss und Logistik (IML), Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c35]Chen Chen
, Lars Nagel
S-Cache: Function Caching for Serverless Edge Computing. EdgeSys@EuroSys 2023: 1-6 - [c34]Lars Nagel, Nikolay Popov, Tim Süß, Ze Wang
Analysis of Heuristics for Vector Scheduling and Vector Bin Packing. LION 2023: 583-598 - 2022
- [j13]Chen Chen
Distributed federated service chaining: A scalable and cost-aware approach for multi-domain networks. Comput. Networks 212: 109044 (2022) - [c33]Chen Chen
B-Scale: Bottleneck-aware VNF Scaling and Flow Routing in Edge Clouds. ISCC 2022: 1-6 - 2021
- [j12]Tim Süß, Lars Nagel
Pure Functions in C: A Small Keyword for Automatic Parallelization. Int. J. Parallel Program. 49(1): 1-24 (2021) - [j11]Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky
Randomized renaming in shared memory systems. J. Parallel Distributed Comput. 150: 112-120 (2021) - [c32]Petra Berenbrink, Tom Friedetzky, Christopher Hahn, Lukas Hintze, Dominik Kaaser, Peter Kling, Lars Nagel
Infinite Balanced Allocation via Finite Capacities. ICDCS 2021: 965-975 - [c31]Reza Salkhordeh, Kevin Kremer, Lars Nagel
Constant Time Garbage Collection in SSDs. NAS 2021: 1-9 - [c30]Chen Chen
Distributed federated service chaining for heterogeneous network environments. UCC 2021: 2:1-2:10 - 2020
- [j10]Wen Cheng, Tao Guo, Lingfang Zeng
Improving LSM-trie performance by parallel search. Softw. Pract. Exp. 50(10): 1952-1965 (2020)
2010 – 2019
- 2019
- [c29]Markus Mäsker, Tim Süß, Lars Nagel
Hyperion: Building the Largest In-memory Search Tree. SIGMOD Conference 2019: 1207-1222 - 2018
- [j9]Petra Berenbrink, Tom Friedetzky
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. Algorithmica 80(12): 3673-3703 (2018) - [j8]Ernst Althaus, André Brinkmann, Peter Kling
Scheduling shared continuous resources on many-cores. J. Sched. 21(1): 77-92 (2018) - [j7]Ramy Gad, Simon Pickartz
Zeroing memory deallocator to reduce checkpoint sizes in virtualized HPC environments. J. Supercomput. 74(11): 6236-6257 (2018) - [c28]Tim Süß, Nils Döring
And Now for Something Completely Different: Running Lisp on GPUs. CLUSTER 2018: 434-444 - [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) - 2017
- [c27]Tim Süß, Lars Nagel
Pure Functions in C: A Small Keyword for Automatic Parallelization. CLUSTER 2017: 552-556 - [c26]Lars Nagel
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs. EDCC 2017: 58-65 - [c25]Andreas Kohne, Marcel Krüger, Marco Pfahlberg, Olaf Spinczyk, Lars Nagel
Financial Evaluation of SLA-based VM Scheduling Strategies for Cloud Federations. CCB@EuroSys 2017: 1:1-1:7 - [c24]André Brinkmann, Jürgen Kaiser, Martin Löwer, Lars Nagel
Secure Genome Processing in Public Cloud and HPC Environments. IWSG 2017 - 2016
- [j6]Markus Mäsker, Lars Nagel
Smart Grid-aware scheduling in data centres. Comput. Commun. 96: 73-85 (2016) - [j5]Matthias Grawinkel, Lars Nagel
LoneStar RAID: Massive Array of Offline Disks for Archival Systems. ACM Trans. Storage 12(1): 5:1-5:29 (2016) - [c23]Jürgen Kaiser, Ramy Gad, Tim Süß, Federico Padua, Lars Nagel
Deduplication Potential of HPC Applications' Checkpoints. CLUSTER 2016: 413-422 - [c22]Tim Süß, Nils Döring
VarySched: A Framework for Variable Scheduling in Heterogeneous Environments. CLUSTER 2016: 489-492 - [c21]Andreas Kohne, Damian Pasternak, Lars Nagel
Evaluation of SLA-based decision strategies for VM scheduling in cloud data centers. CrossCloud@EuroSys 2016: 6:1-6:5 - [c20]Tim Süß, Nils Döring
Impact of the Scheduling Strategy in Heterogeneous Systems That Provide Co-Scheduling. COSH@HiPEAC 2016: 37-42 - [c19]Tim Süß, Nils Döring, Ramy Gad, Lars Nagel
Impact of the Scheduling Strategy in Heterogeneous Systems That Provide Co-Scheduling. COSH@HiPEAC (extended versions) 2016: 142-162 - [c18]Jürgen Kaiser, Tim Süß, Lars Nagel
Sorted deduplication: How to process thousands of backup streams. MSST 2016: 1-14 - [c17]Petra Berenbrink, Tom Friedetzky
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. PODC 2016: 83-92 - [c16]Markus Mäsker, Lars Nagel
Simulation and performance analysis of the ECMWF tape library system. SC 2016: 252-263 - [c15]Ramy Gad, Simon Pickartz
Accelerating Application Migration in HPC. ISC Workshops 2016: 663-673 - [i1]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-stabilizing Balls & Bins in Batches. CoRR abs/1603.02188 (2016) - 2015
- [j4]Jie Wu, Krishnaprasad Narayanan, Lars Nagel
Building a medical research cloud in the EASI-CLOUDS project. Concurr. Comput. Pract. Exp. 27(16): 4465-4477 (2015) - [c14]Matthias Grawinkel, Lars Nagel, Markus Mäsker, Federico Padua, André Brinkmann, Lennart Sorth:
Analysis of the ECMWF Storage Landscape. FAST 2015: 15-27 - [c13]Markus Mäsker, Lars Nagel
Smart grid-aware scheduling in data centres. SustainIT 2015: 1-9 - [c12]Petra Berenbrink, André Brinkmann
Randomized Renaming in Shared Memory Systems. IPDPS 2015: 542-549 - 2014
- [j3]Petra Berenbrink, André Brinkmann
Balls into non-uniform bins. J. Parallel Distributed Comput. 74(2): 2065-2076 (2014) - [c11]Simon Pickartz
Migration Techniques in HPC Environments. Euro-Par Workshops (2) 2014: 486-497 - [c10]Christoph Fiehe, Anna Litvina, Jakob Tonn, Jie Wu, Michael Scheel
Building a Medical Research Cloud in the EASI-CLOUDS Project. IWSG 2014: 36-41 - [c9]Andreas Kohne, Marc Spohr, Lars Nagel
FederatedCloudSim: a SLA-aware federated cloud simulation framework. CCB@Middleware 2014: 3:1-3:5 - [c8]André Brinkmann
Scheduling shared continuous resources on many-cores. SPAA 2014: 128-137 - 2013
- [c7]Petra Berenbrink, André Brinkmann
Distributing Storage in Cloud Environments. IPDPS Workshops 2013: 963-973 - [c6]André Brinkmann
Scalable Monitoring System for Clouds. UCC 2013: 351-356 - 2012
- [j2]Petra Berenbrink, André Brinkmann
Balls into bins with related random choices. J. Parallel Distributed Comput. 72(2): 246-253 (2012) - [c5]Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel
Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM 2012: 411-422 - 2011
- [b1]Lars Nagel:
Randomised load balancing. Durham University, England, UK, 2011 - [j1]Stefan S. Dantchev, Tom Friedetzky
Sublinear-time algorithms for tournament graphs. J. Comb. Optim. 22(3): 469-481 (2011) - [c4]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS 2011: 72-83 - 2010
- [c3]Petra Berenbrink, André Brinkmann
Balls into non-uniform bins. IPDPS 2010: 1-10 - [c2]Petra Berenbrink, André Brinkmann
Balls into bins with related random choices. SPAA 2010: 100-105
2000 – 2009
- 2009
- [c1]Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
Sublinear-Time Algorithms for Tournament Graphs. COCOON 2009: 459-471
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-10-07 21:21 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: