Patent Application
20120284239
This invention relates to processing application data for storage in a shared pool of configurable resources. More specifically, the invention relates to evaluating data, quantifying the costs for storing the evaluated data, and selection of both a storage format and storage location based upon evaluation of the application data.
Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computer resources, e.g. networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services, that can be rapidly provisioned and released with minimal management effort or interaction with a provider of service. One of the characteristics of cloud computing infrastructure is that applications can be launched from a plurality of locations and generate data to be stored in one of a plurality of locations within the infrastructure. Several factors drive the decision to store application data in a specific data center within the infrastructure, including availability, user location, disaster awareness, and available facilities.
A storage system provides access to information that is stored on one or more storage devices connected to the storage system. Access to the information is possible by organizing the storage devices into volumes, which logically organize the information stored on the storage devices. The storage system may be further configured to operate according to a client/server model of information delivery to thereby allow many clients to access data containers stored on the system. Each client may request the services of the storage system by issuing file-based protocol messages to the system over the network. A plurality of storage systems may be interconnected to provide a storage system environment configured to service many clients. Each storage system may be configured to service one or more volumes, wherein each volume stores one or more data containers. The relationship between increase storage demand and commodity storage device capabilities is inversely proportional in that as the load of storage increases on the storage system, network bandwidth, storage capabilities and computer power decrease. Accordingly, there is a need to accommodate the burdens of storage devices while taking advantage of the storage space available in the shared pool of resources.
This invention comprises a method, system, and article for optimizing data stored in a shared pool of resources.
In one aspect of the invention, a method is provided for processing application data for storage. The aspect of processing the data employs a real-time analytical model for selecting a data format storage option and a storage location for the data. One of the goals of the data evaluation is to minimize an overall cost associated with storage of the data. There are different formats in which data can be stored, including compressed and non-compressed data. Selection of a data format storage option includes determining whether to compress said data. If it is determined that data compression will not take place prior to storage, the data is sent to a first selected location as raw data. However, if it is determined that data compression will take place prior to storage, a data compression technique that satisfies the analytical model evaluation is selected, and following compression, the compressed data is sent to a second selected storage location. The first and second selected storage locations are a part of a shared pool of resources, and may be different storage locations in the shared pool, or the same storage location in the shared pool.
In another aspect of the invention, a system is provided with a client machine in communication with application data. An evaluation manager is provided to process the application data, which includes use of a real-time analytical model for selection of a data format storage option and a storage location for the data. The processing performed by the evaluation manager minimizes an overall cost associated with storage of the data. A compression manager is provided in the system in communication with the evaluation manager. The compression manager makes a determination on whether to compress data. More specifically, if the compression manager determines that compression is unwarranted, the compression manager sends the data to a first selected location. At the same time, if the compression manager determines that compression is warranted, the compression manager determines an appropriate compression technique that satisfies the analytical model evaluation. Following compression, the compression manager sends the compressed data to a second selected storage location. The first and second selected storage locations are a part of a shared pool of resources, and may be different storage locations in the shared pool or the same storage location in the shared pool.
In yet another aspect of the invention, a computer program product is provided with a computer readable storage medium having embodied computer readable program code to process data. More specifically, computer readable program code employs a real-time analytical model for selection of a data format storage option and a storage location for the data. The goal of the data storage format and selection is to minimize an overall cost associated with storage of the data. Computer readable program code is also provided to determine whether to compress the data. If compression is unwarranted, the program code sends the data to a first selected storage location. Similarly, if compression is warranted, the program code both determines an appropriate compression technique that satisfies the analytical model and sends the compressed data to a second selected storage location. The first and second selected storage locations are a part of a shared pool of resources, and they may be different storage locations in the shared pool or the same storage location in the shared pool.
Other features and advantages of this invention will become apparent from the following detailed description of the presently preferred embodiment of the invention, taken in conjunction with the accompanying drawings.
The drawings referenced herein form a part of the specification. Features shown in the drawings are meant as illustrative of only some embodiments of the invention, and not of all embodiments of the invention unless otherwise explicitly indicated. Implications to the contrary are otherwise not to be made.
It will be readily understood that the components of the present invention, as generally described and illustrated in the Figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the apparatus, system, and method of the present invention, as presented in the Figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention.
The functional units described in this specification have been labeled as managers. A manager may be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, or the like. The manager may also be implemented in software for processing by various types of processors. An identified manager of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions which may, for instance, be organized as an object, procedure, function, or other construct. Nevertheless, the executables of an identified manager need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the manager and achieve the stated purpose of the manager.
Indeed, a manager of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different applications, and across several memory devices. Similarly, operational data may be identified and illustrated herein within the manager, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, as electronic signals on a system or network.
Reference throughout this specification to “a select embodiment,” “one embodiment,” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases “a select embodiment,” “in one embodiment,” or “in an embodiment” in various places throughout this specification are not necessarily referring to the same embodiment.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided, such as examples of managers, etc., to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or with other methods, components, materials, etc. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.
The illustrated embodiments of the invention will be best understood by reference to the drawings, wherein like parts are designated by like numerals throughout. The following description is intended only by way of example, and simply illustrates certain selected embodiments of devices, systems, and processes that are consistent with the invention as claimed herein.
A cloud computing environment is service oriented with a focus on statelessness, low coupling, modularity, and semantic interoperability. At the heart of cloud computing is an infrastructure comprising a network of interconnected nodes. Referring now to
Computer system/server (12) may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server (12) may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.
As shown in
System memory (28) can include computer system readable media in the form of volatile memory, such as random access memory (RAM) (30) and/or cache memory (32). Computer system/server (12) may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system (34) can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus (18) by one or more data media interfaces. As will be further depicted and described below, memory (28) may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
Program/utility (40), having a set (at least one) of program modules (42), may be stored in memory (28) by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating systems, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules (42) generally carry out the functions and/or methodologies of embodiments of the invention as described herein.
Computer system/server (12) may also communicate with one or more external devices (14), such as a keyboard, a pointing device, a display (24), etc.; one or more devices that enable a user to interact with computer system/server (12); and/or any devices (e.g., network card, modem, etc.) that enable computer system/server (12) to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces (22). Still yet, computer system/server (12) can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter (20). As depicted, network adapter (20) communicates with the other components of computer system/server (12) via bus (18). It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server (12). Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.
Referring now to
Referring now to
Virtualization layer (62) provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers; virtual storage; virtual networks, including virtual private networks; virtual applications and operating systems; and virtual clients.
In one example, management layer (64) may provide the following functions: resource provisioning, metering and pricing, user portal, service level management, and SLA planning and fulfillment. The functions are described below. Resource provisioning provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and pricing provides cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may comprise application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal provides access to the cloud computing environment for consumers and system administrators. Service level management provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment provides pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA.
Workloads layer (66) provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer includes, but is not limited to: mapping and navigation; software development and lifecycle management; virtual classroom education delivery; data analytics processing; transaction processing; and maintenance of a data structure to support efficient and effective data compression and storage within the cloud computing environment.
As the demand for data storage in a shared pool of configurable resources increases, there is a need to devise a shared pool that adapts to demand while minimizing storage costs as well as client costs. Smart data compression identifies compression opportunities that minimize storage footprint and network bandwidth, at the cost of compute cycles. Data compression may take place at different locations based upon the identified compression opportunities. For example, compression may take place local to the client with compressed data sent to the shared pool for storage. Similarly, compression may take place local to the shared pool, with non-compressed data sent over the network. Or, a partial compression may take place local to the client with the remainder of the compression to take place local to the shared pool. Accordingly, different compression and storage opportunities are available based upon identified needs of the subject data.
Following receipt of the data, the server evaluates one or more initial settings on a user profile associated with the client (406) to transparently determine an appropriate storage format and location for the data. More specifically, the user profile may include settings and specifications for the data that provides guidance to the server for storage format and location. For example, the user profile may provide an indication of frequency of data access, a suggested compression technique, etc. Accordingly, the communication between the client and the shared pool is transparently managed by a server and/or server proxy.
Upon evaluation of the user profile, the server determines if the client has provided instructions for a requested compression technique (408). A positive response to the determination at step (408) is followed by the server compressing the data with the technique suggested in the client profile (410). Conversely, a negative response to the determination at step (408) is followed by the server evaluating the received data (412) to determine whether to compress the data (418), and if the determination is to compress the data an appropriate compression technique and location (412). More specifically, following steps (410) or (420) when it is determined that the data should be compressed, either the server in receipt of the raw data compresses the data with the determined compression technique. However, if a compression technique is not selected by the client or the server, the raw data is sent to another server in the pool of shared resources for compression and/or storage (416). Accordingly, as demonstrated, the data received by the server may be compressed by a client directed technique, a server directed technique, or it may remain in raw format.
If at step (418) it is determined that the data should not be compressed, the data remains in a raw data format for storage. Following compression of the data at steps (410) or (420) or the data remaining in raw format at step (416), the server with the subject data then assigns and sends the data to an appropriate data storage location in the shared pool (422). More specifically, at step (422) the server assigns an appropriate location for the data based upon several factors, including but not limited to, frequency of access of the data. Accordingly, optimization of the data shown herein is processed automatically and transparently on the server side with client instructions limited to a client side profile.
As shown in
If the response to the determination at step (506) is positive, a selected compression technique is applied locally to the data (508). More specifically, the compression of the data is processed local to the client machine. Following completion of the data compression, the client machine sends the compressed data for storage in the shared pool (510). By the client machine compressing the data, I/O cost to the shared pool is reduced in comparison to transmission of raw (non-compressed) data. Following receipt of the data at step (510), a server (or shared pool interface) determines if the data compression applied by the client is completed (512). In one embodiment, the client may have limited computer power to process a complete compression of the subject data. A positive response to the determination at step (512) is an indication that the data compression is completed and followed by the server (or shared pool interface) sending the data to a data storage location in the shared pool (514). In one embodiment, the client may select the storage location within the shared pool. If no instructions are present, then the server selects the storage location within the pool. Accordingly, as shown herein data compression may take place local to the client thereby reducing the footprint of data communicated over the network from the client to the shared pool.
In limited circumstances the client may either not elect to compress the data, or the client may not have the computer power to complete the data compression. If at step (512) it is determined that the compression is not completed, the server (or shared pool interface) may complete the data compression (516) followed by a return to step (514). Although the I/O costs across the network is not as efficient as with client side compression, the further processing by the server further reduces the footprint of the data, thereby reducing storage cost. However, if at step (506) it is determined that the compression of the data will not take place local to the client machine, the client sends the data to the shared pool (518) and then proceeds to step (510) for compression evaluation within the shared pool. In one embodiment, following steps (506) or (508), the server (or shared pool interface) determines an appropriate data storage location within the shared pool, or the client specifies an appropriate storage location within the shared pool. Regardless of whether the client, server, or shared pool interface determines an appropriate storage location, compression of the data local to the client may take place in an effort to reduce I/O costs to the shared pool.
As described in
In order to optimize how data is stored in the shared pool, the overall system costs may be estimated based upon prior data storage requests.
For a new data storage transaction, the data structure may be consulted and employed as a tool to determine an appropriate data compression technique, storage location, etc. as a part of evaluation of the data. One focus of the evaluation is to reduce costs associated with data storage. Accordingly, by quantifying a cost component of one or more stored profiles, the evaluation of data may be based upon historical knowledge.
When a new set of data is evaluated for processing (608), the data structure is consulted as part of the real-time analytical model for selection of a data storage format and location (610). More specifically, the data maintained in the data structure profiles prior data storage and data transfer techniques. From this data, cost components of storing and retrieving data from storage may be quantified and leveraged to minimize the cost for storage of future data transactions. The following is a formula employed for calculating the minimum cost for data compression and storage based upon data obtained from the data structure:
where the costt is the overall system cost taken over all users. The cost is minimized by calculating an optimal storage scheme for each individual client, u, the data type, Du, time, T, access pattern for the client, Au, and a client specified profile, Pm. In one embodiment, the client specified profile is used to specify the domain of possible compression and location alternatives, as well as other criteria to guide the optimization process. The cost for the individual client, costu, is the minimum cost per clientu given three possible forms of data optimization, including optiona, optionb, and optionc, although the invention should not be limited to an embodiment of three optimization options. In one embodiment, the quantity of optimization options may be greater or less than the quantity illustrated herein. Each of the three options employs three factors, including compression, transfer and storage. The compression factor corresponds to local compression. The transfer factor, Transfer, corresponds to costs due to the transfer of data from the client to the shared pool. The store factor corresponds to storing data, and includes costs of data transfer between shared pools.
As shown, each of the options, optiona, optionb, and optionc are based upon different factors. The options are represented as follows:
Optiona=compressl(Du,Pm)+Transfer(D′u)+store(D′u)
Optionb=compressl(i Du)+Transfer(D′u)+compressr(D′u,Pm)+store(D″u,Pm)
Optionc=compressr(Du,Pm)+Transfer(Du)+store(D′u)
The cost, costa, is the minimum of Optiona, Optionb, and Optionc, as defined above. The transfer, compress, and store values are obtained from the data structure, as they are based upon historical data of prior data compressed and/or stored. More specifically, the compressl value corresponds to local compression, the compressr value corresponds to remote compressions, transfer corresponds to cost due to transfer of data between the client and the shared pool, and store corresponds to storing data in a storage device and takes into account cost of data transfer within the shared pool. In one embodiment, a cost of de-compression is maintained in the data structure for data that is fetched from the shared pool and returned to a requesting client. There is a cost savings for reducing the size of the footprint. However, for data that is read repeatedly, the cost of decompressing the data may offset the cost savings due to the reduced footprint. Accordingly, based upon the data maintained in the data structure and the associated calculations, cost is estimated based upon data type and access pattern in order to optimally store data while mitigating storage costs.
Based upon the costs analysis from data maintained in the data structure, a recommended compression technique (612) and storage location (614) are provided. More specifically, as demonstrated above, the data from the data structure is employed to determine a minimal cost estimate associated with storage of the data. The minimal costs estimate includes compression techniques, estimated footprint for storage, costs for decompression responsive to a read request, etc. In some circumstances a high compression ratio may reduce the footprint of the data, but if the data is considered to be frequently read, there may be a cost burden of decompression. Accordingly, the cost estimate accounts for historical data compression and usage in an effort to predict an optimal data compression technique and storage location.
As demonstrated in the flow charts of
Each of the data centers in the system is provided with at least one server in communication with data storage. More specifically, the first data center (710) is provided with a server (720) having a processing unit (722), in communication with memory (724) across a bus (726), and in communication with first local storage (728); the second data center (730) is provided with a server (740) having a processing unit (742), in communication with memory (744) across a bus (746), and in communication with second local storage (748); and the third data center (750) is provided with a server (760) having a processing unit (762), in communication with memory (764) across a bus (766), and in communication with third local storage (768). Both server (720) and server (740) may separately communicate with the third local storage (768) across a network connection (705).
As described above, there are different embodiments to support dynamic processing of application data. In one embodiment, a client machine (770) is provided in communication with at least one of the data centers. More specifically, the client machine (770) is provided with a processing unit (772), in communication with memory (774) across a bus (776). An application (790) processes read and write transactions local to the client machine (770). Following a write transaction by the application, data is stored locally and/or remotely. In one embodiment, an evaluation manager (780) is provided local to the client machine (770) to process application data. More specifically, the evaluation manager (780) employs a real-time analytical model for selection of both a data format option and a storage location for the data. The goal of the evaluation manager is to minimize overall costs associated with storage of the data.
A compression manager (782) is provided in communication with the evaluation manager (780). The compression manager (782) determines whether or not the data should be compressed, as well as an appropriate storage location for the data. If the compression manager (782) determines that the data should not be compressed, the compression manager (782) selects an appropriate data storage location and sends the data to the location. On the other hand, if the compression manager (782) determines that the data should be compressed, the compression manager determines an appropriate compression technique that satisfies the analytical model employed by the evaluation manager (780), compresses the data, and then sends the data to a select storage location. As shown herein, there is a plurality of data storage locations. In one embodiment, the data storage locations are located within the shared pool of resources as exemplified by the first, second, and third data centers (710), (730), and (750), respectively, and their respective data storage. Accordingly, the evaluation and compression managers (780) and (782), respectively, may be local to the client (770), with the data processing and/or compression taking place local to the client (770).
The uncompressed data and the compressed data may be stored in different storage locations or the same data location within the shared pool. More specifically, as shown, each of the first, second, and third data centers each have data storage, and the uncompressed and compressed data may be stored in the data storage of the same data center or different data centers. Accordingly, as shown and described above, the data compression may take place local to the client machine (770).
However, there are other configurations of the system available. More specifically, the client (770) may not be provided with the infrastructure to perform data compression, or in one embodiment a complete data compression.
Server (810) is provided with a processing unit (812) in communication with memory (814) across a bus (816). Each of the data centers in the system is provided with at least one server in communication with data storage. More specifically, the first data center (830) is provided with a server (840) having a processing unit (842), in communication with memory (844) across a bus (846), and in communication with second local storage (848), and the second data center (850) is provided with a server (860) having a processing unit (862), in communication with memory (864) across a bus (866), and in communication with third local storage (868). Both server (820) and server (840) may separately communicate with the server (810) across a network connection (805).
As described above, there are different embodiments to support dynamic processing of application data. A client machine (870) is provided in communication with shared pool (890). The client machine (870) is provided with a processing unit (872), in communication with memory (874) across a bus (876). An application (880) processes read and write transactions local to the client machine (870). Following a write transaction by the application, data is stored locally and/or remotely. In one embodiment, the client (870) is in communication with the shared pool (890), and specifically with the server (810) in the shared pool, with the server (810) directing data evaluation, compression, and storage. More specifically, the evaluation manager (882) and compression manager (884), with the functionality described in
In one embodiment, the client and a server within the shared pool may share the burden and responsibility of data compression. More specifically, the client may not be provided with the infrastructure to perform some of the data compression, with a remaining portion of the data compression to take place in a server within the shared pool.
Server (910) is provided with a processing unit (912) in communication with memory (914) across a bus (916). Each of the data centers in the system is provided with at least one server in communication with data storage. More specifically, the first data center (930) is provided with a server (940) having a processing unit (942), in communication with memory (944) across a bus (946), and in communication with second local storage (948), and the second data center (950) is provided with a server (960) having a processing unit (962), in communication with memory (964) across a bus (966), and in communication with third local storage (968). Both server (940) and server (960) may separately communicate with the server (910) across a network connection (905).
As described above, there are different embodiments to support dynamic processing of application data. A client machine (970) is provided in communication with shared pool (990). The client machine (970) is provided with a processing unit (972), in communication with memory (974) across a bus (976). Evaluation and compression managers (980) and (982), respectively, and as described above in
In addition to the managers described above, a profile manager (988) may be provided in communication with the evaluation and compression managers (980) and (982), respectively, and (984) and (986), respectively. The profile manager (988) profiles each prior data format selection and the storage location of the data within the shared pool (990). More specifically, the profile manager (988) quantifies a cost component to the profiled data and stores the profile in a data structure (992). In one embodiment, the data structure (992) is stored within the shared pool (990) and local to the server (910), although the invention should not be limited to this location for storage of the data structure. By maintaining the profile date, the evaluation manager(s) (980) and (984) may utilize the quantified cost component for the stored profile(s) as a factor in evaluation of the processed data, and for selection of a storage format and location. The quantified cost component may include the following: a compression ratio of the data, storage location of the data, and retrieval costs of stored data. It should be noted that in assessing costs for storage or retrieval of data, the overall costs includes cost of transferring the data between the client (970) and the shared pool (990), as well as a cost of compressing and decompressing the data. Accordingly, the overall costs should be assessed for determination of compression and storage of the data in response to a write transaction, as well as de-compression of the data in response to a read transaction.
As identified above, the evaluation, compression and profile managers are shown residing in memory of the machine in which they reside. As described above, in different embodiment the managers may reside on different machines in the system. In one embodiment, the evaluation, compression and profile managers may reside as hardware tools external to memory of the machine in which they reside, or they may be implemented as a combination of hardware and software. Similarly, in one embodiment, the managers may be combined into a single functional item that incorporates the functionality of the separate items. As shown herein, each of the manager(s) are shown local to one machine. However, in one embodiment they may be collectively or individually distributed across the shared pool of configurable computer resources and function as a unit to manage dynamic data evaluation and storage. Accordingly, the managers may be implemented as software tools, hardware tools, or a combination of software and hardware tools.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Referring now to
In alternative embodiments, the secondary memory (1012) may include other similar means for allowing computer programs or other instructions to be loaded into the computer system. Such means may include, for example, a removable storage unit (1020) and an interface (1022). Examples of such means may include a program package and package interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units (1020) and interfaces (1022) which allow software and data to be transferred from the removable storage unit (1020) to the computer system.
The computer system may also include a communications interface (1024). Communications interface (1024) allows software and data to be transferred between the computer system and external devices. Examples of communications interface (1024) may include a modem, a network interface (such as an Ethernet card), a communications port, or a PCMCIA slot and card, etc. Software and data transferred via communications interface (1024) are in the form of signals which may be, for example, electronic, electromagnetic, optical, or other signals capable of being received by communications interface (1024). These signals are provided to communications interface (1024) via a communications path (i.e., channel) (1026). This communications path (1026) carries signals and may be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, a radio frequency (RF) link, and/or other communication channels.
In this document, the terms “computer program medium,” “computer usable medium,” and “computer readable medium” are used to generally refer to media such as main memory (1010) and secondary memory (1012), removable storage drive (1016), and a hard disk installed in hard disk drive (1014).
Computer programs (also called computer control logic) are stored in main memory (1010) and/or secondary memory (1012). Computer programs may also be received via a communication interface (1024). Such computer programs, when run, enable the computer system to perform the features of the present invention as discussed herein. In particular, the computer programs, when run, enable the processor (1002) to perform the features of the computer system. Accordingly, such computer programs represent controllers of the computer system.
The flowcharts and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowcharts or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
It will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without departing from the spirit and scope of the invention. In particular, the system can be configured with an interface in the shared pool of resources. The interface receives data from the client, assesses the data for compression, and/or directs the data to storage within the shared pool of resources. Accordingly, the scope of protection of this invention is limited only by the following claims and their equivalents.
