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

Kip Walker

dblp:80/3801 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-authorSoftware 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
Performance modeling and evaluation · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
profiling
0.012000
Efficient and Flexible Value Sampling · ASPLOS 2000
Performance modeling and evaluation › profiling
statistical profiling
0.012000
Efficient and Flexible Value Sampling · ASPLOS 2000
Compilers and program optimization › dynamic optimization
profile-guided optimization
0.012000
Efficient and Flexible Value Sampling · ASPLOS 2000

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

sampling · 0.1interrupt-based profiling · 0.1
YearPublicationVenuePosition
2000 Efficient and Flexible Value Sampling
abstract
This paper presents novel sampling-based techniques for collecting statistical profiles of register contents, data values, and other information associated with instructions, such as memory latencies. Values of interest are sampled in response to periodic interrupts. The resulting value profiles can be analyzed by programmers and optimizers to improve the performance of production uniprocessor and multiprocessor systems.Our value sampling system extends the DCPI continuous profiling infrastructure, and inherits many of its desirable properties: our value profiler has low overhead (approximately 10% slowdown); it profiles all the code in the system, including the operating system kernel; and it operates transparently, without requiring any modifications to the profiled code.
Michael Burrows, Úlfar Erlingsson, Shun-Tak Leung, Mark T. Vandevoorde, Carl A. Waldspurger, Kip Walker, William E. Weihl
ASPLOS6
2000 BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations
Mihai Budiu, Majd F. Sakr, Kip Walker, Seth Copen Goldstein
Euro-Par3
2000 Interfacing Reconfigurable Logic with a CPU
abstract
Reconfigurable computing devices have achieved substantial performance improvements over conventional processors on some computational kernels. These benefits derive from hardware customization which avoids the mismatch between the basic requirements of the algorithms and the architectures of the processors. A reconfigurable fabric alone is not sufficient for general-purpose computing since it can be ill-suited to executing entire programs due to space limitations, dataflow-centricity, and inefficiency at implementing some operations (e.g. floating-point arithmetic). These observations have led to the appearance of numerous designs which place some form of reconfigurable logic under the control of a general-purpose processor. The authors explore the ways in which a reconfigurable fabric can be interfaced with a general-purpose processor. While off-chip reconfigurable fabrics have proven to be quite effective at performing streaming, data-intensive computations, they require large streams of data to overcome the latency between the devices. We explore the design space for an on-chip fabric, i.e., a reconfigurable function unit (RFU). An RFU allows smaller portions of application to be mapped to the fabric in the form of custom instructions. Though the speedups achieved for stream based computations will in general be much larger than those for custom instructions, they are limited to a smaller class of applications. Custom instructions, however, can be found in a larger class of programs, and compiler techniques can automatically create them.
Kip Walker, Mihai Budiu, Seth Copen Goldstein
FCCM1