Allocating storage for aligned data
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jan 14, 2003
Grant Date -
N/A
app pub date -
Mar 23, 2001
filing date -
Mar 23, 2001
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A method and computer program for allocating storage for a header and one or more data elements in a data storage facility are disclosed. The method and computer program include computing a hole size B that is a portion of a word that would be unallocated if storage were allocated to the header and to the data elements in a preferred order. The method and computer program include finding a subset of data elements S={F.sub.i1, F.sub.i2, . . . , F.sub.in } that satisfy the equation (SizeModN(F.sub.i1)+SizeModN(F.sub.i2)+ . . . +SizeModN(F.sub.in))mod N=B where N is the largest alignment requirement associated with any data element. The method and computer program include allocating storage to data elements in S first and allocating storage to the remaining elements in the preferred order. A lookup table and a method for building the lookup table are also disclosed.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully