EDBT 2026 Demo / reviewers in the wild / expert
Allen Brady Montz
dblp:70/6754
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 4 · 2 first-authorSystems, architecture and hardware · 1Computer networks · 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 · 67% Embedded and real-time systems · 33% | |
| Software engineering, system software, and programming languages
2 papers |
Operating systems · 50% Compilers and program optimization · 50% | |
| Computer networks
2 papers |
Internet architecture and protocols · 100% | |
| Computer graphics and multimedia
1 paper |
Audio and music processing · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation › performance prediction
execution time prediction |
0.0 | 1 | 1998 | Predicting MPEG Execution Times · SIGMETRICS 1998 |
Embedded and real-time systems
real-time scheduling |
0.0 | 1 | 1998 | Predicting MPEG Execution Times · SIGMETRICS 1998 |
Performance modeling and evaluation
workload characterization |
0.0 | 1 | 1998 | Predicting MPEG Execution Times · SIGMETRICS 1998 |
Compilers and program optimization
code generation |
0.0 | 1 | 1994 | USC: A Universal Stub Compiler · SIGCOMM 1994 |
Operating systems › interprocess communication
remote procedure call |
0.0 | 1 | 1994 | USC: A Universal Stub Compiler · SIGCOMM 1994 |
Compilers and program optimization › code generation
stub generation |
0.0 | 1 | 1994 | USC: A Universal Stub Compiler · SIGCOMM 1994 |
Audio and music processing › speech recognition › decoding
video decoding |
0.0 | 1 | 1998 | Predicting MPEG Execution Times · SIGMETRICS 1998 |
Internet architecture and protocols
protocol implementation |
0.0 | 1 | 1994 | Scout: A Communications-Oriented Operating System (Abstract) · OSDI 1994 |
Methods — techniques the papers use, named apart from their topics
linear regression · 0.0stub compilation · 0.0marshaling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Experiences building a communication-oriented JavaOSabstractMobile code makes it easier to maintain, debug, update, and customize a system. Active networks are one of the more interesting applications of mobile code: code is injected into the nodes of a network to customize the network's functionality, such as routing, and to add new features, such as special-purpose congestion control and filtering algorithms. The challenge is to develop a communication-oriented platform for such systems. We refer to mobile code targeted at low-level, communication-oriented systems like active networks as liquid software, the key distinction being that liquid software is focused on the efficient transfer of data, not high-performance computation. To this end, we have designed and implemented Joust, which consists of a complete re-implementation of the Java virtual machine (including both the runtime system and a just-in-time compiler), running on the Scout operating system (a configurable, communication-oriented OS). The result is a configurable, high-performance platform for running liquid software. We present the results of implementing two different applications of liquid software on Joust, including a prototype architecture for active networks. Copyright © 2000 John Wiley & Sons, Ltd. John H. Hartman, Larry L. Peterson, Andy C. Bavier, Peter A. Bigot, Patrick G. Bridges, Allen Brady Montz, Rob Piltz, Todd A. Proebsting, Oliver Spatscheck |
Softw. Pract. Exp. | 6 |
| 1998 | Predicting MPEG Execution TimesabstractThis paper reports on a set of experiments that measure the amount of CPU processing needed to decode MPEGcompressed video in software. These experiments were designed to discover indicators that could be used to predict how many cycles are required to decode a given frame. Such predictors can be used to do more accurate CPU scheduling. We found that by considering both frame type and size, it is possible to construct a linear model of MPEG decoding with R 2 values of 0.97 and higher. Moreover, this model can be used to predict decoding times at both the frame and packet level that are almost always accurate to within 25% of the actual decode times. This is a surprising result given the large variability in MPEG decoding times, and suggests that it is feasible to design systems that make quality of service guarantees for MPEG-encoded video. 1 Introduction The ability of modern processors to decode MPEG compressed video in realtime has led to users wanting to run a mix of application... Andy C. Bavier, Allen Brady Montz, Larry L. Peterson |
SIGMETRICS | 2 |
| 1995 | Scout: a communications-oriented operating systemabstractScout is new communication-centric operating system. The principle scout abstraction (the path) is an attempt to capture all of the operating system infrastructure necessary to insure that a given network connection can achieve high and predictable performance in the face of other connections and other system loads. Allen Brady Montz, David Mosberger, Sean W. O'Malley, Larry L. Peterson, Todd A. Proebsting |
HotOS | 1 |
| 1994 | Scout: A Communications-Oriented Operating System (Abstract)
Allen Brady Montz, David Mosberger, Sean W. O'Malley, Larry L. Peterson, Todd A. Proebsting, John H. Hartman |
OSDI | 1 |
| 1994 | USC: A Universal Stub CompilerabstractUSC is a new stub compiler that generates stubs that perform many data conversion operations. USC is flexible and can be used in situations where previously only manual code generation was possible. USC generated code is up to 20 times faster than code generated by traditional argument marshaling schemes such as ASN.1 and Sun XDR. This paper presents the design of USC and a comprehensive set of experiments that compares USC performance with the best manually generated code and traditional stub compilers. Sean W. O'Malley, Todd A. Proebsting, Allen Brady Montz |
SIGCOMM | 3 |