Device for storing data and method for dividing space for data storing

• US 20050108269A1
• Filed: 01/16/2003
• Published: 05/19/2005
• Est. Priority Date: 01/18/2002
• Status: Abandoned Application

• Current Assignee: Advanced Digital Broadcast Polska SPZ OO
• Original Assignee: Advanced Digital Broadcast Polska SPZ OO
• Inventors: Biniszkiewicz, Adam, Szajdecki, Andrzej
• Application Number:
  US10/501,116
• Publication Number:
  US 20050108269A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 3/0626 Reducing size or complexity of storage systems
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0676 Magnetic disk device

Abstract

A device for data storing with logically separated areas has blocks (2, 3, 4) of a predetermined size created from a definite number of logically separated smallest areas (1). Larger blocks (3, 4) with a higher integration level are definite multiples of smaller blocks (2, 3) with a lower integration level, and the smaller blocks (2, 3) compose the larger blocks (3, 4) larger by one integration level, and integration of the logically separated smallest areas (1) is performed in recurrent manner till the integration covers the whole area of the device for data storing.

Claims

1. A device for data storing with logically separated areas comprising blocks (2, 3, 4) of a predetermined size created from a definite number of logically separated smallest areas (1), wherein larger blocks (3, 4) with a higher integration level are definite multiples of smaller blocks (2, 3) with a lower integration level, and the smaller blocks (2, 3) compose the larger blocks (3, 4) larger by one integration level, and integration of the logically separated smallest areas (1) is performed in recurrent manner till the integration covers the whole area of the device for data storing.

2. The device for data storing, according to claim 1, wherein a block (3, 4) with greater, by one, integration level has a memory size equal to a multiple of a size of blocks (2, 3) with smaller, by one, integration level, and the amount of information that is stored in the logically separated smallest area (1).

3. The device for data storing, according to claim 1, wherein a number of the logically separated smallest areas (1) in a block (2) of the minimal integration level is equal a number of bits that can be stored in the logically separated smallest area (1).

4. The device for data storing, according to claim 1, wherein blocks (2, 3, 4) of predetermined size have at least three states and information concerning their state is stored within their area or within the area of blocks with greater, by one, integration level.

5. The device for data storing, according to claim 1, wherein blocks (2, 3, 4) of predetermined size may be free, busy or fragmented.

6. The device for data storing, according to claim 1, wherein the logically separated smallest areas (1) have at least two states.

7. The device for data storing, according to claim 1, wherein the logically separated smallest areas (1) are either free or busy.

8. The device for data storing, according to claim 1, wherein the logically separated smallest areas (1) are the smallest areas of memory, which cannot be subdivided, and their multiplication, and their size depends upon the device for storing data.

9. The device for data storing, according to claim 1, wherein the logically separated smallest areas (1) have the size of 512 bits.

10. The device for data storing, according to claim 1, wherein the blocks (2, 3, 4) of predetermined size do not contain data concerning their state if they are completely busy or free and in that case related information is included in a greater block, with an integration level greater by one.

11. A method for dividing space for data storing with logically separated areas comprising the following step:

creating blocks of predetermined size from a defined number of logically separated smallest areas wherein smaller blocks are combined recurrently into greater blocks till the partition covers the entire area of a device for storing data, and wherein greater blocks with a higher level of combination are a definite multiplication of smaller blocks with a lower level of combination, and the smaller blocks are incorporated into the greater blocks greater by one level than the smaller blocks.

12. The method for dividing space, according to claim 11, wherein a block (3, 4) with greater, by one, integration level has a memory size equal to a multiple of a size of blocks (2, 3) with smaller, by one, integration level, and the amount of information that is stored in the logically separated smallest area (1).

13. The method for dividing space, according to claim 11, wherein a number of the logically separated smallest areas (1) in a block (2) of the minimal integration level is equal a number of bits that can be stored in the logically separated smallest area (1).

14. The method for dividing space, according to claim 11, wherein blocks (2, 3, 4) of predetermined size have at least three states and information concerning theirs state is stored within their area or within the area of blocks with greater, by one, integration level.

15. The method for dividing space, according to claim 11, wherein blocks (2, 3, 4) of predetermined size may be free, busy or fragmented.

16. The method for dividing space, according to claim 11, wherein the logically separated smallest areas (1) have at least two states.

17. The method for dividing space, according to claim 11, wherein the logically separated smallest areas (1) are either free or busy.

18. The method for dividing space, according to claim 11, wherein the logically separated smallest areas (1) are the smallest areas of memory, which cannot be subdivided, and their multiplication, and their size depends upon the device for storing data.

19. The method for dividing space, according to claim 11, wherein the logically separated smallest areas (1) have the size of 512 bits.

20. The method for dividing space, according to claim 11, wherein the blocks (2, 3, 4) of predetermined size do not contain data concerning their state if they are completely busy or free and in that case related information is included in a greater block, with an integration level greater by one.