Sub-pipelined and pipelined execution in a VLIW

Electrical computers and digital processing systems: processing – Processing architecture – Long instruction word

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S209000

Reexamination Certificate

active

06895494

ABSTRACT:
A subpipelined translation embodiment provides binary compatibility between current an future generations of DSPs. When retrieved from memory an entire fetch packet is assigned an operating mode (base instruction set or migrant instruction set) according to the current execution mode. The fetch packets from the instruction memory are parsed into execute packets and sorted by execution unit (dispatched) in a datapath shared by both execution modes (base and migrant). The two execution modes have separate control logic. Instructions from the dispatch datapath are decoded by either base architecture decode logic or the migrant architecture decode logic, depending on the execution mode bound to the parent fetch packet. Code processed by the migrant and base decode pipelines produces machine words that are selected by a multiplexer. The multiplexer is controlled by the operating mode bound to the fetch packet that produced the machine word. The selected machine word controls a global register file, which supplies operands to all hardware execution units and accepts results of all hardware execution units.

REFERENCES:
patent: 5638525 (1997-06-01), Hammond et al.
patent: 5774686 (1998-06-01), Hammond et al.
patent: 5848288 (1998-12-01), O'Connor
patent: 5884057 (1999-03-01), Blomgren et al.
patent: 5961632 (1999-10-01), Shiell et al.
patent: 6401190 (2002-06-01), Nishioka et al.
patent: 6415376 (2002-07-01), Mohamed et al.
patent: 6615338 (2003-09-01), Tremblay et al.
patent: 0 709 767 (1996-05-01), None
patent: 1 050 799 (2000-11-01), None
patent: WO 00 33178 (2000-06-01), None
Hennessy, John L. and Patterson, David A. Computer Architecture: A Quantitative Approach. Second Edition. San Francisco, CA: Morgan Jaufmann Publishers, Inc. ©1996. pp. 278 and 284-289.*
IBM Research Report, Kemal Ebcioglu, Erik R. Altman, “DAISY: Dynamic Compilation for 100% Architectural Compatibility,” Aug. 5, 1996, 82 pages.
IEEE, B. Ramakrishna Rau, “Dynamically Scheduled VLIW Processors,” 1993, Hewlett-Packard Laboratories, pp. 80-92.
IEEE, Thomas M. Conte, Sumedh W. Sathaye, Sanjeev Banerjia, “A Persistent Rescheduled-Page Cache for Low Overhead Object Code Compatibility in VLIW Architectures,” 1996, Department of Electrical and Computer Engineering North Carolina State University, pp. 4-13.
Digital Technical Journal, Raymond J. Hookway, Mark A. Herdeg, “Digital FX!32: Combining Emulation and Binary Translation,” Aug. 28, 1997, 21 pages.
Digital Technical journal, vol. 4, Special Issue 1992, “Binary Translation,” 33 pages.
Proposal, Don Steiss, Jan. 26, 1999, 4 pages.
C6x Offline Binary Translation with Run Time Assistance, Donald Steiss, Jun. 10, 1998, 15 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Sub-pipelined and pipelined execution in a VLIW does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sub-pipelined and pipelined execution in a VLIW, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sub-pipelined and pipelined execution in a VLIW will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3460279

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.