Electrical computers and digital processing systems: processing – Processing control – Branching
Reexamination Certificate
1999-03-22
2001-03-20
Coleman, Eric (Department: 2183)
Electrical computers and digital processing systems: processing
Processing control
Branching
C712S226000
Reexamination Certificate
active
06205546
ABSTRACT:
FIELD OF THE INVENTION
This invention concerns a computer using a multi-pointer branch instruction and operating and memory organization method therefore.
BACKGROUND OF THE INVENTION
Computer instructions are generally stored in a memory coupled to the central processor (CPU) of a computer system. Some instructions involve branching. Branching can be conditional or unconditional.
A branch target instruction is the instruction that is fetched by the processor (CPU) when executing a branch instruction. Usually, during the execution of a branch instruction, the CPU outputs the address of the branch target instruction to instruction memory. This address is known as the “branch target address” and is a part of any branch instruction. The size of each instruction can vary for various reasons, including using compression coding. Pointers are employed to point to the locations in memory where various parts of instructions are stored. It is often the case that parts of an instruction are stored at different locations in memory necessitating the use of multiple pointers to locate the various parts.
When there is a need to branch to a branch target instruction, there is a need to know all the pointers of the branch target instruction. Storing all the pointers of the branch target instruction within a branch instruction can cause several problems. For example, it can make the branch instruction very long, and require more than one read cycle in order to read and process it. Also, a long branch instruction allows very few bits for pointers, so that there is very limited branching space.
Thus, there is an ongoing need for improved computers and computer memory organization and operating methods which reduce or eliminate these and other well known limitations of the prior art in employing or implementing branching instructions.
REFERENCES:
patent: 4905141 (1990-02-01), Brenza
patent: 5632024 (1997-05-01), Yajima et al.
patent: 5784605 (1998-07-01), Ando
patent: 6021272 (2000-02-01), Cahill
patent: 6044450 (2000-03-01), Tsushima
patent: 6108773 (2000-08-01), Col
patent: 6119222 (2000-09-01), Shiell
Wolfe et al, “Executing compressed programs onan embedded RISC architecture” 25thannual international symposium on microarchitecture. Micro 25, Portland, Or. Usa, Dec. 1-4, 1992, vol. 23, No. 1-2, pp. 81-91.
Breternitz M JR et al, “Enhanced compression techniques to simplify program decompression and execution”, Proceedings. InternationalConference on Computer Design. VLSI in Computers and Processors(Cat. No. 97CB36149), Proceedings International conference on computer design VLSI in computers and processors, Austin, TX, USA, Oct. 12-15, 1997, pp. 170-176.
Ben-Ephraim Arie
Kazachin Arie
Miretsky Alex
Natan Rami
Sukonik Vitaly
Coleman Eric
Motorola Inc.
LandOfFree
Computer system having a multi-pointer branch instruction... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computer system having a multi-pointer branch instruction..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer system having a multi-pointer branch instruction... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2511032