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

Carlo Fuerst

dblp:127/7359 · also Carlo Fürst · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2018
—ORCID · none

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

Computer networks · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1 · 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
4 papers
Cloud and datacenter computing · 73% Embedded and real-time systems · 20% Memory systems · 8%
Computer networks
2 papers
Datacenter networks · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.622018
Kraken: Online and Elastic Resource Reservations for Cloud Datacenters · IEEE/ACM Trans. Netw. 2018
Kraken: Online and elastic resource reservations for multi-tenant datacenters · INFOCOM 2016
Embedded and real-time systems › real-time scheduling
resource reservation
0.522018
Kraken: Online and Elastic Resource Reservations for Cloud Datacenters · IEEE/ACM Trans. Netw. 2018
Kraken: Towards Elastic Performance Guarantees in Multi-tenant Data Centers · SIGMETRICS 2015
Cloud and datacenter computing › resource provisioning
online resource reservation
0.422018
Kraken: Online and Elastic Resource Reservations for Cloud Datacenters · IEEE/ACM Trans. Netw. 2018
Kraken: Online and elastic resource reservations for multi-tenant datacenters · INFOCOM 2016
Cloud and datacenter computing › multi-tenancy
multi-tenant datacenter
0.322016
Kraken: Online and elastic resource reservations for multi-tenant datacenters · INFOCOM 2016
Kraken: Towards Elastic Performance Guarantees in Multi-tenant Data Centers · SIGMETRICS 2015
Cloud and datacenter computing › resource management
datacenter resource management
0.212015
How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings · ICNP 2015
Memory systems
data locality
0.212015
How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings · ICNP 2015
Cloud and datacenter computing
resource management
0.212015
Kraken: Towards Elastic Performance Guarantees in Multi-tenant Data Centers · SIGMETRICS 2015
Cloud and datacenter computing › cluster resource management and scheduling
virtual cluster placement
0.212015
How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings · ICNP 2015
Cloud and datacenter computing
resource allocation
0.112016
Kraken: Online and elastic resource reservations for multi-tenant datacenters · INFOCOM 2016
Graph algorithms and graph theory
graph embedding
0.112015
How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings · ICNP 2015

Methods — techniques the papers use, named apart from their topics

online algorithm · 0.9optimality analysis · 0.7virtual network embedding · 0.4online resource reservation · 0.4algorithmic analysis · 0.4NP-hardness proof · 0.4simulation · 0.2
YearPublicationVenuePosition
2018 Kraken: Online and Elastic Resource Reservations for Cloud Datacenters
abstract
In cloud environments, the absence of strict network performance guarantees leads to unpredictable job execution times. To address this issue, recently, there have been several proposals on how to provide guaranteed network performance. These proposals, however, rely on computing resource reservation schedules a priori. Unfortunately, this is not practical in today's cloud environments, where application demands are inherently unpredictable, e.g., due to differences in the input data sets or phenomena, such as failures and stragglers. To overcome these limitations, we designed Kraken, a system that allows to dynamically update minimum guarantees for both network bandwidth and compute resources at runtime. Unlike previous work, Kraken does not require prior knowledge about the resource needs of the applications but allows to modify reservations at runtime. Kraken achieves this through an online resource reservation scheme, which comes with provable optimality guarantees. In this paper, we motivate the need for dynamic resource reservation schemes, present how this is provided by Kraken, and evaluate Kraken via extensive simulations and a preliminary Hadoop prototype.
Carlo Fuerst, Stefan Schmid 0001, Lalith Suresh 0001, Paolo Costa
IEEE/ACM Trans. Netw.1
2017 Data locality and replica aware virtual cluster embeddings
Carlo Fuerst, Maciej Pacut, Stefan Schmid 0001
Theor. Comput. Sci.1
2016 Kraken: Online and elastic resource reservations for multi-tenant datacenters
abstract
In multi-tenant cloud environments, the absence of strict network performance guarantees leads to unpredictable job execution times. To address this issue, recently there have been several proposals on how to provide guaranteed network performance. These proposals, however, rely on computing resource reservation schedules a priori. Unfortunately, this is not practical in today's cloud environments, where application demands are inherently unpredictable, e.g., due to differences in the input datasets or phenomena such as failures and stragglers. To overcome these limitations, we designed KRAKEN, a system that allows tenants to dynamically request and update minimum guarantees for both network bandwidth and compute resources at runtime. Unlike previous work, Kraken does not require prior knowledge about the resource needs of the tenants' applications but allows tenants to modify their reservation at runtime. Kraken achieves this through an online resource reservation scheme which comes with provable optimality guarantees. In this paper, we motivate the need for dynamic resource reservation schemes, present how this is provided by Kraken, and evaluate Kraken via extensive simulations.
Carlo Fuerst, Stefan Schmid 0001, Lalith Suresh 0001, Paolo Costa
INFOCOM1
2015 How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings
abstract
Virtualized datacenters offer great flexibilities in terms of resource allocation. In particular, by decoupling applications from the constraints of the underlying infrastructure, virtualization supports an optimized mapping of virtual machines as well as their interconnecting network to their physical counterparts: essentially a graph embedding problem. However, existing embedding algorithms such as Oktopus and Proteus often ignore a crucial dimension of the embedding problem, namely data locality: the input to a cloud application such as MapReduce is typically stored in a distributed, and sometimes redundant, file system. Since moving data is costly, an embedding algorithm should be data locality aware, and allocate computational resources close to the data, in case of redundant storage, the algorithm should also optimize the replica selection. This paper initiates the algorithmic study of data locality aware virtual cluster embeddings on datacenter topologies. We show that despite the multiple degrees of freedom in terms of embedding, replica selection and assignment, many problems can be solved efficiently. We also highlight the limitations of such optimizations, by presenting several NP-hardness proofs, interestingly, our hardness results also hold in uncapacitated networks of small diameter.
Carlo Fuerst, Maciej Pacut, Paolo Costa, Stefan Schmid 0001
ICNP1
2015 Kraken: Towards Elastic Performance Guarantees in Multi-tenant Data Centers
abstract
It is well-known that without strict network bandwidth guarantees, application performance in multi-tenant cloud environments is unpredictable. While recently proposed systems support explicit bandwidth reservation mechanisms, they require the resource schedules to be announced ahead of time. We argue that this is not practical in today's cloud environments, where application demands are inherently unpredictable, e.g., due to stragglers. We in this paper present KRAKEN, a system that allows tenants to dynamically request and update minimum resource guarantees for both network bandwidth and compute resources at runtime. Unlike previous work, Kraken does not require prior knowledge about the resource needs of the tenants' applications but allows tenants to modify their reservation at runtime. Kraken achieves this through an online resource reservation scheme, and by optimally embedding and reconfiguring virtual networks.
Carlo Fuerst, Stefan Schmid 0001, Lalith Suresh 0001, Paolo Costa
SIGMETRICS1