Time bound of Nonvolatile Bitmap Initialization
Original Publication Date: 2004-Sep-07
Included in the Prior Art Database: 2004-Sep-07
Presented herein is a method for breaking the task of setting up bitmaps into sub-tasks and deferring the sub-tasks such that each sub-task is performed when the relevant bitmap is needed, not at the time the bitmap is logically set. At the time the bitmap is logically set, the time required is constant, independent of the size of the bitmap.