发明名称 DYNAMIC ALLOCATION FOR EFFICIENT MANAGEMENT OF VARIABLE SIZED DATA WITHIN A NONVOLATILE MEMORY
摘要 <p>A method for storing received data is disclosed. A storage structure is selected for the data according to the relative size (z) of the data with respect to a plurality of thresholds including: a minimum number of instances (m), a maximum single instance size (s*g), and an allocation granularity (g). If z is less than a first threshold (920), the data is stored within a multiple instance object structure (922). If z is less than a second threshold (930), the data is stored as a single instance object (932). If z exceeds the second threshold, the data is fragmented and stored among the plurality of blocks of nonvolatile memory (942). If the number of fragments is less than a maximum sequence table size, then a sequence table indicative of the order and the locations of the data fragments is stored in the nonvolatile memory. If the number of data fragments exceeds the maximum sequence table size (940), then a plurality of sequence table fragments and a group table, indicating the order and the location of the sequence table fragments, are stored in the nonvolatile memory (944).</p>
申请公布号 WO1999054824(A1) 申请公布日期 1999.10.28
申请号 US1999008701 申请日期 1999.04.20
申请人 发明人
分类号 主分类号
代理机构 代理人
主权项
地址