Fast POP operation from RAM cache using cache row value stack

Details Fast POP operation from RAM cache using cache row value stack Fast POP operation from RAM cache using cache row value stack

2006-11-14

2006-11-14

Kim, Kenneth S. (Department: 2111)

Electrical computers and digital processing systems: processing

Architecture based instruction processing

Stack based computer

C711S132000, C712S225000

Reexamination Certificate

active

07136990

ABSTRACT:
A method and apparatus for performing a fast pop operation from a random access cache is disclosed. The apparatus includes a stack onto which is pushed the row and way of push instruction data stored into the cache. When a pop instruction is encountered, the apparatus uses the row and way values at the top of the stack to access the cache. In one embodiment, an offset of the most recent push data within the current cache line specified by the top row and way values is maintained. The offset is updated on each push or pop. If a pop overflows the offset, the top entry of the stack is popped. If a push underflows the offset, the row and way values are pushed onto the stack. The row, way, and offset values are subsequently compared with the actual pop address to determine whether incorrect data was provided.

REFERENCES:
patent: 3401376 (1968-09-01), Barnes et al.
patent: 3810117 (1974-05-01), Healey
patent: 5043870 (1991-08-01), Ditzel et al.
patent: 5500950 (1996-03-01), Becker et al.
patent: 5751990 (1998-05-01), Krolak et al.
patent: 5930820 (1999-07-01), Lynch
patent: 5953741 (1999-09-01), Evoy et al.
patent: 5956752 (1999-09-01), Mathews
patent: 5960467 (1999-09-01), Mahalingaiah et al.
patent: 6009499 (1999-12-01), Koppala
patent: 6038643 (2000-03-01), Tremblay et al.
patent: 6151661 (2000-11-01), Adams et al.
patent: 6275903 (2001-08-01), Koppala et al.
patent: 6415380 (2002-07-01), Sato
patent: 6425055 (2002-07-01), Sager et al.
patent: 6532531 (2003-03-01), O'Connor et al.
patent: 6622211 (2003-09-01), Henry et al.
patent: 6671196 (2003-12-01), Civlin
patent: 2002/0144061 (2002-10-01), Faanes et al.
patent: 2003/0159003 (2003-08-01), Gaskins et al.
patent: 2004/0133886 (2004-07-01), Wu
patent: 2004/0186959 (2004-09-01), Kawamoto
patent: 2260429 (1993-04-01), None
patent: 2307319 (1997-05-01), None
(In the file SCreport.pdf): Implementing a Stack Cache; Hensath, Morton, Sjodin; obtained from website owlnet.rice.edu/˜elec525/projects/SCreport.pdf; accessed on Aug. 13, 2003.
(In the file JavaStack Cache.doc); Design Issues—Stack Cache; obtained from websites http://murray.newcastle.edu.au/users/students/1999/c9510422/design1.html; murray.newcastle.edu.au/users/students/1999/c9510422/design2.html; murray.newcastle.edu.au/users/students/1999/c9510422/design3.html; murray.newcastle.edu.au/users/students/1999/c9510422/design4.html; murray.newcastle.edu.au/users/students/1999/c9510422/architecture.html; accessed on Dec. 2, 2003.
(In the fine AMD Hammer micro architecture.pdf): AMD's Hammer micro architecture; website chip-architect.com
ews/hammer.jpg; accessed on Aug. 29, 2002.
“Dual On-Chip Instruction Cache Organization In High Speed Processors.”IBM Technical Disclosure Bulletin. IBM Corp. New York, US. vol. 37, No. 12, Dec. 1994, pp. 213-214.

Affiliated with

Also associated with

Rating

Fast POP operation from RAM cache using cache row value stack does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast POP operation from RAM cache using cache row value stack, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast POP operation from RAM cache using cache row value stack will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3665474