Demo Data from EDBT 2026 / reviewers in the wild / expert
Shuben Zhang
dblp:145/6568
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1
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 |
Cloud and datacenter computing · 77% Performance modeling and evaluation · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing
resource management |
0.3 | 1 | 2017 | Dynamic IaaS Computing Resource Provisioning Strategy with QoS Constraint · IEEE Trans. Serv. Comput. 2017 |
Cloud and datacenter computing
resource provisioning |
0.3 | 1 | 2017 | Dynamic IaaS Computing Resource Provisioning Strategy with QoS Constraint · IEEE Trans. Serv. Comput. 2017 |
Performance modeling and evaluation › stochastic analysis
large deviations |
0.1 | 1 | 2017 | Dynamic IaaS Computing Resource Provisioning Strategy with QoS Constraint · IEEE Trans. Serv. Comput. 2017 |
Performance modeling and evaluation
queueing models |
0.1 | 1 | 2017 | Dynamic IaaS Computing Resource Provisioning Strategy with QoS Constraint · IEEE Trans. Serv. Comput. 2017 |
Methods — techniques the papers use, named apart from their topics
large deviation principle · 0.3autoregressive model · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Dynamic IaaS Computing Resource Provisioning Strategy with QoS ConstraintabstractIn an IaaS cloud, virtual machines (VMs), also called instances, may be classified as reserved instances and on-demand instances. The reserved instances having long-term commitments and one-time payment are appropriate for the steady or predictable workloads, while for short-term, spiky or unpredictable workloads, the on-demand instances having flexible hourly payment and no long-term commitments may be more suitable for reducing the cost. In this paper, we consider the economical provisioning of reserved and/or on-demand instances for meeting time-varying computing workload of compute-intensive applications. In order to achieve this, we conceive a strategy for determining the amount of the purchased instances dynamically in order to minimize the total computing cost while keeping quality-of-service (QoS). By mapping QoS as the overload probability, we propose a dynamic instance provisioning strategy based on the large deviation principle, which is capable of calculating the minimum number of instances for the upcoming demands subject to the overload probability below a desired threshold. In addition, a reserved instance provisioning strategy for further reducing the total cost is also proposed by applying the autoregressive (AR) model to calculate the number of reserved instances for the average computation requirements. Finally, the simulations are performed based on real workload traces to show the attainable performance of the proposed instance provisioning strategy for the computing service in an IaaS cloud. Yongyi Ran, Jian Yang 0014, Shuben Zhang, Hongsheng Xi |
IEEE Trans. Serv. Comput. | 3 |