Scalable storage architecture

• US 20070174580A1
• Filed: 12/07/2006
• Published: 07/26/2007
• Est. Priority Date: 05/09/2003
• Status: Abandoned Application

• Current Assignee: Roberts Abokhair & Mardula
• Original Assignee: Roberts Abokhair & Mardula
• Inventors: Shulga, Nikita
• Application Number:
  US11/636,118
• Publication Number:
  US 20070174580A1
• Time in Patent Office: Days
• US Class Current: 711/170
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: G06F 3/0607 by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0643 Management of files
• CPC Class Codes: G06F 3/0685 Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays

Abstract

The Scalable Storage Architecture SSA system integrates everything necessary for network storage and provides highly scalable and redundant storage space. The SSA comprises integrated and instantaneous back-up for maintaining data integrity in such a way as to make external backup unnecessary. The SSA also provides archiving and Hierarchical Storage Management (HSM) capabilities for storage and retrieval of historic data.

Claims

1. A method for storing data in a storage system comprising:

applying a location algorithm to a unit of data to select a storage location suitable for the data unit;

applying an allocation algorithm to the selected storage location and the data unit to assign the data unit a physical location within the selected storage location;

storing the data unit in the assigned physical location within the selected storage location; and

allowing a user to have one or more pre-defined preferences affecting behavior of the location algorithm.

2. The method of claim 1 wherein metadata concerning results of the two applying steps are stored in an assigned physical location separate from that assigned for the data unit.

3. The method of claim 1 wherein one of the pre-defined preferences relates to speed of the storage location.

4. The method of claim 1 wherein one of the pre-defined preferences relates to monetary cost of the storage location.

5. The method of claim 1 wherein one of the pre-defined preferences relates to capacity utilization of the storage location.

6. The method of claim 1 wherein one of the pre-defined preferences relates to whether the storage location is assigned to the user assigned.

7. The method of claim 1 wherein one of the pre-defined preferences relates to vendor and/or model number of the storage location.

8. The method of claim 1 wherein one of the pre-defined preferences relates to file type of the data unit.

9. The method of claim 1 wherein one of the pre-defined preferences relates to host or host bus adapter of the storage location.

10. The method of claim 1 wherein one of the pre-defined preferences relates to file size of the data unit.

11. The method of claim 1 wherein one of the pre-defined preferences relates to day, date, or time of a request to store the data unit.

12. The method of claim 1 wherein one of the pre-defined preferences relates to whether the storage location is striped.

13. The method of claim 1 wherein one of the pre-defined preferences relates to closest proximity to free space utilization of the storage location.

14. The method of claim 1 wherein one of the pre-defined preferences relates to reliability of the storage location.

15. The method of claim 1 wherein one of the pre-defined preferences relates to ability to store metadata separate from data for the storage location.

18. The method of claim 1 wherein one of the pre-defined preferences relates to speed of the storage location.

19. The method of claim 1 wherein one of the pre-defined preferences relates to monetary cost of the storage location.

20. The method of claim 1 wherein one of the pre-defined preferences relates to capacity utilization of the storage location.

21. The method of claim 1 wherein one of the pre-defined preferences relates to whether the storage location is assigned to the user assigned.

22. The method of claim 1 wherein one of the pre-defined preferences relates to vendor and/or model number of the storage location.

23. The method of claim 1 wherein one of the pre-defined preferences relates to file type of the data unit.

24. The method of claim 1 wherein one of the pre-defined preferences relates to host or host bus adapter of the storage location.

25. The method of claim 1 wherein one of the pre-defined preferences relates to file size of the data unit.

26. The method of claim 1 wherein one of the pre-defined preferences relates to day, date, or time of a request to store the data unit.

27. The method of claim 1 wherein one of the pre-defined preferences relates to whether the storage location is striped.

28. The method of claim 1 wherein one of the pre-defined preferences relates to closest proximity to free space utilization of the storage location.

29. The method of claim 1 wherein one of the pre-defined preferences relates to reliability of the storage location.

30. The method of claim 1 wherein one of the pre-defined preferences relates to ability to store metadata separate from data for the storage location.

16. A method for storing data in a storage system comprising:

applying a location algorithm to a unit of data to select a storage location suitable for the data unit;

applying an allocation algorithm to the selected storage location and the data unit to assign the data unit a physical location within the selected storage location;

storing the data unit in the assigned physical location within the selected storage location; and

training the location algorithm based on user preferences expressed in repeated applications of the method for a plurality of data units.

17. The method of claim 16 wherein metadata concerning results of the two applying steps are stored in an assigned physical location separate from that assigned for the data unit.