US2005267996A1PendingUtilityA1

Method frame storage using multiple memory circuits

Assignee: O'CONNOR JAMES MPriority: Jan 24, 1996Filed: Mar 30, 2005Published: Dec 1, 2005
Est. expiryJan 24, 2016(expired)· nominal 20-yr term from priority
G06F 9/30174G06F 9/264G06F 9/345G06F 12/0875G06F 9/45516G06F 9/449G06F 9/06G06F 9/30145G06F 9/30134G06F 9/45504G06F 9/30167G06F 15/7846G06F 9/30181G06F 9/30021G06F 9/3802G06F 2212/451G06F 9/3017
49
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A memory architecture in accordance with an embodiment of the present invention improves the speed of method invocation. Specifically, method frames of method calls are stored in two different memory circuits. The first memory circuit stores the execution environment of each method call, and the second memory circuit stores parameters, variables or operands of the method calls. In one embodiment the execution environment includes a return program counter, a return frame, a return constant pool, a current method vector, and a current monitor address. In some embodiments, the memory circuits are stacks; therefore, the stack management unit to cache can be used to cache either or both memory circuits. The stack management unit can include a stack cache to accelerate data transfers between a stack-based computing system and the stacks. In one embodiment, the stack management unit includes a stack cache, a dribble manager unit, and a stack control unit. The dribble manager unit includes a fill control unit and a spill control unit. Since the vast majority of memory accesses to the stack occur at or near the top of the stack, the dribble manager unit maintains the top portion of the stack in the stack cache. When the stack-based computing system is popping data off of the stack and a fill condition occurs, the fill control unit transfer data from the stack to the bottom of the stack cache to maintain the top portion of the stack in the stack cache. Typically, a fill condition occurs as the stack cache becomes empty and a spill condition occurs as the stack cache becomes full.

Claims

exact text as granted — not AI-modified
1 - 56 . (canceled)  
     
     
         57 . A method of generating executable code for a computer program in source code form, said method comprising: 
 determining whether said executable code is for execution by a microprocessor communicatively connected to a network and receiving said executable code therefrom for execution;    determining whether said executable code is for execution by a microprocessor connected to a local memory and receiving said executable code therefrom for execution; and    generating a first executable code with code verification in the event said first executable code is to be received from said network for execution by said microprocessor; or    generating a second executable code without code verification in the event said second executable code is to be received from said local memory for execution by said microprocessor.

Join the waitlist — get patent alerts

Track US2005267996A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.