SIMULTANEOUS DATA BACKUP IN A COMPUTER SYSTEM

• US 20110047342A1
• Filed: 08/31/2010
• Published: 02/24/2011
• Est. Priority Date: 10/18/2002
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Scheid, William BJ.
• Granted Patent: US 8,200,801 B2
• Time in Patent Office: Days
• US Class Current: 711/162
• CPC Class Codes: G06F 3/0613 in relation to throughput
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

A data processing system using a client-server configuration includes a method and apparatus for simultaneously generating multiple copies of data sets in multiple storage pools. Simultaneous copies of data sets may be made for storage pools having LAN-free paths in addition to storage pools having only access from a LAN path.

Claims

1-11. -11. (canceled)

12. In a data processing system, a method for creating multiple copies of a data set in storage pools having multiple destinations, comprising:

storing copies of the data set in locally attached storage pools;

storing copies of the data set in storage pools connected by storage area networks;

receiving a request in a server from a client storage agent to set up a storage session;

creating a session in said server to monitor the activities of a copy operation;

establishing the location of copy storage pools;

obtaining mount points for each of volumes in said copy storage pools;

reporting the results of the storage session setup to said storage agent;

transferring the data set once from said client to said server; and

,

storing copies of the data set in said copy storage pools after the setup is complete.