US5867712A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Single chip integrated circuit system architecture for document instruction set computing
Assignee: Individual
•
Filing: 1997-12-05
•
Granted: 1999-02-02
•
Expires: 2017-12-05
Abstract
Abstract An improved system utility using pointers and stacks and a method for high level language procedure for representing, storing, retrieving, processing, and/or manipulating documents, said system utilities facilitates compilation, linkage, processing, and management of said high level language procedures. Call, return, and auxiliary stacks are included to store pointers of normal, exceptional/conditional, and alternative operations. A bit mapping logic and smart object memory are used to look ahead, monitor, and predict forthcoming exceptional/conditional operation, a system look-up table further prefetch relevant procedural and data pointers for maintaining pipeline coherence.
Inventors
- 👤 Venson M. Shaw
- 👤 Steven M. Shaw
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 16:33
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881; G06F9/465; H; H04; H04N; H04N1/00; H04N1/0035; H04N1/00352; H04N1/00392; H04N1/32; H04N1/32502; H04N19/00; H04N19/60; H04N19/61; H04N21/00; H04N21/40; H04N21/41; H04N21/426; H04N1/00127; H04N1/00204; H04N2201/00; H04N2201/0077; H04N2201/0081; H04N2201/0082; H04N2201/0084; H04N2201/0086; H04N2201/0087; H04N2201/0089
Claims Analysis
Total Claims: 104
Claim 1
Independent Claim
91 words
An improved data processor system for executing hierarchical high level language procedure calls, using pointers and stacks to represent run time execution of the high level language procedure calls by evaluating and manipulating said pointers and stacks, said system comprising: means for producing said high level language procedures calls; means for providing the run-time execution of said high level language procedure calls; and time measurement means for estimating worst case run-time dulration required for executing an entire or a selective portion of said high level language procedure calls during the run-time.
Claim 2
Dependent Claim
91 words
An improved data processor system for executing hierarchical high level language procedure calls, using pointers and stacks to represent run time execution of the high level language procedure calls by evaluating and manipulating said pointers and stacks, said system comprising: means for producing said high level language procedures calls; means for providing the run-time execution of said high level language procedure calls; and time measurement means for estimating worst case run-time dulration required for executing an entire or a selective portion of said high level language procedure calls during the run-time.
Claim 3
Dependent Claim
47 words
An improved data processor system in accordance with claim 1, wherein said time measurement means further comprising means for a compiler, prior to the run-time, for estimating worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 4
Dependent Claim
69 words
An improved data processor system in accordance with claim 1, said system further including stack means for providing the run-time execution at said high level language procedure calls; said stack means comprising top of stack means connected to said time measurement means for estinmating worst case time duration required for executing remainder portion of a corresponding procedure as referenced by a pointer stored in said top of said stack.
Claim 5
Dependent Claim
45 words
An improved data processor system in accordance with claim 1, said system further including means for looking ahead and preparing next stack operation when approaching end of said worst case time duration, wherein execution of said high level language procedure call is close to finishing.
Claim 6
Dependent Claim
38 words
An improved data processor system in accordance with claim 1, said system further including scheduler means for looking ahead and preparing for terminating present high level language procedure call and setting up forthcoming high level language procedure calls.
Claim 7
Dependent Claim
59 words
An improved data processor system in accordance with claim 1, said system further including scheduler means for looking ahead and preparing for setting up forthcoming high level language procedure calls; said scheduler means further examining said forthcoming high level language procedure calls and estimating said worst case time duration required to finish said forthcoming high level language procedure calls.
Claim 8
Dependent Claim
39 words
An improved data processor system in accordance with claim 1, said system further comprising interface means for receiving and producing said high level language procedures calls from external program, protocol, work flow, transaction, operating system, and/or database management/retrieval program.
Claim 9
Dependent Claim
45 words
An improved data processor system in accordance with claim 1, said system further comprising interface means for producing said high level language procedures calls for executing, manipulating, or processing of external document, task, transaction, program, protocol, work flow, transaction, operating system, and/or database management/retrieval program.
Claim 10
Dependent Claim
99 words
An improved data processor for efficient compilation, linikage, processing, and management of a single or plurality hierarchy of high level language procedure calls using evaluation and manipulation of pointers and stack; said system comprising: first means for a compiler to partition an apllication/program specification into a single or plurality hierarchy of independent executable modules; said first means further partitions each of said modules to single or plurality of executable sub-modules; and second means for time measurement means for estimating worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 11
Dependent Claim
99 words
An improved data processor for efficient compilation, linikage, processing, and management of a single or plurality hierarchy of high level language procedure calls using evaluation and manipulation of pointers and stack; said system comprising: first means for a compiler to partition an apllication/program specification into a single or plurality hierarchy of independent executable modules; said first means further partitions each of said modules to single or plurality of executable sub-modules; and second means for time measurement means for estimating worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 12
Dependent Claim
51 words
An improved data processor system in accordance with claim 9, wherein said second means for time measurement means further including means for allowing a compiler, prior to the run-time, to estimate worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 13
Dependent Claim
74 words
An improved data processor system in accordance with claim 9, wherein said second means for time measurement means further including means for allowing an operating system, an application/user interface, or a browser, during the run-time, to moderate change of said run-time environment, and to further estimate worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls which caused by said change of run-time enviroment.
Claim 14
Dependent Claim
110 words
An improved data processor system in accordance with claim 8, said data processing system further including, a third means for facilitating run-time execution of said high level language procedures; wherein said third means produces corresponding call pointer data structure for each of said modules or said sub-modules; said call pointer data structure comprising a procedure call stack and operand call stack; said procedure call stack including a sequence of next procedure pointer address which correspond with next normal or regular execution steps for each of said modules; said operand call stack inclluding a sequence of next data pointer address which correspond with local variable scope for each of said modules.
Claim 15
Dependent Claim
113 words
An improved data processor system in accordance with claim 12, said data processing system further including a fourth means for facilitating run-time execution of said high level language procedures; wherein said fourth means produces a corresponding return pointer data structure for each of said modules or said sub-modules; said return pointer data structure including a procedure return stack and operand return stack; said procedure return stack comprising a sequence of previous or alternative procedure pointer address which correspond with conditional or exceptional execution steps for each of said modules, said operand return stack comprising a sequence of previous or alternative data pointers which correspond with local variables scope for each of said modules.
Claim 16
Dependent Claim
109 words
An improved data processor system in accordance with claim 8, said data processing system further including a fifth means for facilitating run-time execution of said high level language procedures; wherein said fifth means produce a corresponding auxiliary pointer data structure for each of said modules or said sub-modules, said auxiliary pointer data structure comprising single or plurality of auxiliary procedure stacks and a single or plurality of auxiliary operand stacks; said auxiliary procedure stack including a plurality sequence of previous or subsequent procedure pointer; said auxiliary operand stack comprising a plurality sequence of next, previous or alternative data pointers which correspond with local variables scope for call destination modules.
Claim 17
Dependent Claim
68 words
An improved data processor system in accordance with claim 8, said data processing system further including a sixth means for facilitating run-time execution of said high level language procedures; wherein said sixth means produces a logic or storage means for monitoring execution of each of said modules or said sub-modules, said logic or storage determining an appropriate set of procedure pointer and data pointer for maititaining pipeline coherence.
Claim 18
Dependent Claim
68 words
An improved data processor system in accordance with claim 8, said data processing system further including a seventh means for facilitating run-time execution of said high level language procedures; wherein said seventh means produces a corresponding bit mapping logic for monitoring execution of each of said modules or said sub-modules, said bit mapping logic determining all appropriate set of procedure pointer and data pointer for maintaining pipeline coherence.
Claim 19
Dependent Claim
77 words
An improved data processor system in accordance with claim 16, said bit mapping logic in said seventh means comprising means for predicting/foreseeing which looking-ahead, monitoring whether forthcoming exceptional or conditional steps are arriving or changing of activation record is required; wherein when said means for predicting/foreseeing determines that the forthcoming exceptional or conditional steps are arriving or changing of activation record is required, said bit mapping logic then prefetching procedural and/or data pointers for maintaining pipeline coherence.
Claim 20
Dependent Claim
162 words
An improved system utility, using pointers and stacks for representing document as a high level language procedure calls, and processing said document according to sequential or parallel manipulation of said high level language procedure calls, said system comprising: input means for receiving external documents, said input means converting said document to selective internal format; oroanizer means for selecting an appropriate hierarchy of logical orders for each of said documents, wherein said hierarchy of logical order can be chapter, section, and paragraphs; said organizer means further partitioning each of said document into a plurality of logical partitions according to said selected hierarchy of logical orders; and procedure means, coupled to said organizer means, for producing a hierarchical procedure framework for each of said document, wherein a logical partition corresponds with document content of a particular logical order, and a companion procedure is assigned to each of said logical partition; wherein manipulation of said document is performed through executing of said hierarchical procedure framework.
Claim 21
Dependent Claim
162 words
An improved system utility, using pointers and stacks for representing document as a high level language procedure calls, and processing said document according to sequential or parallel manipulation of said high level language procedure calls, said system comprising: input means for receiving external documents, said input means converting said document to selective internal format; oroanizer means for selecting an appropriate hierarchy of logical orders for each of said documents, wherein said hierarchy of logical order can be chapter, section, and paragraphs; said organizer means further partitioning each of said document into a plurality of logical partitions according to said selected hierarchy of logical orders; and procedure means, coupled to said organizer means, for producing a hierarchical procedure framework for each of said document, wherein a logical partition corresponds with document content of a particular logical order, and a companion procedure is assigned to each of said logical partition; wherein manipulation of said document is performed through executing of said hierarchical procedure framework.
Claim 22
Dependent Claim
41 words
An improved system utility in accordance with claim 18, said system further including time measurement means for estimiating worst case rum-time duration required for executing an entire or a selective portion of said high level language procedure calls during the run-time.
Claim 23
Dependent Claim
53 words
An improved system utility in accordance with claim 18, said system further including means for producing high level language procedure calls performing program control functions for a hierarchical procedure framework including computer program, database program, work-flow program, object-oriented program; transaction processing program, operating system program, user interface program, browser program, or communications protocol.
Claim 24
Dependent Claim
41 words
An improved system utility in accordance with claim 18, said system further including procedure stack means for establishing a hierarchical order according to said selected logical order, wherein higher hierarchy represents broader logical order, lower hierarchies represent more detailed logical order.
Claim 25
Dependent Claim
39 words
An improved system utility in accordance with claim 21, wherein said procedure stack means further comprising selective plurality of operators, wherein a push operator move from higher to lower hierarchy, a pop operator move from lower to higher hierarchy.
Claim 26
Dependent Claim
33 words
An improved system utility in accordance with claim 18, said system further including evaluation stack for representing sequential steps of evaluation, processing, and/or manipulation of each of said logical partition in the stack.
Claim 27
Dependent Claim
24 words
An improved system utility in accordance with claim 18, said system further including interface means for selecting subject of interest from user or application.
Claim 28
Dependent Claim
59 words
An improved system utility in accordance with claim 18, said system further including search engine means for comparing, correlating, or interpreting said subject of interest with concept, theme, keyword, or topic of document content of each said logical partition, said search engine means identify selective plurality of logical partitions with corresponding document contents relevant to said subject of interest.
Claim 29
Dependent Claim
23 words
An improved system utility in accordance with claim 25, said search engine means can be performed by human, hardware, software or firmware resources.
Claim 30
Dependent Claim
53 words
An improved system utility in accordance with claim 18, said system further including procedure pointer means for assigning a pair of entry and exit pointers for each of said hierarchical procedure framework, said entry and exit pointers provides entry and exit address locations for the document content for each of said logical partition.
Claim 31
Dependent Claim
72 words
An improved system utility in accordance with claim 27, said system further including browsing means for selectively choosing from plurality of said entry and exit pointers of said procedure pointers means and organizing the pointers in a sequential order, said browsing means further allowing user or application to review selective document content or a particular subject of interest from one logical partition to another according to said sequential order of the pointers.
Claim 32
Dependent Claim
45 words
An improved system utility in accordance with claim 18, said system further producing said high level language procedures calls for executing, manipulating, or processing of external input other than document such as task, transaction, program, protocol, work flow, transaction, operating system, and/or database management/retrieval program.
Claim 33
Dependent Claim
151 words
An improved system utility, in accordance with claim 18, using pointers and stacks for representing subject of interest from selective plurality of user or application, wherein selecting subjects of interest by finding relevant document content, and referring them said subject of interest as a procedure scope for the corresponding logical partition, said system comprising: input means for receiving a list of subject of interest from a selective plurality of user or application; search engine means for comparing, correlating, and/or interpreting said list of subject of interest with concept, theme, keyword, or topic of document content of each said logical partition, provided said search engine means identifying selective plurality of logical partitions with corresponding document contents relevant to said subject of interest; and scoping means for creating a procedure scope for each corresponding procedure of said logical partition, said procedure scope comprises a selective plurality of local variables, global variables, and/or parameters.
Claim 34
Dependent Claim
38 words
An improved system utility, in accordance with claim 30, wherein each of said local variable represent an individual subject of interest for a particular user or application which have found relevancy within document content of said logical partition.
Claim 35
Dependent Claim
41 words
An improved system utility, in accordance with claim 30, wherein each of said global variable representing a common subject of interest for a selective plurality of said user or application which have found relevancy within document content of said document partition.
Claim 36
Dependent Claim
32 words
An improved system utility, in accordance with claim 30, wherein each of said parameter representing procedure pointers to selective one of plurality of remaining logical partitions which contain same subject of interest.
Claim 37
Dependent Claim
72 words
An improved system utility, in accordance with claim 30, said system further including activation means for continuously maintaining a record of currently active user/application and said active user/application's subject of interests, said activation means further continuously updating procedure scope for each of said companion procedure assigned to the logical partitions wherein local/global variable and parameter within said procedure scope can be updated according to subject of interest for those currently active user/application.
Claim 38
Dependent Claim
232 words
An improved system utility using pointers and stacks for prediction and managing flow control of forthcoming sequence of normal and exceptional run-time execution of a high level language procedure call, in order to manipulate selective logical partitions with document content relevant to subject of interest for a selective one or plurality of active user or application, said system comprising: predictor means for looking ahead of execution and determining whether forthcoming execution is a normal operation or an exceptional operation; look-ahead address pointer preparation means connected to said prediction means for preparing address pointers for said forthcoming exceptional/abnormal operation in order to maintain continuous execution: (i) call stack means comprising a list of address pointers for next instruction under normal operation, wherein address preparation is not required since document will continue to be browsed or reviewed unit by unit, wherein next address pointer is achieved by incrementing one unit from a current address location; (ii) return stack means comprising a list of address pointer for next instruction under abnormal/exception operation, wherein address preparation is required since document will not continue to be browsed in the same logical partition, wherein the address pointer for the next instruction can not be simply achieved by incrementing one unit from a current address location, unless forthcoming pointer can be identified prior to said forthcoming pointer execution time, and execution will be halted until address preparation is performed.
Claim 39
Dependent Claim
232 words
An improved system utility using pointers and stacks for prediction and managing flow control of forthcoming sequence of normal and exceptional run-time execution of a high level language procedure call, in order to manipulate selective logical partitions with document content relevant to subject of interest for a selective one or plurality of active user or application, said system comprising: predictor means for looking ahead of execution and determining whether forthcoming execution is a normal operation or an exceptional operation; look-ahead address pointer preparation means connected to said prediction means for preparing address pointers for said forthcoming exceptional/abnormal operation in order to maintain continuous execution: (i) call stack means comprising a list of address pointers for next instruction under normal operation, wherein address preparation is not required since document will continue to be browsed or reviewed unit by unit, wherein next address pointer is achieved by incrementing one unit from a current address location; (ii) return stack means comprising a list of address pointer for next instruction under abnormal/exception operation, wherein address preparation is required since document will not continue to be browsed in the same logical partition, wherein the address pointer for the next instruction can not be simply achieved by incrementing one unit from a current address location, unless forthcoming pointer can be identified prior to said forthcoming pointer execution time, and execution will be halted until address preparation is performed.
Claim 40
Dependent Claim
45 words
An improved system utility using pointers and stacks in accordance with claim 35, said system further including time measurement means for estimating worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls during the run-time.
Claim 41
Dependent Claim
71 words
An improved system utility using pointers and stacks in accordance with clam 35, said system including comparator means for continuously comparing current address location with the exit address pointer representing end of document content for said logical partition, wherein a significant difference shows next operation is a normal operation, and a insignificant difference shows operation is approaching end of said logical partition, exceptional operation will arise and address preparation is required.
Claim 42
Dependent Claim
71 words
An improved system utility using pointers and stacks in accordance with clam 35, said system including comparator means for continuously comparing current address location with the exit address pointer representing end of document content for said logical partition, wherein a significant difference shows next operation is a normal operation, and a insignificant difference shows operation is approaching end of said logical partition, exceptional operation will arise and address preparation is required.
Claim 43
Dependent Claim
48 words
An improved system utility using pointers and stacks in accordance with claim 35, said system further including look-ahead parameter pointer preparation means for looking-up, evaluating, and determining a parameter or another address pointer for a next logical partition which contains document content with the same subject of interest.
Claim 44
Dependent Claim
60 words
An improved system utility using pointers and stacks in accordance with claim 35, said predictor means for looking ahead of execution and determining whether forthcoming execution is a normal operation, wherein the normal operation occurs most of the time, wherein said system continue browsing and reviewing document content within same logical partition, and continue executing next instruction within same procedure.
Claim 45
Dependent Claim
57 words
An improved system utility using pointers and stacks in accordance with claim 39, said system further including incrementor means for continuously incrementing current address pointer by one unit and use the address pointer as address pointer for a next normal operation, said means further storing said next address pointers in said call stack for facilitating continuous execution.
Claim 46
Dependent Claim
97 words
An improved system utility using pointers and stacks in accordance with claim 35, said predictor means for looking ahead of execution and determining whether forthcoming execution is an exceptional operation, wherein exceptional/abnormal operation occurs occasionally, wherein said system complete browsing the document content within a same logical partition and requiring to enter to a next logical partition or return to a selective one of plurality of previous logical partitions, wherein the system will need to enter to a next procedure or return to a selective one of plurality of the previous procedure in order to continue execution.
Claim 47
Dependent Claim
66 words
An improved system utility using pointers and stacks in accordance with claim 41, said system further including return stack preparation means, connected to said look-ahead address pointer preparation means for continuously looking ahead and identifying forthcoming operations require entrance to a next or a previous logical partition, and preparing or assembling a list of address pointer in said return stack, in preparation for said forthcoming operations.
Claim 48
Dependent Claim
212 words
An improved system utility, using pointers and stacks for direct execution of hierarchical high level language procedures in order to manipulate selective logical partitions with document content relevant to the subject of interest for a selective one or plurality of active user or application; comprising: operation means for preparing a program sequence for each evaluation, manipulation, and processing operation of the document content of each of the logical partition; time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls; system look up table (SLUT) means for providing a program storage for all of said program sequence for evaluation, manipulation, and processing operation of the document content of each of the logical partition; pointer preparation means for producing a address pointer including index, attribute, identifier, or descriptor, for referring to each of said evaluation, processing, or manipulation operation of the document content of each of the logical partition; and stack preparation means connected to said pointer preparation means for providing program control stack and data stack framework for run time execution of said each logical partition, said stack preparation means preparing said pointers according to run time execution order of evaluation, manipulation, and processing of said document content.
Claim 49
Dependent Claim
212 words
An improved system utility, using pointers and stacks for direct execution of hierarchical high level language procedures in order to manipulate selective logical partitions with document content relevant to the subject of interest for a selective one or plurality of active user or application; comprising: operation means for preparing a program sequence for each evaluation, manipulation, and processing operation of the document content of each of the logical partition; time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls; system look up table (SLUT) means for providing a program storage for all of said program sequence for evaluation, manipulation, and processing operation of the document content of each of the logical partition; pointer preparation means for producing a address pointer including index, attribute, identifier, or descriptor, for referring to each of said evaluation, processing, or manipulation operation of the document content of each of the logical partition; and stack preparation means connected to said pointer preparation means for providing program control stack and data stack framework for run time execution of said each logical partition, said stack preparation means preparing said pointers according to run time execution order of evaluation, manipulation, and processing of said document content.
Claim 50
Dependent Claim
55 words
An improved system utility in accordance with claim 43, said system further including procedure preparation means for producing the hierarchial procedure framework for each document, wherein each of said hierarchial procedure framework enclosing said program control stack and said data stack for evaluation, manipulation, and processing of said document content of said each logical partition.
Claim 51
Dependent Claim
66 words
An improved system utility in accordance with claim 43, said system further including run-time direct execution means for executing each of said logical partition within a document according to said program control stack and said data stack, said run-time direct execution means further referring to said address pointer for each step of evaluation, processing, or manipulation, and directly fetching the program sequence stored within said system-look-up-table.
Claim 52
Dependent Claim
272 words
An improved system utility, using pointers and stacks for prediction of change of run time environment including active user or application, continuously executing subject of interest, and processing selective logical partitions within a document containing said subject of interest, said system comprising: environment bit map means for storing current status of a run time environment in a bit map, wherein said run time environment provides a current updated list of active user, application, and/or communication bandwidth; environment bit map stack means for sensitizing change of said run time environment including user, application, and/or communication bandwidth, said environment bit map stack means continuously registering and storing a present run time environment status at top of said environment bit map stack, said environment bit map stack means further pushing previous run time environment status into a next lower level of said bit map stack, comparing and determining any difference between content stored at top of said bit map stack and content stored at lower level of said bit map stack; subject bit map means connected to said environment bit map stack means for representing and updating a list of subject of interest of currently active user and applications in a bit map; and subject bit map stack means connected to said subject bit map means for continuously updating, the list of subject of interest, and storing current the list of subject of interest at top of said subject bit map stack, said subject bit map stack means further comparing said current list with previous list for identifying a list of new subject of interest, which is caused by change of active user or application.
Claim 53
Dependent Claim
272 words
An improved system utility, using pointers and stacks for prediction of change of run time environment including active user or application, continuously executing subject of interest, and processing selective logical partitions within a document containing said subject of interest, said system comprising: environment bit map means for storing current status of a run time environment in a bit map, wherein said run time environment provides a current updated list of active user, application, and/or communication bandwidth; environment bit map stack means for sensitizing change of said run time environment including user, application, and/or communication bandwidth, said environment bit map stack means continuously registering and storing a present run time environment status at top of said environment bit map stack, said environment bit map stack means further pushing previous run time environment status into a next lower level of said bit map stack, comparing and determining any difference between content stored at top of said bit map stack and content stored at lower level of said bit map stack; subject bit map means connected to said environment bit map stack means for representing and updating a list of subject of interest of currently active user and applications in a bit map; and subject bit map stack means connected to said subject bit map means for continuously updating, the list of subject of interest, and storing current the list of subject of interest at top of said subject bit map stack, said subject bit map stack means further comparing said current list with previous list for identifying a list of new subject of interest, which is caused by change of active user or application.
Claim 54
Dependent Claim
25 words
An improved system utility, in accordance with claim 46, wherein said bit map and/or said stack can be extended to other logic or storage means.
Claim 55
Dependent Claim
51 words
An improved system utility, in accordance with claim 46, said system further including prediction means connected to said subject bit map stack means for collecting said list of new subject of interest, and proceeding with evaluation and identification of the selective logical partitions with content relevant to said subject of interest.
Claim 56
Dependent Claim
48 words
An improved system utility, in accordance with claim 48, said system further including a search engine in said prediction means for collecting said list of new subject of interest, and proceeding with evaluation and identification of file selective logical partitions with content relevant to said subject of interest.
Claim 57
Dependent Claim
31 words
An improved system utility, in accordance with claim 46, said system further including procedure frame means connected to said prediction means for preparing a procedure framework for forthcoming run time execution.
Claim 58
Dependent Claim
32 words
An improved system utility, in accordance with claim 50, said procedure frame means further including object stack means for selecting global variables, local variables, and parameters for each of said logical partition.
Claim 59
Dependent Claim
23 words
An improved system utility, in accordance with claim 51, wherein said global variable representing common interest and/or said local variable representing individual interest.
Claim 60
Dependent Claim
31 words
An improved system utility, in accordance with claim 50, said procedure frame means further including evaluation stack for selecting sequential computation or evaluation steps required for each of said logical partition.
Claim 61
Dependent Claim
40 words
An improved system utility, in accordance with claim 53, said system further including procedure stack means connected to said procedure frame means for producing a sequence of browsing operation for reviewing the selective logical partitions containing relevant subject of interest.
Claim 62
Dependent Claim
60 words
An improved system utility, in accordance with claim 54, said system further including means connecting said procedure stack means with a browser, an operating system, or a user application interface program, wherein said procedure stack means connected to said procedure frame means for producing a sequence of browsing operation for reviewing the selective logical partitions containing relevant subject of interest.
Claim 63
Dependent Claim
44 words
An improved system utility, in accordance with claim 54, said system further including exception handling means connected to said procedure stack means and said evaluation stack means for identifying exception/abnormal operations which requires an exit from current procedure and an entrance to another prosedure.
Claim 64
Dependent Claim
38 words
An improved system utility, in accordance with claim 56, said system further including return stack means connected to said exception handling means for looking ahead, and preparing a list of address pointers for the forthcoming procedure entry locations.
Claim 65
Dependent Claim
57 words
An improved system utility, in accordance with claim 57, said return stack means further connected to an evaluation stack for monitoring evaluation steps when current procedure approaching end of operation, and having a next procedure entry pointer ready at top of said return stack means, wherein system continue with next procedure without further delay for address preparation.
Claim 66
Dependent Claim
92 words
An improved system utility, in accordance with claim 58, said return stack means further connected to a time measurement means for estimating worst case run-time duration required for executing an entire or a selective portion of said high level language procedure calls during the run-time; said return stack further connected to an evaluation stack for monitoring evaluation steps when current procedure approaching end of operation, and having a next procedure entery pointer ready at top of said return stack means, wherein system continue with next procedure without further delay for address preparation.
Claim 67
Dependent Claim
135 words
An improved data processor for providing pointers and stacks for remote execution of high level language procedural calls, said system comprising: a server or a host system means, where a plurality of applications are stored as high level language procedures, said server means provides pointers and stacks data structure for facilitating run-time execution of said high level language procedures; a plurality of user or client terminal means; a networking means for connecting said server and said client terminals; means for receiving request for the application from said client terminal; scheduler means for determining a selective set of procedures in said application to be performed on said client terminal means, and time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 68
Dependent Claim
135 words
An improved data processor for providing pointers and stacks for remote execution of high level language procedural calls, said system comprising: a server or a host system means, where a plurality of applications are stored as high level language procedures, said server means provides pointers and stacks data structure for facilitating run-time execution of said high level language procedures; a plurality of user or client terminal means; a networking means for connecting said server and said client terminals; means for receiving request for the application from said client terminal; scheduler means for determining a selective set of procedures in said application to be performed on said client terminal means, and time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 69
Dependent Claim
43 words
An improved data processor in accordance with claim 60, for providing pointers and stacks for remote execution of high level language procedural calls, wherein said time measurement means further coupled to said scheduler means for monitoring progress of executing each of said procedure.
Claim 70
Dependent Claim
67 words
An improved data processor in accordance with claim 61, for providing pointers and stacks for remote execution of high level language procedural calls; wherein remaining portion of said application is to be performed at said server or said client, said time measurement means further alerting said client and/or said server scheduler means for further preparing corresponding stacks and pointers data structure for said selected set of procedures.
Claim 71
Dependent Claim
38 words
An improved data processor in accordance with claim 60, said system further including means for forwarding corresponding pointers and stacks information for said selected procedures to said client terminal means in order to set up run-time execution environment.
Claim 72
Dependent Claim
55 words
An improved data processor in accordance with claim 63, said system further including memory map means for communicating/exchanging data, pointer, and/or stack information between said server and said client terminal means, wherein said memory map means select memory locations on said client terminal means and map said memory locations to address space of said server.
Claim 73
Dependent Claim
40 words
An improved data processor in accordance with claim 64, said memory map means can be further used for general purpose or special purpose communication and/or exchanging of data, status, and/or program intformation between said server and said client terminal means.
Claim 74
Dependent Claim
36 words
An improved data processor in accordance with claim 60, said system further including means in said client for interpreting, simulating, emulating, and/or performing run-time execution of said selected procedures according to said corresponding pointers and stacks.
Claim 75
Dependent Claim
36 words
An improved data processor in accordance with claim 60, said system further including means for forwarding result, argument, or parameters of said selected procedures between said server and said client after completion of said run-time execution.
Claim 76
Dependent Claim
105 words
An improved data processor for a distributed or downloadable operating system program, providing pointers and stacks for efficient compilation; linkage, processing, and management of corresponding hierarchical high level language procedural calls, said system comprising: means in a client for performing micro kernel system functions; means in said client for defining a set of selective hardware and/or software system resources information required to be managed by said client during run-time; means for communicating said hardware and/or sotftware system resource information to a server; and means in said server for providing operating system programs for said client as in a set of high level language based procedures.
Claim 77
Dependent Claim
105 words
An improved data processor for a distributed or downloadable operating system program, providing pointers and stacks for efficient compilation; linkage, processing, and management of corresponding hierarchical high level language procedural calls, said system comprising: means in a client for performing micro kernel system functions; means in said client for defining a set of selective hardware and/or software system resources information required to be managed by said client during run-time; means for communicating said hardware and/or sotftware system resource information to a server; and means in said server for providing operating system programs for said client as in a set of high level language based procedures.
Claim 78
Dependent Claim
77 words
An improved data processor in accordance with claim 68, said system further comprising: means for producing corresponding pointer and stack for each of said high level language procedures for facilitating run-time execution of said operating system program; means for downloading or transporting said pointer and/or stack data structure through said communication means to said client; and means in said client means for performing run-time execution of said operating system program according to said corresponding pointers and stacks.
Claim 79
Dependent Claim
38 words
An improved data processor in accordance with claim 68, said system further comprising time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 80
Dependent Claim
51 words
An improved data processor in accordance with claim 70, said system further comprising means coupled to said time measurement means for management of time critical system functions including execution and scheduling for a multiplicity of threads, synchronization for a multiplicity of processes, and translation and mapping for high level system objects.
Claim 81
Dependent Claim
51 words
An improved data processor in accordance with claim 68, said system further comprising reconfiguration means for updating change of run-time system resources for said clients, said reconfiguration means communicating to said server and preparing a second set of pointer and stack data structure for run-time execution of corresponding operating system program.
Claim 82
Dependent Claim
37 words
An improved data processor, in accordance with claim 72, wherein said reconfiguration means further perform a system reset and download said operating system program to said client for continuing the run-time execution of said operating system program.
Claim 83
Dependent Claim
25 words
An improved data processor in accordance with claim 68, said system further comprising a browser means for facilitating communications between said server and said client.
Claim 84
Dependent Claim
26 words
An improved data processor in accordance with claim 68, said system further comprising an application/user interface means for facilitating communications between said server and said client.
Claim 85
Dependent Claim
189 words
An improved data processor for efficient compilation, linkage, processing, and management of corresponding high level language procedural calls, said system comprising: means for producing a set of high level language procedural calls; means for providing a run-time execution environment for a current high level language procedure call which is being executed; time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure call; real time clock means; wherein said means can be managed by a hardware, software or firmware system resource; timer means connected to said real time clock means for measuring and monitoring the progress of said current high level language procedure calls during its run-time execution; look ahead means coupled to said timer means for producing a alert signal when the current high level language procedure call is approaching the end of its run-time execution; and prediction means coupled to said look ahead means for determining a next forthcoming high level language procedure; said means further proceed and prepare the run-time environment for said forthcoming high level language procedure prior to its run-time execution.
Claim 86
Dependent Claim
189 words
An improved data processor for efficient compilation, linkage, processing, and management of corresponding high level language procedural calls, said system comprising: means for producing a set of high level language procedural calls; means for providing a run-time execution environment for a current high level language procedure call which is being executed; time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure call; real time clock means; wherein said means can be managed by a hardware, software or firmware system resource; timer means connected to said real time clock means for measuring and monitoring the progress of said current high level language procedure calls during its run-time execution; look ahead means coupled to said timer means for producing a alert signal when the current high level language procedure call is approaching the end of its run-time execution; and prediction means coupled to said look ahead means for determining a next forthcoming high level language procedure; said means further proceed and prepare the run-time environment for said forthcoming high level language procedure prior to its run-time execution.
Claim 87
Dependent Claim
149 words
An improved data processor for an operating system program, providing pointers and stacks for efficient compilation, linkage, processing, and management of hierarchical high level language procedural calls, said system comprising: means performing system functions; means in said system for defining a set of selective internal and/or external hardware and/or software system resources required to be managed by said system; means for communicating said hardware and/or software system resource information to said system; means in said system for providing operating system programs as in a set of high level language based procedures; means in said system for performing run-time execution of said operating system programed according to said high level language based procedures; real time clock means; and time measurement means coupled to said real time clock means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 88
Dependent Claim
149 words
An improved data processor for an operating system program, providing pointers and stacks for efficient compilation, linkage, processing, and management of hierarchical high level language procedural calls, said system comprising: means performing system functions; means in said system for defining a set of selective internal and/or external hardware and/or software system resources required to be managed by said system; means for communicating said hardware and/or software system resource information to said system; means in said system for providing operating system programs as in a set of high level language based procedures; means in said system for performing run-time execution of said operating system programed according to said high level language based procedures; real time clock means; and time measurement means coupled to said real time clock means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 89
Dependent Claim
25 words
An improved data processor in accordance with claim 77, said system further including means for performing micro kernel system functions for said operating system program.
Claim 90
Dependent Claim
36 words
An improved data processor in accordance with claim 77, said system further including means for producing corresponding pointer and stack for facilitating run-time execution of said high level language based procedures for said operating system program.
Claim 91
Dependent Claim
33 words
An improved data processor in accordance with claim 79, said system further including means in said system for performing run-time execution of said operating system program according to said corresponding pointers and stacks.
Claim 92
Dependent Claim
206 words
An improved data processor, further providing pointers and stacks for providing a downloadable communications protocol program for efficient compilation, linkage, processing, and management of hierarchical high level language procedural calls, said system comprising: a library comprising single or plurality communications means, wherein each of said communications means defines a multiple layered of communications protocol program; a network of transmitting and receiving system means, wherein each of said transmitting and receiving system means comprises means for selecting one of said plurality of communications means, means for representing each of said communications protocol programs in one of said communications means as a set of high level language procedures; means for constructing a protocol stack, wherein each level of said stack corresponding to a particular layer of said communications protocol, and each level of said stack stores a pointer directing to the corresponding high level language procedures; means for downloading or transporting said pointers and stack information to said transmitting and receiving system means; means in said transmitting and receiving system means for performing run-time execution of said communications protocol program according to said corresponding pointers and stacks; and means in said transmitting and receiving system for executing said communications protocols for transmitting and/or receiving program or data information.
Claim 93
Dependent Claim
206 words
An improved data processor, further providing pointers and stacks for providing a downloadable communications protocol program for efficient compilation, linkage, processing, and management of hierarchical high level language procedural calls, said system comprising: a library comprising single or plurality communications means, wherein each of said communications means defines a multiple layered of communications protocol program; a network of transmitting and receiving system means, wherein each of said transmitting and receiving system means comprises means for selecting one of said plurality of communications means, means for representing each of said communications protocol programs in one of said communications means as a set of high level language procedures; means for constructing a protocol stack, wherein each level of said stack corresponding to a particular layer of said communications protocol, and each level of said stack stores a pointer directing to the corresponding high level language procedures; means for downloading or transporting said pointers and stack information to said transmitting and receiving system means; means in said transmitting and receiving system means for performing run-time execution of said communications protocol program according to said corresponding pointers and stacks; and means in said transmitting and receiving system for executing said communications protocols for transmitting and/or receiving program or data information.
Claim 94
Dependent Claim
38 words
An improved data processor, in accordance with claim 81, said system further including time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 95
Dependent Claim
26 words
An improved data processor, in accordance with claim 81, said system further including means for providing pointers and stacks for the corresponding high level language procedures.
Claim 96
Dependent Claim
39 words
An improved data processor, in accordance with claim 81, said system further including means for performing run-time execution of said communications protocol program according to said corresponding pointers and stacks for facilitating the run-time execution of said communications protocol.
Claim 97
Dependent Claim
136 words
An improved data processor for providing pointers and stacks as in software data structure, comprising: storage means having a memory array or a register array function as stack; means for allocating a selective plurality of locations in said stack of said storage means, wherein each of said locations represents a level of said stack, and corresponding pointer information for each level of said stack is stored in each of said storage location; means for assigning one of said storage locations as top of said stack; indexing means for providing a push or a pop operation for said stack; means for writing pointer information into said storage locations for said stack; means for reading pointer information from said storage locactions for said stack; and means for detecting overflow or underflow of the pointer information in said stack.
Claim 98
Dependent Claim
136 words
An improved data processor for providing pointers and stacks as in software data structure, comprising: storage means having a memory array or a register array function as stack; means for allocating a selective plurality of locations in said stack of said storage means, wherein each of said locations represents a level of said stack, and corresponding pointer information for each level of said stack is stored in each of said storage location; means for assigning one of said storage locations as top of said stack; indexing means for providing a push or a pop operation for said stack; means for writing pointer information into said storage locations for said stack; means for reading pointer information from said storage locactions for said stack; and means for detecting overflow or underflow of the pointer information in said stack.
Claim 99
Dependent Claim
38 words
An improved data processor, in accordance with claim 85, said system further including time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 100
Dependent Claim
46 words
An improved data processor, in accordance with claim 86, said system further including a real time clock means coupled to said time measurement means for estimating worst case time duration required for executing an entire or a selective portion of said high level language procedure calls.
Claim 101
Dependent Claim
36 words
An improved data processor, in accordance with claim 85, wherein said storage means is not only suitable for the memory array or the register array data structure, it can further be extended to file or database.
Claim 102
Dependent Claim
71 words
An improved data processor, in accordance with claim 85, wherein said indexing means for providing a push or a pop operation for said stack, wherein a push operation is performed by decrementing said storage address by one unit from said storage location representing said top of said stack, a pop operation is performed by incrementing said storage address by one unit from said storage location representing said top of said stack.
Claim 103
Dependent Claim
163 words
An improved data processor, further providing time management for the pointers and stacks, said system comprising: time measurement means for estimating worst case time duration required for executing an entire or a selective portion of a high level language procedure calls; top of stack means connected to said time measurement means for estimating worst case time duration required for executing remainder portion of a corresponding procedure as referenced by a pointer stored in said top of said stack; means for looking ahead and preparing next stack operation when approaching end of said worst case time duration, wherein execution of said high level language procedure call is close to finishing, and scheduler means for looking ahead and preparing for terminating present high level language procedure calls and setting up forthcoming high level language procedure calls, said scheduler means further examining said forthcoming high level language procedure calls and estimating said worst case time duration required to finish said forthcoming high level language procedure calls.
Claim 104
Dependent Claim
163 words
An improved data processor, further providing time management for the pointers and stacks, said system comprising: time measurement means for estimating worst case time duration required for executing an entire or a selective portion of a high level language procedure calls; top of stack means connected to said time measurement means for estimating worst case time duration required for executing remainder portion of a corresponding procedure as referenced by a pointer stored in said top of said stack; means for looking ahead and preparing next stack operation when approaching end of said worst case time duration, wherein execution of said high level language procedure call is close to finishing, and scheduler means for looking ahead and preparing for terminating present high level language procedure calls and setting up forthcoming high level language procedure calls, said scheduler means further examining said forthcoming high level language procedure calls and estimating said worst case time duration required to finish said forthcoming high level language procedure calls.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-02-01 | 2002-08-03 | 2003-02-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-02-01 | 2006-08-03 | 2007-02-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-02-01 | 2010-08-03 | 2011-02-02 | $7700.00 | Window Closed / Lapsed |