Pith. sign in

REVIEW

Energy and Performance-Can a Wimpy-Node Cluster Challenge a Brawny Server?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1407.0386 v2 pith:SYA2IBGD submitted 2014-07-01 cs.DB cs.DC

classification cs.DBcs.DC
keywords energyclusterperformanceserverbrawnysingleworkloadworkloads
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Traditional DBMS servers are usually over-provisioned for most of their daily workloads and, because they do not show good energy proportionality, waste a lot of energy while underutilized. A cluster of small (wimpy) servers, where the number of nodes can dynamically adjust to the current workload, might offer better energy characteristics for these workloads. Yet, clusters suffer from "friction losses" and may not be able to quickly adapt to the workload, whereas a single, brawny server delivers performance instantaneously. In this paper, we compare a small cluster of lightweight nodes to a single server in terms of performance and energy efficiency. We run several benchmarks, consisting of OLTP and OLAP queries at variable utilization to test the system's ability to adjust to the workloads. To quantify possible energy saving and its conceivable drawback on query runtime, we evaluate our implementation on a cluster as well as on a single, brawny server and compare the results w.r.t. performance and energy consumption. Our findings confirm that - based on the workload - energy can be saved without sacrificing too much performance.

Discussion (0). Continue with ORCID to comment.

Pith tools