Memory-side driven anticipatory instruction transfer interface w

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3642613, 3642615, 3642617, 3642631, 364DIG1, G06F 900, G06F 930

Patent

active

053534190

ABSTRACT:
A computer architecture which significantly reduces latency in fetching instructions from main memory includes a code-pump located proximate to the memory and a filter cache located proximate to the processor. The code pump reduces latency in fetching instructions by predicting possible instruction streams that may be executed by the processor and passing instructions from all possible streams to the filter cache. The code pump fetches instructions from the memory and partially decodes the instructions to determine their types. Instruction types which may change the flow of the program such as subroutine calls and conditional branches, cause the code pump to concurrently supply instructions from all flow paths that can be predicted from these instructions. To keep track of the possible flow paths, the code pump maintains a data structure which is a combination of multiple stack entries (for call instructions) and tree entries (for branch instructions). The filter cache passes the addresses of fetched instructions back to the code pump. The code pump uses these addresses to determine which flow paths were followed and to deallocate any entries in the data structure which correspond to paths that were not followed.

REFERENCES:
patent: 4722050 (1988-01-01), Lee et al.
patent: 4742466 (1988-05-01), Ochiai et al.
patent: 4777594 (1988-10-01), Jones et al.
patent: 4920538 (1990-04-01), Chan et al.
patent: 5027270 (1991-06-01), Riodan et al.
patent: 5050068 (1991-09-01), Dollas et al.
patent: 5081574 (1992-01-01), Larson et al.
patent: 5165025 (1992-11-01), Lass
patent: 5230068 (1993-07-01), Van Dyke et al.
"A Distributed Logic Program Instruction Prefetching Scheme", Wolfgang A. Harlang, Microprocessing and Computing, 1987, pp. 407-415.
"The IBM System 1360 Model 91: Machine Philosophy and Instruction-Handling", D. W. Anderson et al., IBM Journal, Jan. 1967, pp. 8-24.
"Efficient Hardware for Multi-Way, Jumps and Pre-Fetches", K. Karplus et al., IEEE Micro, vol. 18, 1985, pp. 11-18.
Specification Document for F8 Microcomputer System, May 1976, pp. 1-1 to 1-20.
"The Case for the Sustained Performance Computer Architecture", A. Dollas et al., Computer Architecture News, vol. 17, No. 6, Dec. 1989, pp. 129-136.
"The Evolution of Instruction Sequencing", R. Kriek et al., Computer, vol. 24, No. 4, 1991, pp. 5-15.
"The Inhibition of Potential Parallelism by Conditional Jumps", E. M. Riseman et al., IEEE Trans. on Computers, 1972, pp. 1405-1411.
"Decoupled Access/Execute Computer Architectures", J. E. Smith, ACM Trans. on Computer Systems, vol. 2, No. 4, Nov. 1984, pp. 289-308.
"Code Generation for Stearing Access/Execute Mechanism," M. E. Benitez et al., ACM 0-89791-380-9/91/0003-0132, Sep. 1991, pp. 132-141.
"SIMP (Single Instruction Stream Multiple Instruction Pipelining): A Novel High-Speed Single-Processor Architecture", K. Murakanii et al., ACM 0884-7495/89/0000/0078, 1989, pp. 78-85.
"Mirage: A Model for Ultra-High-Speed Protocol Analysis and Design," J. D. Touch et al., Proc. IFIP WG 6.1/WG 6.4 Workshop on Protocols for High-Speed Networks, May. 1989, pp. 1-10.

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

Memory-side driven anticipatory instruction transfer interface w does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory-side driven anticipatory instruction transfer interface w, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory-side driven anticipatory instruction transfer interface w will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-589146

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