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

Bobbie Othmer

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

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

Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 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
Memory systems · 77% Processor architecture and microarchitecture · 23%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
dynamic optimization
0.012003
The Performance of Runtime Data Cache Prefetching in a Dynamic Optimization System · MICRO 2003
Memory systems › cache
prefetching
0.012003
The Performance of Runtime Data Cache Prefetching in a Dynamic Optimization System · MICRO 2003

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

static prefetching comparison · 0.1dynamic optimization · 0.1
YearPublicationVenuePosition
2003 The Performance of Runtime Data Cache Prefetching in a Dynamic Optimization System
abstract
Traditional software controlled data cache prefetching is often ineffective due to the lack of runtime cache miss and miss address information. To overcome this limitation, we implement runtime data cache prefetching in the dynamic optimization system ADORE (ADaptive Object code Reoptimization). Its performance has been compared with static software prefetching on the SPEC2000 benchmark suite. Runtime cache prefetching shows better performance. On an Itanium 2 based Linux workstation, it can increase performance by more than 20% over static prefetching on some benchmarks. For benchmarks that do not benefit from prefetching, the runtime optimization system adds only 1%-2% overhead. We have also collected cache miss profiles to guide static data cache prefetching in the ORC compiler. With that information the compiler can effectively avoid generating prefetches for loops that hit well in the data cache.
Jiwei Lu, Howard Chen 0002, Wei-Chung Hsu, Bobbie Othmer, Pen-Chung Yew, Dong-yuan Chen
MICRO5
1990 Simulation of process and resource management in a multiprogramming operating system
abstract
WC describe PRMS an animated simulation of process and resource management in a multi-programming operating system.PRMS was developed to illustrate important operating system concepts including process creation, process state transition, context switching, process scheduling, resource scheduling, interrupt handling, and deadlock detection and recovery.The users write their own, programs in a specified format, submit these to the system for execution, and monitor "behind the scenes" mechanisms and the behavior of the system on the screen.In addition to illustrating and reinforcing operating system concepts, PRMS can also be used for course projects by having the students change an algorithm such as the CPU scheduling algorithm or memory management scheme or add new features such as device interrupts to the system.
James Hays, Leland R. Miller, Bobbie Othmer, Mohammad Saeed
SIGCSE3