David K. Bradley

dblp:08/1067 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 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
Performance modeling and evaluation · 87% High-performance computing · 13%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
workload characterization
0.011993
A parallelism-based analytic approach to performance evaluation using application programs · Proc. IEEE 1993
High-performance computing › supercomputing
supercomputer performance evaluation
0.011993
A parallelism-based analytic approach to performance evaluation using application programs · Proc. IEEE 1993

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

simulation · 0.0application benchmarks · 0.0
YearPublicationVenuePosition
1993 A parallelism-based analytic approach to performance evaluation using application programs
abstract
A brief overview of performance evaluation and benchmarking is presented. It is shown that traditional performance measurements recorded in these activities are really a direct measurement of the parallelism in software and hardware. A framework called the 'Path to Performance' that identifies the agents and activities that change the parallelism as it moves from problem to solution is developed. It is shown where the various current application benchmarks apply probes on the Path and which agents are being measured. The traditional time-based performance measurements are recast into parallelism-based performance measurements to show that understanding performance implies understanding the parallelism. A simulation tool and methodology are described for measuring and comparing the executed parallelism on a single CRAY Y-MP CPU. Application of the methodology to several of the Perfect Benchmarks suggests that the benchmarking utility of these programs on the Y-MP may be questioned because they exercise the machine in the same way.>
David K. Bradley, John L. Larson
Proc. IEEE1
1991 Supercomputer workload decomposition and analysis
abstract
The workload of the NSF supercomputer center at the University of Illinois is decomposed into its major constituent programs, and performance characteristics of those programs are described in detail.The resulting data is compared with similar data obtained from standard benchmarks showing that applications level programs are clearly distinct from kernel and algorithm benchmarks.The workload decomposition shows that overidl utilization is quite high but is heavily influenced by a small number of sophisticated users with large allocations who run highly efficient programs.Some high level profifing data leads to an analysis of the benefits of inliniug subroutines.A number of other preliminary results are also described.This effort, called the Supercomputer Applications Database (SAD) Project, is the first detailed workload analysis of a US national supercomputer center.
David K. Bradley, George Cybenko, John L. Larson, F. Ahmad, J. Golab, Mark Straka
ICS1