Patent US6278713B1 successfully refreshed from Google Patents.
EP0486143A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Parallel processing of data
Assignee: International Business Machines Corp
•
Filing: 1991-09-30
•
Granted: —
•
Expires: 2011-09-30
Abstract
Abstract A method and an apparatus for processing a plurality of operands in parallel including packing the operands into a word with at least one cleared buffer bit between each operand and processing the packed word.
Inventors
- 👤 Allen Peter Jensen
- 👤 Michael Terrell Vanover
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-09 09:36
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F5/00; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30036; G06F9/30038; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/3808; G06F2207/3828
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
39 words
A method of operating a computer to process a plurality of operands in parallel comprising the steps of packing the operands into a word with at least one cleared buffer bit between each operand; and processing the packed word.
Claim 2
Independent Claim
39 words
A method of operating a computer to process a plurality of operands in parallel comprising the steps of packing the operands into a word with at least one cleared buffer bit between each operand; and processing the packed word.
Claim 3
Dependent Claim
20 words
A method as claimed in claim 1 further comprising the step of clearing the buffer bits in the processed word.
Claim 4
Dependent Claim
25 words
A method as claimed in claim 2 further comprising the step of unpacking at least one of the plurality of operands from the processed word.
Claim 5
Dependent Claim
23 words
A method as claimed in claim 3 wherein the step of unpacking comprises masking the processed word and sign extending the masked word.
Claim 6
Independent Claim
79 words
A method as claimed in any preceding claim for performing at least one operation to a first plurality of operands with a second plurality of operands comprising the steps of packing the first plurality of operands into a first packed word with at least one buffer bit between each of the plurality of operands, packing the second plurality of operands into a second packed word and performing said operation with the second packed word to the first packed word.
Claim 7
Independent Claim
146 words
A method as claimed in any of claims 1 to 4 for performing the Cohen-Sutherland algorithm to generate a region code for a first operand and a second operand from a third operand, a fourth operand, a fifth operand and a sixth operand comprising the steps of packing the first operand and the second operand into a first packed word with at least one buffer bit between the first and second operands, packing the third operand and the fourth operand into a second packed word, packing the fifth operand and the sixth operand into a third packed word, generating a first region subcode by comparing the first packed word with the second packed word, generating a second region subcode by comparing the first packed word with the third packed word and generating the region code by combining the first region subcode with the second region subcode.
Claim 8
Dependent Claim
35 words
Apparatus for processing a plurality of operands in parallel comprising means for packing the operands into a word with at least one cleared buffer bit between each operand and means for processing the packed word.
Claim 9
Dependent Claim
35 words
Apparatus for processing a plurality of operands in parallel comprising means for packing the operands into a word with at least one cleared buffer bit between each operand and means for processing the packed word.
Claim 10
Dependent Claim
18 words
Apparatus as claimed in claim 7 further comprising means for clearing the buffer bits in the processed word.
Claim 11
Dependent Claim
23 words
Apparatus as claimed in claim 8 further comprising means for unpacking at least one of the plurality of operands from the processed word.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.