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.

David E. Morgan

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

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

Software engineering, systems software and programming languages · 6 · 1 first-authorComputer networks · 1 · 1 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
Hardware reliability and fault tolerance · 50% Performance modeling and evaluation · 44% Electronic design automation · 6%
Software engineering, system software, and programming languages
3 papers
Program analysis · 49% Operating systems · 37% Debugging and program repair · 15%
Computer networks
1 paper
Network management and operations · 50% Network measurement and analytics · 50%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
software fault tolerance
0.021980
Redundancy in Data Structures: Some Theoretical Result · IEEE Trans. Software Eng. 1980
Redundancy in Data Structures: Improving Software Fault Tolerance · IEEE Trans. Software Eng. 1980
Indexing and storage engines
b-tree
0.011981
A Robust B-Tree Implementation · ICSE 1981
Program analysis
error detection
0.011980
Redundancy in Data Structures: Improving Software Fault Tolerance · IEEE Trans. Software Eng. 1980
Performance modeling and evaluation › queueing models
closed queueing networks
0.011979
Analysis of Closed Queuing Networks with Periodic Servers · IEEE Trans. Software Eng. 1979
Performance modeling and evaluation
queueing models
0.011979
Analysis of Closed Queuing Networks with Periodic Servers · IEEE Trans. Software Eng. 1979
Network management and operations
network monitoring
0.011975
A Computer Network Monitoring System · IEEE Trans. Software Eng. 1975
Network measurement and analytics › traffic measurement
traffic monitoring
0.011975
A Computer Network Monitoring System · IEEE Trans. Software Eng. 1975
Operating systems › resource management › process management › multiprogramming › time-sharing systems
multics
0.011973
The Multics System · IEEE Trans. Commun. 1973
Operating systems › resource management › process management › multiprogramming
time-sharing systems
0.011973
The Multics System · IEEE Trans. Commun. 1973
Debugging and program repair
error correction
0.011980
Redundancy in Data Structures: Some Theoretical Result · IEEE Trans. Software Eng. 1980
Electronic design automation › circuit simulation
steady-state analysis
0.011979
Analysis of Closed Queuing Networks with Periodic Servers · IEEE Trans. Software Eng. 1979
Network management and operations › fault management
fault diagnosis
0.011975
A Computer Network Monitoring System · IEEE Trans. Software Eng. 1975
Network measurement and analytics
traffic generation
0.011975
A Computer Network Monitoring System · IEEE Trans. Software Eng. 1975
Systems and software security
operating system security
0.011973
The Multics System · IEEE Trans. Commun. 1973

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

redundancy · 0.0formal analysis · 0.0queueing theory · 0.0hybrid monitors · 0.0approximate solution · 0.0
YearPublicationVenuePosition
1981 A Robust B-Tree Implementation
James P. Black, David J. Taylor, David E. Morgan
ICSE3
1981 A Case Study in Fault Tolerant Software
abstract
Abstract The addition of redundancy to data structures can be used to improve the ability of a software system to detect and correct errors, and to continue to operate according to its specifications. A case study is presented which indicates how such redundancy can be deployed and exploited at reasonable cost to improve software fault tolerance. Experimental results are reported for the small data base system considered.
James P. Black, David J. Taylor, David E. Morgan
Softw. Pract. Exp.3
1980 Redundancy in Data Structures: Improving Software Fault Tolerance
abstract
The increasing cost of computer system failure has stimulated interest in improving software reliability. One way to do this is by adding redundant structural data to data structures. Such redundancy can be used to detect and correct (structural) errors in instances of a data structure. The intuitive approach of this paper, which makes heavy use of examples, is complemented by the more formal development of the companion paper, "Redundancy in Data Structures: Some Theoretical Results."
David J. Taylor, David E. Morgan, James P. Black
IEEE Trans. Software Eng.2
1980 Redundancy in Data Structures: Some Theoretical Result
abstract
A companion paper, "Redundancy in Data Structures: Improving Software Fault Tolerance," provides an infonnal introduction to robust data structures. Here, we present the underlying theory for them, and use it to discuss the synthesis and cost effectiveness of robust data structures.
David J. Taylor, David E. Morgan, James P. Black
IEEE Trans. Software Eng.2
1979 Analysis of Closed Queuing Networks with Periodic Servers
abstract
A periodic network is a queuing network whose steady-state behavior is not constant in time, but repeats itself in a cycle. This behavior may be caused by the introduction of periodic servers, e.g., paging drums. The model presented is a generalization of some other models of queuing networks, and provides a more general definition of steady-state behavior. A theoretical solution is presented. Examples of theoretical and approximate solutions are presented for a well-known queuing network model of a computer system.
Gaston H. Gonnet, David E. Morgan
IEEE Trans. Software Eng.2
1975 A Computer Network Monitoring System
abstract
In order to help satisfy an apparent need for tools for monitoring the activities of a computer network, a system of special hardware and software, called a Computer Network Monitoring System (CNMS) is being implemented in the University of Waterloo Computer Communications Networks Group (CCNG). The paper discusses the motivation and derivation of the CNMS, then provides functional descriptions of most of the major hardware and software components, illustrates use of the CNMS, and lists experiments and applications. The CNMS consists of: 1) a set of hybrid monitors, each of which is controlled by a locally or remotely located computer; 2) monitor control and data analysis software; 3) a network traffic generator; 4) measurement software in each computer monitored. Each computer to be monitored is attached to a monitor. Telephone lines, possibly different from those of the network, connect the monitors to the controlling computer.
David E. Morgan, Walter Banks, Dale P. Goodspeed, Richard Kolanko
IEEE Trans. Software Eng.1
1973 The Multics System
David E. Morgan
IEEE Trans. Commun.1