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.

Lambert Schaelicke

dblp:82/5678 · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
0since 2021 · last 2009
—ORCID · none

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

Systems, architecture and hardware · 10 · 5 first-authorSecurity and privacy · 1 · 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
4 papers
Memory systems · 64% Storage systems · 20% Processor architecture and microarchitecture · 7%

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

TopicWeightPapersLastEvidence papers
Storage systems
i/o architecture
0.112006
Design Trade-Offs for User-Level I/O Architectures · IEEE Trans. Computers 2006
Memory systems
memory controller
0.122001
The Impulse Memory Controller · IEEE Trans. Computers 2001
Impulse: Building a Smarter Memory Controller · HPCA 1999
Memory systems › memory access
indirect addressing
0.012001
The Impulse Memory Controller · IEEE Trans. Computers 2001
Memory systems › memory management
address remapping
0.011999
Impulse: Building a Smarter Memory Controller · HPCA 1999
Memory systems › cache
prefetching
0.011999
Impulse: Building a Smarter Memory Controller · HPCA 1999
Interconnection networks and networks-on-chip › interconnect architecture
scalable interconnect
0.012006
Design Trade-Offs for User-Level I/O Architectures · IEEE Trans. Computers 2006
Memory systems
memory-bound computation
0.022001
The Impulse Memory Controller · IEEE Trans. Computers 2001
Impulse: Building a Smarter Memory Controller · HPCA 1999
Memory systems
DRAM
0.012001
The Impulse Memory Controller · IEEE Trans. Computers 2001
High-performance computing
scientific computing
0.011999
Impulse: Building a Smarter Memory Controller · HPCA 1999
Memory systems › memory interconnect
memory bus
0.011998
Improving I/O Performance with a Conditional Store Buffer · MICRO 1998

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

