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

David C. Wood

dblp:34/3217 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 first-authorArtificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Performance modeling and evaluation · 98% Memory systems · 2%
Computer networks
3 papers
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › simulation › parallel and distributed simulation › distributed simulation
distributed interactive simulation
0.011995
Networking technology and DIS · Proc. IEEE 1995
Internet architecture and protocols
multicast
0.011995
Networking technology and DIS · Proc. IEEE 1995
Internet architecture and protocols
resource reservation
0.011995
Networking technology and DIS · Proc. IEEE 1995
Internet architecture and protocols
protocol design
0.011979
A cable-bus protocol architecture · SIGCOMM 1979
Memory systems › memory management
virtual memory
0.011969
Measurements of segment size · SOSP 1969
Performance modeling and evaluation
workload characterization
0.011969
Measurements of segment size · SOSP 1969
Operating systems › resource management › memory management › virtual memory
paging
0.011969
Measurements of segment size · SOSP 1969

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

comparative performance evaluation · 0.0measurement study · 0.0
YearPublicationVenuePosition
1995 Networking technology and DIS
abstract
For wide-area networking of distributed interactive simulation (DIS) a real-time, resource-reserving, multicast network with appropriate encryption is required. Latency and data volume requirements are described. Standards for DIS communications and their impact on network traffic are explained. Evolutionary history is traced for the current network serving these needs, the Defense Simulation Internet. The most likely path for future expansion of DIS networking uses emerging commercial technologies such as asynchronous transfer mode (ATM) and Internet protocol multicast (IPmc) with resource reservation. The architecture and issues for an ATM network meeting future DIS requirements is described; areas of active research such as compression and multicast grouping are explained.>
J. Mark Pullen, David C. Wood
Proc. IEEE2
1993 Image tracking in real-time: a transputer emulation of some early mammalian vision processes
Peter H. Welch, David C. Wood
Image Vis. Comput.2
1992 Image Tracking in Real-time: A Transputer Emulation of Some Early Mammalian Vision Processes
Peter H. Welch, David C. Wood
BMVC2
1979 A performance study of a Network Front End
abstract
A Network Front End (NFE) is a mini-computer which is used to connect a host computer to the communicating network. The purpose of using an NFE, as contrasted to connecting the host computer directly to the network, is to reduce the processing load imparted to the host computer by the network interfacing software. This paper presents a comparative evaluation of the NFE attachment method in relation to the host direct connection method.
Susan S. Poh, Paul D. Stoneburner, David C. Wood
SIGCOMM3
1979 A cable-bus protocol architecture
abstract
The benefits of general-purpose local networks are discussed and the requirements that such networks need to satisfy are defined. A generic network architectural model is described and the major design parameters identified. The role of the local network is to provide network transparency for a multiplicity of computer devices. How well this role is performed is a function of the protocol design and implementation.MITRE's Cablenet is one of several experimental cable-bus networks employing coaxial cable as a shared wideband transmission medium, and using microprocessor based interface units. This paper presents a protocol architecture design based on local network characteristics and the extensive computational capabilities expected from the next generation of microprocessors. We have designed a Flexible Transport Protocol which allows our cable-bus access node to assume a wide range of characteristics; these characteristics can be chosen judiciously to fulfil the needs of a wide spectrum of subscribers.
David C. Wood, Steven F. Holmgren, Anita P. Skelton
SIGCOMM1
1977 Computer Communications-Paul E. Green, Jr. and Robert W. Lucky, Eds
David C. Wood
IEEE Trans. Commun.1
1969 Measurements of segment size
abstract
Distributions of segment sizes have been measured under routine operating conditions on a computer system which utilizes variable-sized segments (the Burroughs B5500). The most striking feature of the measurements is the large number of small segments - about 60% of the segments in use contain less than 40 words. Although the results are certainly not installation-independent, they should be relevant to the design of new computer systems, especially with respect to the organization of paging schemes.
Alan P. Batson, Shy-Ming Ju, David C. Wood
SOSP3
1969 A technique for colouring a graph applicable to large scale timetabling problems
abstract
The connection is explained between scheduling problems and colouring the vertices of a graph such that no two adjacent vertices are the same colour, and the minimum number of colours are used. A method of colouring a graph suitable for large scale timetabling problems is described.
David C. Wood
Comput. J.1
1968 A system for computing university examination timetables
abstract
A comprehensive system for constructing large university examination timetables using the Atlas computer is described. The method has produced timetables involving well over 1,000 subjects which are superior to those constructed manually.
David C. Wood
Comput. J.1