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

Andrew Caniff

dblp:90/8023 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
1 paper
Cloud and datacenter computing · 50% Energy-efficient computing · 50%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling		 0.112010
Efficient resource allocation and power saving in multi-tiered systems · WWW 2010
Cloud and datacenter computing › resource provisioning
dynamic resource provisioning		 0.112010
Efficient resource allocation and power saving in multi-tiered systems · WWW 2010
Energy-efficient computing
power management		 0.112010
Efficient resource allocation and power saving in multi-tiered systems · WWW 2010
Energy-efficient computing › low-power design
power optimization		 0.112010
Efficient resource allocation and power saving in multi-tiered systems · WWW 2010

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

workload burstiness statistics · 0.1parameter-free algorithm · 0.1
YearPublicationVenuePosition
2010 Efficient resource allocation and power saving in multi-tiered systems
abstract
In this paper, we present Fastrack, a parameter-free algorithm for dynamic resource provisioning that uses simple statistics to promptly distill information about changes in workload burstiness. This information, coupled with the application's end-to-end response times and system bottleneck characteristics, guide resource allocation that shows to be very effective under a broad variety of burstiness profiles and bottleneck scenarios.
Andrew Caniff, Ningfang Mi, Ludmila Cherkasova, Evgenia Smirni
 WWW1