simulation-based evaluation · 0.1simulation · 0.1
YearPublicationVenuePosition
2009 Revisiting Cache Block Superloading
Matthew A. Watkins, Sally A. McKee, Lambert Schaelicke
HiPEAC3
2007 A Phase-Adaptive Approach to Increasing Cache Performance
Matthew A. Watkins, Sally A. McKee, Lambert Schaelicke
PACT3
2006 The design and utility of the ML-RSIM system simulator
Lambert Schaelicke, Michael A. Parker
J. Syst. Archit.1
2006 Design Trade-Offs for User-Level I/O Architectures
abstract
To address the growing I/O bottleneck, next-generation distributed I/O architectures employ scalable point-to-point interconnects and minimize operating system overhead by providing user-level access to the I/O subsystem. Reduced I/O overhead allows I/O intensive applications to efficiently employ latency hiding techniques for improved throughput. This paper presents the design of a novel scalable user-level I/O architecture and evaluates the impact of various architectural mechanisms in terms of overall performance improvement. Results demonstrate that eliminating data movement across protection domains is the dominant contributor to improved scalability. Eliminating system call and interrupt overhead only has a small additional benefit that may not justify the additional hardware support required. While this evaluation is based on one specific design, the conclusions can be generalized to other user-level I/O architectures
Lambert Schaelicke, Al Davis
IEEE Trans. Computers1
2005 Evaluating the impact of the simulation environment on experimentation results
Lambert Schaelicke
Perform. Evaluation1
2004 Cache implications of aggressively pipelined high performance microprocessors
abstract
One of the major design decisions when developing a new microprocessor is determining the target pipeline depth and clock rate since both factors interact closely with one another. The optimal pipeline depth of a processor has been studied before, but the impact of the memory system on pipeline performance has received less attention. This study analyzes the affect of different level-1 cache designs across a range of pipeline depths to determine what role the memory system design plays in choosing a clock rate and pipeline depth for a microprocessor. The pipeline depths studied here range from those found in current processors to those predicted for future processors. For each pipeline depth a variety of level-1 cache sizes are simulated to explore the relationship between clock rate, pipeline depth, cache size and access latency. Results show that the larger caches afforded by shorter pipelines with slower clocks outperform longer pipelines with smaller caches and higher clock rates.
Timothy J. Dysart, Branden J. Moore, Lambert Schaelicke, Peter M. Kogge
ISPASS3
2003 Profiling Interrupt Handler Performance through Kernel Instrumentation
abstract
As a result of technology trends towards multigigahertz processors, the I/O system is becoming a critical bottleneck for many applications. Interrupts are a major aspect of most device drivers. Characterizing interrupt performance and its relation to architectural trends is important for understanding and improving I/O subsystem performance. Kernel instrumentation in combination with performance counters is able to overcome the limitations of microbenchmarks when measuring interrupts. A comparative analysis of a range of IA-32 based systems reveals that interrupt handler code exhibits only a low degree of instruction-level parallelism. Consequently, the trend towards deeper processor pipelines and smaller caches to maximize clock frequency can be detrimental to interrupt handling performance.
Branden J. Moore, Thomas Slabach, Lambert Schaelicke
ICCD3
2003 Characterizing the Performance of Network Intrusion Detection Sensors
Lambert Schaelicke, Thomas Slabach, Branden J. Moore, Curt Freeland
RAID1
2001 The Impulse Memory Controller
abstract
Impulse is a memory system architecture that adds an optional level of address indirection at the memory controller. Applications can use this level of indirection to remap their data structures in memory. As a result, they can control how their data is accessed and cached, which can improve cache and bus utilization. The Impulse design does not require any modification to processor, cache, or bus designs since all the functionality resides at the memory controller. As a result, Impulse can be adopted in conventional systems without major system changes. We describe the design of the Impulse architecture and how an Impulse memory system can be used in a variety of ways to improve the performance of memory-bound applications. Impulse can be used to dynamically create superpages cheaply, to dynamically recolor physical pages, to perform strided fetches, and to perform gathers and scatters through indirection vectors. Our performance results demonstrate the effectiveness of these optimizations in a variety of scenarios. Using Impulse can speed up a range of applications from 20 percent to over a factor of 5. Alternatively, Impulse can be used by the OS for dynamic superpage creation; the best policy for creating superpages using Impulse outperforms previously known superpage creation policies.
Lixin Zhang 0002, Zhen Fang 0002, Michael A. Parker, Binu K. Mathew, Lambert Schaelicke, John B. Carter, Wilson C. Hsieh, Sally A. McKee
IEEE Trans. Computers5
2000 Profiling I/O Interrupts in Modern Architectures
abstract
As applications grow increasingly communication-oriented, interrupt performance quickly becomes a crucial component of high performance I/O system design. At the same time, accurately measuring interrupt handler performance is difficult with the traditional simulation, instrumentation, or statistical sampling approaches. One of the most important components of interrupt performance is cache behavior. This paper presents a portable method for measuring the cache effects of I/O interrupt handling using hardware performance counters. The method is demonstrated on two commercial platforms with different architectures, the SGI Origin 200 and the Sun Ultra-1. This case study uses the methodology to measure the overhead of the two most common forms of interrupts: disk and network interrupts. It demonstrates that the method works well and is reasonably robust. In addition, the results show that network interrupts have larger cache footprints than disk interrupts, and behave very differently on both platforms, due to significant differences in OS organization.
Lambert Schaelicke, Al Davis, Sally A. McKee
MASCOTS1
1999 Impulse: Building a Smarter Memory Controller
abstract
Impulse is a new memory system architecture that adds two important features to a traditional memory controller. First, Impulse supports application-specific optimizations through configurable physical address remapping. By remapping physical addresses, applications control how their data is accessed and cached, improving their cache and bus utilization. Second, Impulse supports prefetching at the memory controller, which can hide much of the latency of DRAM accesses. In this paper we describe the design of the Impulse architecture, and show how an Impulse memory system can be used to improve the performance of memory-bound programs. For the NAS conjugate gradient benchmark, Impulse improves performance by 67%. Because it requires no modification to processor, cache, or bus designs, Impulse can be adopted in conventional systems. In addition to scientific applications, we expect that Impulse will benefit regularly strided memory-bound applications of commercial importance, such as database and multimedia programs.
John B. Carter, Wilson C. Hsieh, Leigh Stoller, Mark R. Swanson, Lixin Zhang 0002, Erik Brunvand, Al Davis, Chen-Chi Kuo, Ravindra Kuramkote, Michael A. Parker, Lambert Schaelicke, Terry Tateyama
HPCA11
1998 Improving I/O Performance with a Conditional Store Buffer
abstract
Microprocessor I/O performance is becoming increasingly critical in order to support efficient communication interfaces as modern microprocessors continue to be used in a variety of multiprocessor configurations. Numerous performance enhancements have been made to improve processor performance by improving the latency and bandwidth to main memory or creating efficient mechanisms to hide main memory latency. These include speculative out of order instruction execution, lock-up free caches, and improved memory bus designs. Sadly these improvements are not directly applicable to improved I/O system performance and may even complicate high performance I/O system design. This paper introduces and analyzes the design of a simple mechanism called the conditional store buffer. The conditional score buffer improves I/O write performance by making better use of the system bus to increase effective I/O bandwidth, while greatly reducing synchronization overhead. The cost is a minor increase in hardware complexity.
Lambert Schaelicke, Al Davis
MICRO1