Network


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

Hotspot


Dive into the research topics where Dale C. Morris is active.

Publication


Featured researches published by Dale C. Morris.


international symposium on microarchitecture | 2000

Introducing the IA-64 architecture

Jerome C. Huck; Dale C. Morris; Jonathan K. Ross; Allan Knies; Hans Mulder; Rumi Zahir

Microprocessors continue on the relentless path to provide more performance. Every new innovation in computing-distributed computing on the Internet, data mining, Java programming, and multimedia data streams-requires more cycles and computing power. Even traditional applications such as databases and numerically intensive codes present increasing problem sizes that drive demand for higher performance. Design innovations, compiler technology, manufacturing process improvements, and integrated circuit advances have been driving exponential performance increases in microprocessors. To continue this growth in the future, Hewlett Packard and Intel architects examined barriers in contemporary designs and found that instruction-level parallelism (ILP) can be exploited for further performance increases. This article examines the motivation, operation, and benefits of the major features of IA-64. Intels IA-64 manual provides a complete specification of the IA-64 architecture.


ieee computer society international conference | 1992

Pathlength reduction features in the PA-RISC architecture

Ruby B. Lee; Michael J. Mahon; Dale C. Morris

A description is given of representative pathlength reduction features of PA-RISC (reduced instruction set computer) instructions in memory accessing, functional operations, and instruction sequencing. To illustrate the multi-op instructions in PA-RISC, comparison is made with the MIPS instruction set, rather than with some hypothetical single-op RISC instructions. It is noted that, while other RISC architectures strive to enable short cycle times and single cycle instruction execution, PA-RISC also supports pathlength reduction, without impacting either the cycle time or the CPI. Frequent operations are combined into a single multi-op instruction. Subword data are also operated on in parallel, making full use of the datapath width. Such instruction level parallelism gives PA-RISC some of the advantages of a very simple VLIW (very long instruction word) architecture (with short 32-b instructions), in addition to the inherent advantages of a streamlined RISC architecture.<<ETX>>


architectural support for programming languages and operating systems | 2000

OS and compiler considerations in the design of the IA-64 architecture

Rumi Zahir; Jonathan K. Ross; Dale C. Morris; Drew Hess

Increasing demands for processor performance have outstripped the pace of process and frequency improvements, pushing designers to find ways of increasing the amount of work that can be processed in parallel. Traditional RISC architectures use hardware approaches to obtain more instruction-level parallelism, with the compiler and the operating system (OS) having only indirect visibility into the mechanisms used.The IA-64 architecture [14] was specifically designed to enable systems which create and exploit high levels of instruction-level parallelism by explicitly encoding a programs parallelism in the instruction set [25]. This paper provides a qualitative summary of the IA-64 architecture features that support control and data speculation, and register stacking. The paper focusses on the functional synergy between these architectural elements (rather than their individual performance merits), and emphasizes how they were designed for cooperation between processor hardware, compilers and the OS.


Archive | 1996

Embedded hidden identification codes in digital objects

Dale C. Morris


Archive | 1994

Method and apparatus for embedding identification codes in printed documents

Michael J. Mahon; Jerome C. Huck; Dale C. Morris


Archive | 2003

Processor-architecture for facilitating a virtual machine monitor

Jonathan K. Ross; Dale C. Morris; Donald Charles Soltis; Rohit Bhatia; Eric Delano


Archive | 1996

Computer memory address control apparatus utilizing hashed address tags in page tables which are compared to a combined address tag and index which are longer than the basic data width of the associated computer

Dale C. Morris; Jerome C. Huck; William R. Bryg


Archive | 1998

Method for processing branch operations

Harshvardhan Sharangpani; Tse-Yu Yeh; Michael Paul Corwin; Millind Mittal; Kent Fielden; Dale C. Morris; Rajiv Gupta; Michael S. Schlansker; Mircea Poplingher


Archive | 1996

Instruction prefetch mechanism utilizing a branch predict instruction

Tse-Yu Yeh; Mircea Poplingher; Kent Fielden; Hans Mulder; Rajiv Gupta; Dale C. Morris; Michael S. Schlansker


Archive | 1999

Prefetch instruction for an unpredicted path including a flush field for indicating whether earlier prefetches are to be discarded and whether in-progress prefetches are to be aborted

Dale C. Morris; James R. Callister; Stephen R. Undy

Collaboration


Dive into the Dale C. Morris's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Hans Mulder

Delft University of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge