← Back to Patent Explorer
US5568616A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for dynamic scheduling of 3D graphics rendering using virtual packet length reduction

Assignee: International Business Machines Corp
•
Filing: 1993-09-14
•
Granted: 1996-10-22
•
Expires: 2013-09-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method for virtually reducing interprocess communication packet size by dynamically redispatching packets for execution. A subcommand dispatching process dispatches individual subcommands and accumulates the resources used by each. The accumulated resource value is tested against a threshold. If the threshold is exceeded, the next subcommand position is recorded and control returned to the interprocess communication packet dispatcher for later dispatch. The virtual reduction of the packet size to conform to resource limits processor commitment to a single packet.

Inventors

  • 👤 Chandrasekhar Narayanaswami

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 13:30
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/40

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 156 words
A method for virtually reducing interprocess communication packet size in a client/server system having a server process receiving interprocess communication packets of a first size, the interprocess communication packets containing a sequential plurality of subcommands for processing by the server process, the server having a means for storing a plurality of interprocess communication packets for processing and a means for dispatching one of said interprocess communication packets for processing, the method comprising the steps of: dispatching a next sequential one of said plurality of subcommands in said dispatched interprocess communication packet for processing; accumulating an indicia of resources committed to said processing; testing said accumulated indicia against a threshold; and repeating said dispatching, accumulating and testing steps for a next sequential command if said indicia is less than said threshold, or signalling said server to redispatch said dispatched interprocess communication packet and terminating processing of said dispatched interprocess communication packet if said indicia exceed the threshold.
Claim 2
Independent Claim 156 words
A method for virtually reducing interprocess communication packet size in a client/server system having a server process receiving interprocess communication packets of a first size, the interprocess communication packets containing a sequential plurality of subcommands for processing by the server process, the server having a means for storing a plurality of interprocess communication packets for processing and a means for dispatching one of said interprocess communication packets for processing, the method comprising the steps of: dispatching a next sequential one of said plurality of subcommands in said dispatched interprocess communication packet for processing; accumulating an indicia of resources committed to said processing; testing said accumulated indicia against a threshold; and repeating said dispatching, accumulating and testing steps for a next sequential command if said indicia is less than said threshold, or signalling said server to redispatch said dispatched interprocess communication packet and terminating processing of said dispatched interprocess communication packet if said indicia exceed the threshold.
Claim 3
Independent Claim 56 words
A system for dynamically redispatching an interprocess communication packet having a plurality of processing subcommands, the system comprising: means for dispatching individual subcommands for processing; means for accumulating an indicia of resources used by said dispatched subcommands; means for testing said accumulated indicia and requesting redispatch of said communication packet if said indicia exceeds a threshold.
Claim 4
Independent Claim 56 words
A system for dynamically redispatching an interprocess communication packet having a plurality of processing subcommands, the system comprising: means for dispatching individual subcommands for processing; means for accumulating an indicia of resources used by said dispatched subcommands; means for testing said accumulated indicia and requesting redispatch of said communication packet if said indicia exceeds a threshold.
Claim 5
Dependent Claim 19 words
The system of claim 2, wherein said indicia of resources is a weighted value assigned to each command type.
Claim 6
Dependent Claim 13 words
The system of claim 2, wherein said indicia of resources is elapsed time.
Claim 7
Dependent Claim 71 words
A computer program product having a computer readable medium having computer program logic recorded thereon for dynamically redispatching an interprocess communication packet having a plurality of processing subcommands, said computer program product comprising: means for dispatching individual subcommands for processing; means for accumulating an indicia of resources used by said dispatched subcommands; means for testing said accumulated indicia and requesting redispatch of said communication packet if said indicia exceeds a threshold.
Claim 8
Dependent Claim 71 words
A computer program product having a computer readable medium having computer program logic recorded thereon for dynamically redispatching an interprocess communication packet having a plurality of processing subcommands, said computer program product comprising: means for dispatching individual subcommands for processing; means for accumulating an indicia of resources used by said dispatched subcommands; means for testing said accumulated indicia and requesting redispatch of said communication packet if said indicia exceeds a threshold.
Claim 9
Dependent Claim 21 words
A program product as in claim 5, wherein said indicia of resources is a weighted value assigned to each command type.
Claim 10
Dependent Claim 15 words
A program product as in claim 5, wherein said indicia of resources is elapsed time.

References Cited (Backward Citations)

US4853956A Cited
EP0254047A2 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-10-22 2000-04-22 2000-10-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-10-22 2004-04-22 2004-10-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-10-22 2008-04-22 2008-10-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag