Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where David B. Papworth is active.

Publication


Featured researches published by David B. Papworth.


conference on high performance computing (supercomputing) | 1990

Architecture and implementation of a VLIW supercomputer

Robert P. Colwell; W. Eric Hall; Chandra S. Joshi; David B. Papworth; Paul Rodman; James E. Tornes

Very-long-instruction-word (VLIW) computers achieve high performance by exploiting the fine-grain parallelism present in sequential or vectorizable code. Multiflows /200 and /300 VLIW systems yielded near-supercomputer performance by this means despite the relatively slow (65 ns) clocks. With its much faster clock period (15 ns) and architectural improvements, the new /500 system attains approximately 4-9* the performance of its predecessors. The authors describe the /500 architecture and implementation (i.e. TRACE/500), with special attention paid to the tradeoffs involved in designing very-high-speed VLIWs.<<ETX>>


Operating Systems Review | 1987

A VLIW architecture for a trace scheduling compiler

Robert P. Colwell; Robert P. Nix; John O'Donnell; David B. Papworth; Paul K. Rodman

Very Long Instruction Word (VLIW) architectures were promised to deliver far more than the factor of two or three that current architectures achieve from overlapped execution. Using a new type of compiler which compacts ordinary sequential code into long instruction words, a VLIW machine was expected to provide from ten to thirty times the performance of a more conventional machine built of the same implementation technology.Multiflow Computer, Inc., has now built a VLIW called the TRACETM along with its companion Trace SchedulingTM compacting compiler. This new machine has fulfilled the performance promises that were made. Using many fast functional units in parallel, this machine extends some of the basic Reduced-Instruction-Set precepts: the architecture is load/store, the microarchitecture is exposed to the compiler, there is no microcode, and there is almost no hardware devoted to synchronization, arbitration, or interlocking of any kind (the compiler has sole responsibility for runtime resource usage).This paper discusses the design of this machine and presents some initial performance results.


Archive | 1996

Method for pipeline processing of instructions by controlling access to a reorder buffer using a register file outside the reorder buffer

Glenn J. Hinton; David B. Papworth; Andrew F. Glew; Michael A. Fetterman; Robert P. Colwell


Archive | 1987

Hierarchical priority branch handling for parallel execution in a parallel processor

Robert P. Colwell; John O'Donnell; David B. Papworth; Paul Rodman


Archive | 1994

Circuit and method for scheduling instructions by predicting future availability of resources required for execution

Glenn J. Hinton; Robert W. Martell; Michael A. Fetterman; David B. Papworth; James L. Schwartz


Archive | 1998

Method and apparatus for implementing a set-associative branch target buffer

Bradley D. Hoyt; Glenn I. Hinton; David B. Papworth; Ashwani Kumar Gupta; Michael A. Fetterman; Subramanian Natarajan; Sunil Shenoy; Reynold V. D'Sa


Archive | 1990

Instruction storage method with a compressed format using a mask word

Robert P. Colwell; John O'Donnell; David B. Papworth; Paul Rodman


Archive | 1991

Instruction storage and cache miss recovery in a high speed multiprocessing parallel processing apparatus

Robert P. Colwell; John O'Donnell; David B. Papworth; Paul Rodman


Archive | 1994

Method and apparatus for resolving return from subroutine instructions in a computer processor

Bradley D. Hoyt; Glenn J. Hinton; David B. Papworth; Ashwani Kumar Gupta; Michael A. Fetterman; Subramanian Natarajan; Sunil Shenoy; Reynold V. D'Sa


international symposium on microarchitecture | 1996

Tuning the Pentium Pro microarchitecture

David B. Papworth

Researchain Logo
Decentralizing Knowledge