Donna J. Quammen

dblp:11/3393 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Systems, architecture and hardware · 6 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 graphics and multimedia
1 paper
Virtual and augmented reality · 100%
Software engineering, system software, and programming languages
3 papers
Compilers and program optimization · 62% Runtime systems and virtual machines · 19% Concurrent programming · 19%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Processor architecture and microarchitecture · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
instruction scheduling
0.011991
Mapping Concurrent Programs to VLIW Processors · PPoPP 1991
Processor architecture and microarchitecture
register management
0.011991
Flexible Register Management for Sequential Programs · ISCA 1991
Compilers and program optimization
register allocation
0.011991
Flexible Register Management for Sequential Programs · ISCA 1991
Processor architecture and microarchitecture
instruction set architecture
0.011991
Mapping Concurrent Programs to VLIW Processors · PPoPP 1991
Processor architecture and microarchitecture › instruction-level parallelism
VLIW
0.011991
Mapping Concurrent Programs to VLIW Processors · PPoPP 1991
Compilers and program optimization
expression evaluation
0.011985
Efficient Storage Management for Temporary Values in Concurrent Programming Languages · IEEE Trans. Computers 1985

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

motion analysis · 0.03d surface modeling · 0.0program mapping · 0.0architecture design · 0.0simulation · 0.0
YearPublicationVenuePosition
1999 A Virtual Reality System for Knee Diagnosis and Surgery Simulation
abstract
This paper describes the design and development of a VR system that can assist orthopedic diagnosis and surgery. A realistic 3D knee surface model, integrated with motion analysis, is used to visualize the geometrical and biomechanical characteristics of human knee joint. The system can be used to perform pre-operative surgery simulation and evaluation in a VR environment.
Ying Zhu 0001, Jim X. Chen, Xiaodong Fu, Donna J. Quammen
VR4
1995 Binary-Exchange Algorithms on a Packed Exponential Connections Network
Craig Wong, Catherine Stokley, Quynh-Anh Nguyen, Donna J. Quammen, Pearl Y. Wang
ICPP (3)4
1992 A Parallel Randomized Sorting Algorithm
Masood Bolorforoush, Nastaran S. Coleman, Donna J. Quammen, Pearl Y. Wang
ICPP (3)3
1991 Flexible Register Management for Sequential Programs
abstract
Ivfost current architectureshave registers organized in one of two ways: single register sets; or register stacks,
Donna J. Quammen, D. Richard Miller
ISCA1
1991 Mapping Concurrent Programs to VLIW Processors
Hester Bakewell, Donna J. Quammen, Pearl Y. Wang
PPoPP2
1990 Hardware design of the multris microprocessor
G. Leeuwrik, D. Richard Miller, Donna J. Quammen, R. Senko, Daniel Tabak
Microprocessing and Microprogramming3
1985 Efficient Storage Management for Temporary Values in Concurrent Programming Languages
abstract
An evaluation stack, used exclusively to store temporary values in expression evaluation, is known to be an effective mechanism in the implementation of high level languages. This work considers the efficient management of evaluation stacks for concurrent programming languages. Techniques for sharing a single evaluation stack among many processes, without copying on process switches, are developed. The best strategy for managing the evaluation stack is shown to depend strongly upon the scheduling paradigm adopted by the run-time support of the language. Simulation studies, driven by synthetic workloads, show that the techniques described in this paper exhibit substantial performance improvements over traditional temporary storage management schemes for concurrent languages.
Donna J. Quammen, John P. Kearns, Mary Lou Soffa
IEEE Trans. Computers1