System and method for distributing storage controller tasks

• US 20030188045A1
• Filed: 04/13/2000
• Published: 10/02/2003
• Est. Priority Date: 04/13/2000
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Jacobson, Michael B.
• Application Number:
  US09/548,687
• Publication Number:
  US 20030188045A1
• Time in Patent Office: Days
• US Class Current: 710/1
• CPC Class Codes: G06F 2003/0697 device management, e.g. handlers, drivers, I/O schedulers
• CPC Class Codes: G06F 3/0601 Interfaces specially adapted for storage systems
• CPC Class Codes: G06F 9/505 considering the load

Abstract

A data access task distributor receives a request to perform a data access task. The request is received by a first processor, which identifies an appropriate processor to process the request. The first processor processes the request if the first processor is the appropriate processor to process the request. The first processor forwards the request to the appropriate processor if the first processor is not the appropriate processor to process the request. The first processor identifies the appropriate processor by retrieving data from a table that identifies the types of data access tasks handled by each processor.

Claims

1. A method of distributing data access tasks, the method comprising:

receiving a request to perform a data access task, wherein the request is received by a first processor;

the first processor identifying an appropriate processor to process the request;

the first processor processing the request if the first processor is the appropriate processor to process the request; and

the first processor forwarding the request to the appropriate processor if the first processor is not the appropriate processor to process the request.

2. A method as recited in claim 1, wherein identifying the appropriate processor comprises the first processor retrieving data from a table that identifies the types of data access tasks handled by each processor.

3. A method as recited in claim 1, wherein each processor processes a subset of all possible data access tasks.

4. A method as recited in claim 1, wherein the first processor is contained in a storage controller.

5. A method as recited in claim 4, wherein a table that identifies the types of data access tasks handled by each processor is contained in the storage controller.

6. A method as recited in claim 4, wherein the storage controller stores data on multiple storage devices using a data striping process.

7. A method as recited in claim 1, wherein the first processor is contained in a first storage controller and a second processor is contained in a second storage controller, and wherein data access tasks are distributed between the first and second storage controllers.

8. One or more computer-readable memories containing a computer program that is executable by a second processor to perform the method recited in claim 1.

9. A data storage system comprising:

a first array of storage devices;

a second array of storage devices;

a first processor coupled to the first array of storage devices, wherein the first processor processes data access tasks associated with the first array of storage devices; and

a second processor coupled to the first processor and coupled to the second array of storage devices, wherein the second processor processes data access tasks associated with the second array of storage devices, and wherein the second processor is aware of data access tasks processed by the first processor.

10. A data storage system as recited in claim 9, wherein the first processor is aware of data access tasks processed by the second processor.

11. A data storage system as recited in claim 9, wherein the first and second processors store data on the first and second arrays of storage devices using a data striping process.

12. A data storage system as recited in claim 9, wherein the first and second arrays of storage devices are redundant arrays of inexpensive devices.

13. A data storage system as recited in claim 9, wherein the second processor determines the appropriate processor to process a data access task based on knowledge of data access tasks processed by the first processor and knowledge of data access tasks processed by the second processor.

14. A data storage system as recited in claim 9, wherein the first and second processors are coupled to a host system to receive requests to perform data access tasks.

15. A data storage system as recited in claim 9, wherein the first processor is contained in a first storage controller and the second processor is contained in a second storage controller, and wherein data access tasks are distributed between the first and second storage controllers.

16. A method of distributing data access tasks to multiple redundancy groups, the method comprising:

receiving a request to perform a data access task from a host, wherein the host is unaware of the multiple redundancy groups, and wherein the request is received by a first processor;

the first processor identifying an appropriate processor to process the request based on data contained in a table indicating the types of transactions handled by a plurality of processors;

the first processor processing the request if the first processor is the appropriate processor to process the request; and

the first processor forwarding the request to an appropriate processor if the first processor is not the appropriate processor to process the request.

17. A method as recited in claim 16, wherein each processor processes a subset of all possible data access tasks.

18. A method as recited in claim 16, wherein each processor is associated with at least one redundancy group.

19. A method as recited in claim 16, wherein the first processor stores data on a storage device using a data striping process.

20. A method as recited in claim 16, wherein each redundancy group is a redundant array of inexpensive devices.