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 B. G. Edwards

dblp:53/2560 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 1981
—ORCID · none

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

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 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
4 papers
Interconnection networks and networks-on-chip · 36% Memory systems · 34% Processor architecture and microarchitecture · 27%
Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory management › virtual memory
address translation
0.011980
MU6-G: A New Design to Achieve Mainframe Performance from a Mini-Sized Computer · ISCA 1980
Interconnection networks and networks-on-chip
interprocessor communication
0.011977
The MU5 Multicomputer Communication System · IEEE Trans. Computers 1977
Interconnection networks and networks-on-chip
switching
0.011977
The MU5 Multicomputer Communication System · IEEE Trans. Computers 1977
Debugging and program repair
root cause analysis
0.011980
MU6-G: A New Design to Achieve Mainframe Performance from a Mini-Sized Computer · ISCA 1980
Integrated circuit design › digital circuit design › arithmetic circuit design
binary adder
0.011961
High-Speed Transistorized Adders · IRE Trans. Electron. Comput. 1961
Memory systems › cache management
cache replacement
0.011962
One-Level Storage System · IRE Trans. Electron. Comput. 1962
Integrated circuit design › digital circuit design › logic design
logic circuits
0.011961
High-Speed Transistorized Adders · IRE Trans. Electron. Comput. 1961
Memory systems › memory management
single level store
0.011962
One-Level Storage System · IRE Trans. Electron. Comput. 1962
Memory systems › memory management
virtual memory
0.011962
One-Level Storage System · IRE Trans. Electron. Comput. 1962

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

virtual addressing · 0.0high-level language support · 0.0timing analysis · 0.0error analysis · 0.0transistor circuit design · 0.0automatic storage hierarchy management · 0.0
YearPublicationVenuePosition
1981 A chip-set for a high-speed low-cost floating-point unit
abstract
Although the advent of microprocessors has put considerable computing power in the hands of large numbers of users, there is still an important group who have yet to benefit fully from large scale integration. As a step in the direction of rectifying this situation, a highly flexible chip set is being designed, with a view to reducing the cost of a powerful floating point processor by a factor of about 4. Processing speed will be up to twice that of an equivalent unit built from MSI devices, before allowance is made for savings on wiring delays. It will be possible to construct a unit satisfying all published standards, proposed and existing (de facto), as well as permitting a number of extensions not specifically in these standards. At a cost between 100 and 150 ICs, and with a floating-point add time of around 120nS, the proposed unit is cost-effective compared to currently available coprocessors.
J. B. Gosling, John H. Zurawski, David B. G. Edwards
IEEE Symposium on Computer Arithmetic3
1980 MU6-G: A New Design to Achieve Mainframe Performance from a Mini-Sized Computer
abstract
MU6-G is a high performance machine useful for general or scientific applications. Its order code and architecture are designed to be sympathetic to the needs of the operating system and to both the compilation and execution of programs written in high level languages and to support a word size suitable for high precision scientific computations. Advanced technology, coupled with simplicity of design, is used to achieve a high and more readily predictable performance. Innovative features include the unique organisation of the virtual memory mapping hardware and the use of a combined operand and instruction buffer-store, accessed using virtual addresses. Fault diagnosis is aided by the inclusion of a microprocessor based diagnostic controller which has read/write access to all bistable devices in the machine and has control of the system clock. The paper includes a description of the various functional units and gives estimates of expected performance.
David B. G. Edwards, Alan E. Knowles, J. V. Woods
ISCA1
1977 The MU5 Multicomputer Communication System
abstract
A multicomputer system is described incorporating an exchange which can connect up to 12 units. A description of the overall architecture is followed by a detailed discussion of the exchange design. This includes a storage transfer unit which has a maximum throughput of 89 Mbytes/s. A review of the timing and technology, and error analysis conclude the paper.
Simon H. Lavington, Gareth Thomas, David B. G. Edwards
IEEE Trans. Computers3
1966 Addressing Magnetic Tape on the Atlas 1 Computing Machine
abstract
A consequence of the pre-addressed fixed-length data block format which the Atlas magnetic tape system uses is that tapes with this layout have to be provided from ‘new’ tapes before the system can even operate. To avoid the necessity of building expensive and elaborate off-line equipment, small modifications were included in the design of the basic Atlas tape system to provide this necessary facility. The process is performed using Atlas itself, but because of the computer's time-sharing techniques only a small fraction of the computer's capability is used up. The paper provides a factual description of the tape testing and addressing facilities, explaining the reasons for the major decisions involved in the design.
David B. G. Edwards, David Aspinall 0002, R. Lane
Comput. J.1
1962 One-Level Storage System
abstract
After a brief survey of the basic Atlas machine, the paper describes an automatic system which in principle can be applied to any combination of two storage systems so that the combination can be regarded by the machine user as a single level. The actual system described relates to a fast core store-drum combination. The effect of the system on instruction times is illustrated, and the tape transfer system is also introduced since it fits basically in through the same hardware. The scheme incorporates a ``learning'' program, a technique which can be of greater importance in future computers.
Tom Kilburn, David B. G. Edwards, Michael J. Lanigan, Frank H. Sumner
IRE Trans. Electron. Comput.2
1961 High-Speed Transistorized Adders
David B. G. Edwards
IRE Trans. Electron. Comput.1