Contents
1 A Note on Disk Drag Dynamics (2012)
2 A Methodology for Optimizing Multithreaded System Scalability on Multicores (2011)
3 A Note on Parallel Algorithmic Speedup Bounds (2011)
4 Mind Your Knees and Queues. Responding to Hyperbole with Hyperbolæ (2009)
5 A General Theory of Computational Scalability Based on Rational Functions (2008)
6 Getting in the Zone for Successful Scalability (2008)
7 Multidimensional Visualization of Oracle Performance Using Barry007 (2008)
8 Eine Chance für Linux (2008)
9 Better Performance Management Through Better Visualization Tools (2008)
10 Seeing It All at Once with Barry (2007)
11 Leistungsdiagnostik (Load Averages and Stretch Factors) (2007)
12 Moore's Law: More or Less? (2007)
13 Visualizing Virtualization (2007)
14 Berechenbare Performance (Predicting Performance) (2007)
15 Guerrilla Scalability: How to Do Virtual Load Testing (2007)
16 The Virtualization Spectrum from Hyperthreads to GRIDs (2006)
17 Reconstructing the Future: Capacity Planning with Data That's Gone Troppo (2006)
18 Benchmarking Blunders and Things That Go Bump in the Night (2006)
19 Unification of Amdahl's Law, LogP and Other Performance Models for Message-Passing Architectures (2005)
20 (Numerical) Investigations into Physical Power-law Models of Internet Traffic Using the Renormalization Group (2005)
21 Millennium Performance Problem 1: Performance Visualization (2005)
22 Benchmarking Blunders and Things That Go Bump in the Night (2004)
23 How to Get Unbelievable Load Test Results (2004)
24 Performance Evaluation of Packet-to-Cell Segmentation Schemes in Input Buffered Packet Switches (2003)
25 Unix Load Average Metric (2003-2004)
26 Series on Guerrilla Capacity Planning (2003)
27 Characterization of the Burst Stabilization Protocol for the RR/CICQ Switch (2003)
28 A New Interpretation of Amdahl's Law and Geometric Scalability (2002)
29 Hit-and-Run Tactics Enable Guerrilla Capacity Planning (2002)
30 Capacity Calculations: Handle with Care (2002)
31 Hypernets: Good (G)news for Gnutella! (2002)
32 Of Buses and Bunching: Strangeness in the Queue (2001)
33 Quantifying Application and Server Scalability (2001)
34 How to Write Application Probes (Updated 2001)
35 Scalability Models for a Hypergrowth e-Commerce Website (2000)
36 BIRDS-I: A Benchmark for Image Retrieval on the Internet (2000)
37 Windows NT Scalability (1997-1998)
38 The MP Effect: Parallel Processing in Pictures (1996)
39 A Simple Capacity Model of Massively Parallel Transaction Systems (1993)
40 The Collapse of Internet Performance (1988)
1 A Note on Disk Drag Dynamics (2012)
Abstract:
The electrical power consumed by typical magnetic hard disk drives (HDD) not
only increases linearly with the number of spindles but, more significantly, it
increases as very fast power-laws of speed (RPM) and diameter. Since the
theoretical basis for this relationship is neither well-known nor readily
accessible in the literature, we show how these exponents arise from aerodynamic
disk drag and discuss their import for green storage capacity planning.
Available as an arXiv e-print.
2 A Methodology for Optimizing Multithreaded System Scalability on Multicores (2011)
Abstract:
We show how to quantify scalability with the Universal Scalability Law (USL) by
applying it to performance measurements of memcached, J2EE, and Weblogic on
multi-core platforms. Since commercial multicores are essentially black-boxes,
the accessible performance gains are primarily available at the application
level. We also demonstrate how our methodology can identify the most significant
performance tuning opportunities to optimize application scalability, as well as
providing an easy means for exploring other aspects of the multi-core system
design space.
Available as an arXiv e-print.
3 A Note on Parallel Algorithmic Speedup Bounds (2011)
Abstract:
A parallel program can be represented as a directed acyclic graph. An
important performance bound is the time to execute the critical path
through the graph. We show how this performance metric is related to
Amdahl speedup and the degree of average parallelism. These bounds
formally exclude superlinear performance.
Available as an arXiv e-print.
4 Mind Your Knees and Queues. Responding to Hyperbole with Hyperbolæ (2009)
Abstract:
How do you determine where the response-time "knee" occurs? Calculating
where the response time suddenly begins to climb dramatically is considered
by many to be an important determinant for such things as load testing,
scalability analysis, and setting application service targets. This
question arose in last month's
MeasureIT.
I examine it here
in a rigorous but unconventional way.
5 A General Theory of Computational Scalability Based on Rational Functions (2008)
Abstract:
The universal scalability law of computational capacity is a rational
function Cp = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a
second-degree polynomial in the number of physical processors p, that
has been long used for statistical modeling and prediction of computer
system performance. We prove that Cp is equivalent to the synchronous
throughput bound for a machine-repairman with state-dependent service
rate. Simpler rational functions, such as Amdahl's law and Gustafson
speedup, are corollaries of this queue-theoretic bound. Cp is further
shown to be both necessary and sufficient for modeling all practical
characteristics of computational scalability.
Available as an arXiv e-print.
6 Getting in the Zone for Successful Scalability (2008)
Jointly with J. Holtman. Accepted for CMG 2008, Las Vegas, Nevada.
Abstract: The
Universal Scalability Law
(USL) is an analytic function used to quantify application scaling. It is
universal because it subsumes Amdahl's law (AL) and linear scaling (LS) as
special cases. Using simulation, we show (1) that USL is equivalent to
synchronous queueing in a load-dependent machine repairman model, and (2)
how LS, AL and USL can be regarded as boundaries defining three performance
zones. Typical throughput measurements lie in all three zones. Simulation
scenarios provide insight into which application features should be tuned
to get into the optimal performance zone.
7 Multidimensional
Visualization of Oracle Performance Using Barry007 (2008)
Jointly with T. Põder. Accepted for CMG 2008, Las Vegas, Nevada.
Abstract:
Most generic performance tools display only system-level
performance data using 2-dimensional plot or diagram, and this
limits the informational detail that can be displayed. A modern
relational database system like Oracle, however, can concurrently
serve thousands of client processes with different workload
characteristics and generic data displays inevitably hide important
information. Drawing on our previous work,
this paper demonstrates the application of Barry007 (See paper 10)
multidimensional visualization for analyzing Oracle end-user
session-level performance showing both collective trends and
individual performance anomalies.
8 Eine Chance für Linux (2008)
Appears in the May 18 volume of
Linux Technical Review.
(in German)
Abstract (Translation):
Linux could be in a position to expand its presence in the server market by
looking to mainframe computer performance management as a role model and
adapting its instrumentation accordingly.
9 Better Performance Management Through Better Visualization Tools (2008)
Invited presentation at the
Hotsos Symposium
in Dallas, Texas, March 2-6 2008.
10 Seeing It All at Once with Barry (2007)
Jointly with M. F. Jauvin. Presented at CMG 2007, San Diego, California.
Paper (PDF),
Slides (PDF),
Animations (HTML),
Tools (HTML).
11 Leistungsdiagnostik (Load Averages and Stretch Factors) (2007)
To appear in the July 2007 issue of Linux Magazin.
(in German)
12 Moore's Law: More or Less? (2007)
Published in the May issue of the CMG
MeasureIT
e-zine.
13 Visualizing Virtualization (2007)
Guest editorial for the March issue of the CMG e-zine called
MeasureIT.
14 Berechenbare Performance (Predicting Performance) (2007)
Invited paper published in the
Linux Technical Review 02 Ð Monitoring.
(in German)
15 Guerrilla Scalability: How to Do Virtual Load Testing (2007)
Invited presentation at the
Hotsos Symposium 2007,
March, Dallas, Texas.
16 The Virtualization Spectrum from Hyperthreads to GRIDs (2006)
This
paper,
presented at CMG 2006, Reno, Nevada,
is based on the following observations:
- Disparate types of virtual machines lie on a discrete spectrum bounded
by hyperthreading at one extreme and hyperservices at the other,
- Poll-based scheduling is the common
architectural element in most virtual machine implementations.
The associated polling frequency (from GHz to μHz) positions each
virtual machine implementation into a region of the VM-spectrum. Several
case studies are analyzed to illustrate how this insight can make virtual machines
more visible to performance management techniques.
17 Reconstructing the Future: Capacity Planning with Data That's Gone Troppo (2006)
Jointly with S. Jenkin.
Paper
presented at CMG-A 2006, Sydney, Australia.
18 Benchmarking Blunders and Things That Go Bump in the Night (2006)
Published as
Part I
and
Part II
in the CMG MeasureIT online magazine.
19 Unification of Amdahl's Law, LogP and Other Performance Models for Message-Passing
Architectures (2005)
This
paper
generalizes the theorem in paper 28 below and was presented at
PDCS 2005
VII International Conference on Parallel and Distributed Computing Systems
20 (Numerical) Investigations into Physical Power-law Models of
Internet Traffic Using the Renormalization Group (2005)
Paper
presented at the
Triennial Conference of the International Federation of Operations Research Societies,
Honolulu, Hawaii, July 11-15, 2005.
Uses the real-space variant of the
renormalization group
to exclude certain models that have appeared in the literature to account for so-called
self-similar Internet traffic and further suggests that the claimed ramifications
for Internet capacity planning may have been over-emphasized.
Chapter 10 of
Guerrilla Capacity Planning
presents these conclusions in a less mathematical form.
21 Millennium Performance Problem 1: Performance Visualization (2005)
Published in the CMG
MeasureIT
online magazine.
22 Benchmarking Blunders and Things That Go Bump in the Night (2004)
Abstract:
Benchmarking; by which I mean any computer system that is driven by a controlled
workload, is the ultimate in performance testing and simulation. Aside from
being a form of institutionalized cheating, it also offer countless
opportunities for systematic mistakes in the way the workloads are applied and
the resulting measurements interpreted. Right test, wrong conclusion is a
ubiquitous mistake that happens because test engineers tend to treat data as
divine. Such reverence is not only misplaced, it's also a sure ticket to
production hell when the application finally goes live. I demonstrate how such
mistakes can be avoided by means of two war stories that are real WOPRs. (a) How
to resolve benchmark flaws over the psychic hotline and (b) How benchmarks can
go flat with too much Java juice. In each case I present simple performance
models and show how they can be applied to correctly assess benchmark data.
Presented at WORP2 Workshop 2004
Available as an arXiv e-print.
23 How to Get Unbelievable Load Test Results (2004)
Featured at
TeamQuest Corporation
as an online capacity planning column.
24 Performance Evaluation of Packet-to-Cell Segmentation Schemes in Input Buffered Packet Switches (2003)
Jointly with K. J. Christensen, K. Yoshigoe and A. Roginsky
Presented at High-Speed Networks Symposium
of the IEEE International Conference on Communications (ICC 2004).
Available from
arXiv
server.
25 Unix Load Average Metric (2003-2004)
Originally published as a series of online performance columns for
TeamQuest Corp.
NOTE: The hyperlinked version of the Linux kernel is release 2.6.xx
This information, like everything else, can be found in the online files along with the
source code
(as cited in my writings).
A more detailed discussion appears in Chapter 4 of my
Perl::PDQ book.
26 Series on Guerrilla Capacity Planning (2003)
These two articles:
were published in the CMG MeasureIT online magazine.
27 Characterization of the Burst Stabilization Protocol for the RR/CICQ Switch (2003)
Jointly with K. J. Christensen and K. Yoshigoe
Accepted by IEEE Conference on Local Computer Networks
Download as a PDF from
arXiv
server.
28 A New Interpretation of Amdahl's Law and Geometric Scalability (2002)
Amongst other things, this paper presents the theorem:
Amdahl's law for parallel speedup is equivalent to the synchronous
queueing
bound on throughput in the repairman model of a symmetric multiprocessor.
Download from the
arXiv
server.
29 Hit-and-Run Tactics Enable Guerrilla Capacity Planning (2002)
Published in
IEEE IT Professional
journal, pp. 40-46, July-August issue, 2002.
30 Capacity Calculations: Handle with Care (2002)
TeamQuest
online column.
31 Hypernets: Good (G)news for Gnutella! (2002)
Online
article responding to an earlier analysis of Gnutella written by Jordan Ritter in 2001.
Measurements of both Napster and Gnutella are also disussed in this 2003
paper.
I point out that hypernets like a 20-degree virtual hypertorus or hypercube are much more efficient than a tree.
I looks as though BitTorrent if fact does something like this.
This online article was
slashdotted
in Feb, 2002.
32 Of Buses and Bunching: Strangeness in the Queue (2001)
TeamQuest
online column.
33 Quantifying Application and Server Scalability (2001)
The following series of three articles:
were published as
TeamQuest
online columns.
34 How to Write Application Probes (Updated 2001)
TeamQuest
performance column online.
35 Scalability Models for a Hypergrowth e-Commerce Website (2000)
Published in the
Springer Lecture Notes in Computer Science
series.
36 BIRDS-I: A Benchmark for Image Retrieval on the Internet (2000)
Tech Report
published by HP Labs.
37 Windows NT Scalability (1997-1998)
The following series of three papers:
were published in the
USENIX
journal.
38 The MP Effect: Parallel Processing in Pictures (1996)
Received CMG 1996
Best Paper
award.
39 A Simple Capacity Model of Massively Parallel Transaction Systems (1993)
This is the
original paper
that forms the basis of the
Universal Law of Computational Scaling,
and was presented at CMG 1993, San Diego, California.
40 The Collapse of Internet Performance (1988)
Background information.
Information Processing Letters
publication (5 MD scanned PDF).
Copyright © 1996-2011 Performance Dynamics Company. All Rights Reserved.
File translated from
TEX
by
TTH,
version 3.38.
On 20 Jun 2012, 07:48.