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

Ashley Saulsbury

dblp:43/5403 · DBLP profile ↗
← Back
5ranked-venue papers
5as 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 · 5 · 5 first-authorSoftware engineering, systems software and programming languages · 2 · 2 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
3 papers
Memory systems · 92% Processor architecture and microarchitecture · 4% Parallel and multicore computing · 4%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory management › virtual memory › address translation
TLB
0.012000
Recency-based TLB preloading · ISCA 2000
Memory systems
DRAM
0.011996
Missing the Memory Wall: The Case for Processor/Memory Integration · ISCA 1996
Memory systems
cache coherence
0.011995
An Argument for Simple COMA · HPCA 1995
Memory systems › memory architecture
cache-only memory architecture
0.011995
An Argument for Simple COMA · HPCA 1995
Memory systems › memory management
virtual memory
0.012000
Recency-based TLB preloading · ISCA 2000
Processor architecture and microarchitecture
chip multiprocessor
0.011996
Missing the Memory Wall: The Case for Processor/Memory Integration · ISCA 1996
Memory systems › shared memory
scalable shared memory
0.011995
An Argument for Simple COMA · HPCA 1995
Parallel and multicore computing › multiprocessor system
shared-memory multiprocessor
0.011995
An Argument for Simple COMA · HPCA 1995

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

simulation · 0.0
YearPublicationVenuePosition
2000 Recency-based TLB preloading
abstract
Caching and other latency tolerating techniques have been quite successful in maintaining high memory system performance for general purpose processors. However, TLB misses have become a serious bottleneck as working sets are growing beyond the capacity of TLBs.
Ashley Saulsbury, Fredrik Dahlgren, Per Stenström
ISCA1
1999 Efficient management of memory hierarchies in embedded DRAM systems
abstract
The design and implementation of embedded microprocessors is on the verge of change -with MCM, flip-chip and integrated DRAM/ logic technologies moving from feasible to commercially viable.Embedded DRAM memory provides a high memory bandwidth together with low latency.However, when such a system is extended with further memory, the processor is exposed to a nonuniform memory hierarchy -where some fraction of the total memory has significantly lower access latency than the remainder.In this paper, we evaluate various hardware-orientated approaches to the management of embedded memory.In addition to static page placement and conventional cache functionality, we explore novel memory management schemes that exploit temporal locality while still using the embedded DRAM as part of the physical memory space.Using execution driven simulation of real workloads, we show that this technique can deliver as much as a factor of two speedup over a conventional memory hierarchy.More importantly, we show how the embedded memory can be used to provide both data storage and a caching capability equivalent to a more complex processor device.These results imply that designers of embedded and small-scale systems can achieve significant performance wins, through the use of a combined processor/ memory device and the memory system design proposed.
Ashley Saulsbury, Su-Jaen Huang, Fredrik Dahlgren
International Conference on Supercomputing1
1996 Missing the Memory Wall: The Case for Processor/Memory Integration
abstract
Current high performance computer systems use complex, large superscalar CPUs that interface to the main memory through a hierarchy of caches and interconnect systems. These CPU-centric designs invest a lot of power and chip area to bridge the widening gap between CPU and main memory speeds. Yet, many large applications do not operate well on these systems and are limited by the memory subsystem performance.This paper argues for an integrated system approach that uses less-powerful CPUs that are tightly integrated with advanced memory technologies to build competitive systems with greatly reduced cost and complexity. Based on a design study using the next generation 0.25µm, 256Mbit dynamic random-access memory (DRAM) process and on the analysis of existing machines, we show that processor memory integration can be used to build competitive, scalable and cost-effective MP systems.We present results from execution driven uni- and multi-processor simulations showing that the benefits of lower latency and higher bandwidth can compensate for the restrictions on the size and complexity of the integrated processor. In this system, small direct mapped instruction caches with long lines are very effective, as are column buffer data caches augmented with a victim cache.
Ashley Saulsbury, Fong Pong, Andreas Nowatzyk
ISCA1
1995 An Argument for Simple COMA
abstract
We present design details and some initial performance results of a novel scalable shared memory multiprocessor architecture. This architecture features the automatic data migration and replication capabilities of cache-only memory architecture (COMA) machines, without the accompanying hardware complexity. A software layer manages cache space allocation at a page-granularity-similarly to distributed virtual shared memory (DVSM) systems, leaving simpler hardware to maintain shared memory coherence at a cache line granularity. By reducing the hardware complexity, the machine cost and development time are reduced. We call the resulting hybrid hardware and software multiprocessor architecture Simple COMA. Preliminary results indicate that the performance of Simple COMA is comparable to that of more complex contemporary all hardware designs.>
Ashley Saulsbury, Tim Wilkinson, John B. Carter, Anders Landin
HPCA1
1995 An argument for simple COMA
Ashley Saulsbury, Tim Wilkinson, John B. Carter, Anders Landin
Future Gener. Comput. Syst.1