(51) Int Cl.: G06F 11/14 ( )

Größe: px
Ab Seite anzeigen:

Download "(51) Int Cl.: G06F 11/14 (2006.01)"

Transkript

1 (19) TEPZZ 7 _B_T (11) EP B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: Bulletin 12/1 (1) Int Cl.: G06F 11/14 (06.01) (21) Application number: (22) Date of filing: (4) Real time backup storage node assignment Sicherheitsspeicherknotenzuweisung in Echtzeit Affectation de noeuds de stockage de sauvegarde en temps réel (84) Designated Contracting States: AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR () Priority: US 1 P US (43) Date of publication of application: Bulletin 11/ (73) Proprietor: Autonomy, Inc. San Francisco, CA 94 (US) (72) Inventors: Bryant, Michael S. Bellingham, MA 019 (US) Ficara, Joseph Shrewsbury, MA 014 (US) Boucher, Michael Robert Shrewsbury, MA 014 (US) (74) Representative: Flutter, Paula et al EIP Fairfax House 1 Fulwood Place London WC1V 6HU (GB) (6) References cited: EP-A WO-A1-04/02470 US-A US-A EP B1 Note: Within nine months of the publication of the mention of the grant of the European patent in the European Patent Bulletin, any person may give notice to the European Patent Office of opposition to that patent, in accordance with the Implementing Regulations. Notice of opposition shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention). Printed by Jouve, 7001 PARIS (FR)

2 Description CROSS REFERENCE TO RELATED APPLICATIONS [0001] This Patent Application is a Utility Application claiming the benefit of U.S. Provisional Application No. 61/3,01 filed on April 1,, entitled, "REAL TIME BACKUP STORAGE NODE ASSIGNMENT". BACKGROUND 1 [0002] A policy refers to a collection of disk files. A policy may also specify, among other things, folders and/or files residing on a server to be protected. [0003] It is common practice to back up policies stored on servers to storage vaults. Typically, such vaults are located remotely from the server storing the policy to be backed up. Further, there are typically multiple vaults from which to choose for the backup. [0004] A simple way to choose a storage node for backing up a policy is to randomly assign the node. For example, a system administrator may have a list of storage vaults from which to choose, and arbitrarily chooses a vault from the list. [000] Document US 07/023 A1 discloses automatic assignment of production servers to appropriate nodes SUMMARY [0006] The random assignment of storage vaults does not facilitate an optimal utilization of storage capacity. Presently, vaults are limited to approximately 60%-6% of its capacity to leave enough space for backup data growth and enough space to perform replication and rotation. It is desired to push this capacity as close as possible to 80% to maximize the usage of the existing vaults. [0007] At the same time, other considerations beside raw storage space need to be taken into account in order to control the load placed on the vaults. For example, an "optimal" vault would be filled to approximately 80% capacity, would have less than 0,000 versions stored on it, would have less than 0 backup policies on it, and less than 0% of the policies on the vault would have a continuous schedule, i.e., every 1 minutes. [0008] In contrast to the above-described conventional random assignment of storage vaults, a technique of assigning a storage node from a storage grid to a server is presented as an embodiment of a solution to the problem of using storage resources more efficiently. The storage grid includes multiple storage nodes capable of backing up a policy stored on the server. The technique involves receiving an assignment request which requests assignment of one of the multiple storage nodes of the storage grid to the server to backup the policy stored on the server. The technique further involves performing a storage node assignment operation in an automated manner in response to the assignment request, the storage node assignment operation providing an assignment result identifying a storage node assigned to backup the policy stored on the server, the assignment result being based on an assessment of storage space requirements of the policy and available storage space resources of the storage grid. The technique further involves notifying the server of the assignment result to effectuate backing up of the policy stored on the server by the storage node. [0009] By making the provisioning process more intelligent, existing vault space can be optimized for small to mid range backup policies, and allow newer vaults to accept larger backup policies. [00] Implementations are directed to the following. [0011] Performing the storage node assignment operation in the automated manner in response to the assignment request can include performing a comparison of the storage space requirements of the policy with available storage space resources of a particular storage node to generate the assessment of storage space requirements of the policy and available storage space resources of the storage grid. [0012] The storage space requirements of the policy can include a current amount of storage space currently occupied by the policy on the server. In this case, the available storage space resources of the particular storage node would include a current amount of free storage space currently available on the particular storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would include (i) multiplying the current amount of storage space currently occupied by the policy on the server by a growth rate factor to generate a future amount of storage space projected to be occupied by the policy on the server at a future point in time, and (ii) comparing the future amount of storage space projected to be occupied by the policy on the server to the current amount of free storage space currently available on the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [0013] The storage space requirements of the policy can include a total amount of storage space currently available to the policy on the server. In this case, the available storage space resources of the particular storage node would include a current amount of free storage space currently available on the particular storage node and a current amount of allocated storage space on the particular storage node. Also, comparing the storage space requirements of the policy 2

3 with available storage space resources of the particular storage node would include (i) subtracting the current amount of allocated storage space on the particular storage node from the current amount of free storage space currently available on the particular storage node to provide an amount of non-allocated storage space on the particular storage node, and (ii) comparing the total amount of storage space currently available to the policy on the server with the amount of non-allocated storage space on the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [0014] The storage space requirements of the policy can further include a backup frequency. In this case, the available storage space resources of the particular storage node would further include a current number of versions associated with the particular storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would further include (i) increasing the current number of versions by a particular number of versions based on the backup frequency to provide a potential number of versions, and (ii) comparing the potential number of versions to a predefined maximum number of versions permitted for the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [001] The storage space requirements of the policy can further include a backup type setting, the backup type setting identifying one of a "continuous" backup type in which a policy backup operation is to be performed every 1 minutes and a "scheduled" backup type in which a policy backup operation is to be performed at user-specified intervals. In this case, the available storage space resources of the particular storage node would further include a current number of "continuous" backup type policies assigned to the storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would further include, only when the backup type setting identifies the "continuous" backup type, (i) incrementing the current number of "continuous" backup type policies currently assigned to the particular storage node to provide a potential number "continuous" backup type policies assigned to the particular storage node, and (ii) comparing the potential number of "continuous" backup type policies assigned to the storage node to a predefined maximum number of "continuous" backup type policies permitted for the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [0016] The storage space requirements of the policy can further include a load balance setting, the load balance setting identifying whether multiple policies on the server are permitted to be backed up to a same storage node. In this case, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would further include, when the load balance setting identifies that multiple policies on the server are not permitted to be backed up to the same storage node, detecting whether the particular storage node is already assigned to backup another policy stored on the server to determine whether to assign the particular storage node to backup the policy stored on the server. [0017] In the context of a method embodiment, the method can further include, prior to comparing the storage space requirements of the policy with the available storage space resources of the particular storage node, setting the growth rate factor to be a value which increases the current amount of storage space currently occupied by the policy on the server by a predefined percentage to provide the future amount of storage space projected to be occupied by the policy on the server at the future point in time. [0018] The method can further include, after assigning the particular storage node to backup the policy stored on the server, adjusting the available storage space resources of the particular storage node to account for assignment of the particular storage node to backup the policy stored on the server. [0019] The method can further include, prior to receiving the assignment request, establishing a storage grid database which stores storage node entries, each storage node entry (i) corresponding to a storage node of the storage grid, (ii) identifying currently available storage space resources for that storage node, and (iii) imposing assignment restrictions for that storage node. In this case, the method would further include dynamically updating the storage node entries of the storage grid database to account for new storage node assignments. [00] A further embodiment to the stated problem is an electronic apparatus to assign a storage node from a storage grid to a server. The storage grid includes multiple storage nodes capable of backing up a policy stored on the server. The electronic apparatus includes a network interface. The electronic apparatus also includes a control circuit coupled to the network interface. The control circuit is constructed and arranged to receive, through the network interface, an assignment request which requests assignment of one of the multiple storage nodes of the storage grid to the server to backup the policy stored on the server. The control circuit is also constructed and arranged to perform a storage node assignment operation in an automated manner in response to the assignment request, the storage node assignment operation providing an assignment result identifying a storage node assigned to backup the policy stored on the server, the assignment result being based on an assessment of storage space requirements of the policy and available storage space resources of the storage grid. The control circuit is further constructed and arranged to notify the server, through the network interface, of the assignment result to effectuate backing up of the policy stored on the server by the storage node. [0021] Implementations are directed to the following. 3

4 [0022] The control circuit, when performing the storage node assignment operation in the automated manner in response to the assignment request, can be constructed and arranged to perform a comparison of the storage space requirements of the policy with available storage space resources of a particular storage node to generate the assessment of storage space requirements of the policy and available storage space resources of the storage grid. [0023] The storage space requirements of the policy can include a total amount of storage space currently available to the policy on the server. In this case, the available storage space resources of the particular storage node would include a current amount of free storage space currently available on the particular storage node and a current amount of allocated storage space on the particular storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would include (i) subtracting the current amount of allocated storage space on the particular storage node from the current amount of free storage space currently available on the particular storage node to provide an amount of non-allocated storage space on the particular storage node, and (ii) comparing the total amount of storage space currently available to the policy on the server with the amount of non-allocated storage space on the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [0024] The storage space requirements of the policy can include a current amount of storage space currently occupied by the policy on the server. In this case, the available storage space resources of the particular storage node would include a current amount of free storage space currently available on the particular storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would include (i) multiplying the current amount of storage space currently occupied by the policy on the server by a growth rate factor to generate a future amount of storage space projected to be occupied by the policy on the server at a future point in time, and (ii) comparing the future amount of storage space projected to be occupied by the policy on the server to the current amount of free storage space currently available on the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [002] The control circuit can be constructed and arranged to, after assigning the particular storage node to backup the policy stored on the server, adjust the available storage space resources of the particular storage node to account for assignment of the particular storage node to backup the policy stored on the server. [0026] A further embodiment to the stated problem is computer program product which includes code which, when executed by a computer, causes the computer to assign a storage node from a storage grid to a server. The storage grid includes multiple storage nodes capable of backing up a policy stored on the server. The code includes instructions to receive, through the network interface, an assignment request which requests assignment of one of the multiple storage nodes of the storage grid to the server to backup the policy stored on the server. The code also includes instructions to perform a storage node assignment operation in an automated manner in response to the assignment request, the storage node assignment operation providing an assignment result identifying a storage node assigned to backup the policy stored on the server, the assignment result being based on an assessment of storage space requirements of the policy and available storage space resources of the storage grid. The code further includes instructions to notify the server, through the network interface, of the assignment result to effectuate backing up of the policy stored on the server by the storage node. [0027] Implementations are directed to the following. [0028] The instructions to perform the storage node assignment operation in the automated manner in response to the assignment request can include instructions to perform a comparison of the storage space requirements of the policy with available storage space resources of a particular storage node to generate the assessment of storage space requirements of the policy and available storage space resources of the storage grid. [0029] The storage space requirements of the policy can include a total amount of storage space currently available to the policy on the server. In this case, the available storage space resources of the particular storage node would include a current amount of free storage space currently available on the particular storage node and a current amount of allocated storage space on the particular storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would include (i) subtracting the current amount of allocated storage space on the particular storage node from the current amount of free storage space currently available on the particular storage node to provide an amount of non-allocated storage space on the particular storage node, and (ii) comparing the total amount of storage space currently available to the policy on the server with the amount of non-allocated storage space on the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [00] The storage space requirements of the policy can include a current amount of storage space currently occupied by the policy on the server. In this case, the available storage space resources of the particular storage node would include a current amount of free storage space currently available on the particular storage node. Also, comparing the storage space requirements of the policy with available storage space resources of the particular storage node would include (i) multiplying the current amount of storage space currently occupied by the policy on the server by a growth rate factor to generate a future amount of storage space projected to be occupied by the policy on the server at a future 4

5 point in time, and (ii) comparing the future amount of storage space projected to be occupied by the policy on the server to the current amount of free storage space currently available on the particular storage node to determine whether to assign the particular storage node to backup the policy stored on the server. [0031] The code can further include instructions to adjust the available storage space resources of the particular storage node to account for assignment of the particular storage node to backup the policy stored on the server after the particular storage node is assigned to backup the policy stored on the server. [0032] These objects are solved in advantageous manner basically by applying the features laid down in the independent claims 1 and 11. Further enhancements are provided by the subclaims. BRIEF DESCRIPTION OF THE DRAWINGS 1 [0033] The foregoing and other objects, features and advantages will be apparent from the following description of particular embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of various embodiments of the invention. Fig. 1 is a block diagram of an electronic environment suitable for the improved technique of relocating data between source and target chains. Fig. 2 is a block diagram of a provider apparatus. Fig. 3 is a block diagram of a database. Fig. 4 is a block diagram of a table containing an assessment scheme for assigning a storage node to a policy. Fig. is a flow chart of a method for assigning a storage node to a policy DETAILED DESCRIPTION [0034] An improved technique smartly assigns, for backing up a policy (e.g., a collection of files) of a server (i.e., agent), a storage node to the agent based on information from the agent and information from a storage grid of available storage nodes. Such a technique preferably uses real time information and enables greater flexibility in distributing storage load across the storage grid as well as better bandwidth utilization during backups and/or restores. [003] Fig. 1 shows an electronic environment which is suitable for use by the improved technique. The electronic environment includes agents 22, storage nodes 24, a provider apparatus 26, a communications medium 28, and a database system. Agents 22 are connected to storage nodes 24 through communications medium 28. Agent 22 typically resides in a location remote from any of the storage nodes. [0036] The communications medium 28 conveys electronic communications 70 between the various components of the electronic environment. The communications medium 28 is illustrated as a cloud because it is capable of having a variety of topologies including hub-and-spoke, backbone, loop, irregular, a combination of the Internet and LAN(s), combinations thereof, and so on. [0037] Storage nodes 24 (or "vaults") are storage platforms which include a front-end computer and a disk array (e.g., an array of magnetic disk drives). Individual storage nodes are labeled 24(i), where i is an index representing a particular storage node. Storage nodes 24 form a storage grid. At least some storage nodes can be chained together within storage grid to provide storage redundancy, e.g. data mirroring. [0038] Agents 22 have data in the form of one or more policies. A policy specifies, among other things, folders and/or files to be protected, a time interval for protecting new changes and a duration for which the data should be protected. Thus, for each policy, there are typically multiple versions, where the number of versions associated with a policy is determined by the time interval and duration. Also, each policy may further specify that different versions be coalesced into a single version at either a specified time interval or according to another criterion. A similar technique is described, for example, in USSN 12/711,413, entitled "DATA RESTORATION UTILIZING FORWARD AND BACKWARD DELTAS". [0039] The provider apparatus 26 is a specialized device which is constructed and arranged to perform the task of assigning a particular storage node 24 of the storage grid to an agent 22 (e.g., the agent 22(1)) when the agent 22 requests a storage location to backup a policy. As shown in Fig. 2, the provider apparatus 26 includes an electronic interface 27 and an electronic controller 29. In some arrangements, the electronic controller 29 includes a microprocessor and memory which are configured to receive a specialized application from a computer program product 60 through electronic interface 27. When the electronic controller 29 executes the specialized application, the provider apparatus 26 is equipped to robustly and reliably assign storage nodes 24 to the agents 22 for policy backups. [00] Database system is a device configured to store information related to the storage nodes 24. As illustrated in Fig. 3, database system, maintained by provider apparatus 26, stores a database 31. Database 31 is constructed and arranged to store storage node entries, e.g., storage node entries 32, 34, 36, and 38, which correspond to, for example, storage nodes 24(1), 24(2), 24(3), and 24(4), respectively. Each storage node entry contains a collection of

6 storage node information characterizing an ability of each storage node to accept a policy from an agent. [0041] A collection of storage information that is found in, for example, database 31, is illustrated in Fig. 3. The collection of storage node information, for each storage node of the storage grid, includes (a) how many backup policies currently exist on that storage node, (b) a percentage of continuous backup policies vs. scheduled policies residing on that storage node, (c) how many versions exist on that storage node, (d) whether there is another policy being moved to that storage node, (e) how much total storage capacity exists on that storage node, (f) how much available storage capacity exists on that storage node, (g) whether that storage node forms part of a storage chain which mirrors data with another storage node and, if so, whether the storage chain is disabled, and (h) whether new backup policies have already been assigned to that storage node but that are not currently present on that storage node and, if so, what the anticipated storage requirements are for those new backup policies. It should be understood that a continuous backup policy is one that is automatically backed up every, say, 1 minutes. In contrast, a scheduled backup policy is one that is backed up at specific times during the week (i.e., the users specifies when and how often). The collection of storage node information may include other data as well. [0042] During operation, the provider apparatus 26 assigns a storage node 24 (e.g., the node 24(1)) from the storage grid to an agent 22. Along these lines, the controller 29 receives an assignment request from the agent 22 through the electronic interface 27. Additionally, the controller 29 obtains, from the agent 22, an available amount indicating a total available storage space amount on the agent 22, a used amount indicating an amount of storage space consumed by the policy stored on the agent 22, and a policy type indicating a particular type of the policy among multiple types. In some arrangements, the assignment request includes this information. In other arrangements, the controller 29 queries the agent 22 for this information in response to the assignment request. The controller 29 may acquire other data from the agent 22 as well as and is preferably updated in real time. [0043] It should be understood that different policy types may impose different storage requirements. For example, if a policy is a "standard" type, the provider apparatus 26 considers the policy to include traditional files and folders and thus places significance on the agent s storage capacity. [0044] However, if a policy is a "DPM" type, the provider apparatus 26 considers the policy to include a Microsoft Data Protection Manager (DPM) replica. For such a type, data storage is raw disk space and is not reported as part of the agent s storage capacity. In some arrangements, the provider apparatus 26 imposes a default amount of required storage space (e.g., 1TB) for a DPM backup policy. In other arrangements, if an actual amount of storage space is available, the required storage space is based upon the actual amount. [004] It should be understood that the information within the database 31 is updated routinely. In some arrangements, the controller 29 of the provider apparatus 26 (or database 31 itself) polls the storage nodes 24 for current operating status data and updates the storage node information within the database 31 (e.g., periodically, after changes occur within the nodes 24, etc.). In other arrangements, the storage nodes 24 are configured to directly update the storage node information within the database 31 (e.g., periodically, after changes occur within the nodes 24, etc.). In yet other arrangements, the agents 22 or one or more other external devices update the storage node information within the database 31. [0046] Next, in response to the assignment request, the controller 29 selects a particular storage node 24 from the multiple storage nodes 24 of the storage grid based on an assessment that takes into account the following: an available amount of storage space of the particular storage node 24 in the storage grid, an amount of space on agent 22 used by the policy, the policy type, and the collection of storage node information corresponding to the particular storage node. [0047] For example, controller 29 examines the number of versions that exist on the particular storage node 24. This information is available on, for instance, database 31 as illustrated in Fig. 3. Controller 29 then compares this number of versions for the particular storage node 24 to, say, a predefined maximum number of versions permitted to be stored on the particular storage node 24. [0048] In a further example, controller 29 examines the number of continuous backup policies (available, for example, on database 31 as illustrated in Fig. 3) currently stored on the particular storage node 24, and increments the current number of continuous policies to get a potential number of continuous policies to be allocated onto the particular storage node 24. The potential number of continuous policies to be allocated is compared with a predefined maximum number of continuous backup policies permitted for the particular storage node 24. [0049] In a further example, controller 29 examines whether multiple policies on agent 22 are permitted to be backed up by the particular storage node 24. In this regard, a load balancing setting is included in the storage space requirements of the policy. That is, when the load balance setting identifies that multiple policies on agent 22 are not permitted to be backed up to the same storage node, controller 29 detects whether the particular storage node 24 is already assigned to backup another policy stored on agent 22 to determine whether to assign the particular storage node 24 to backup the policy stored on agent 22. [000] In a still further example, controller 29 performs a comparison of the amount of space used by the policy with the available amount of storage space on the particular storage node 24. Because of the dynamic nature of the storage 6

7 space on agent 22 used by a policy, controller 29 preferably makes a projected estimate of storage space requirements for the policy over a period of time in determining whether to allocate space on a particular storage node 24. For example, controller 29 may multiply a current amount of storage occupied by the policy on agent 22 by a growth rate factor to generate the projected estimate. The growth rate factor is typically a value which increases the current amount of storage space occupied by the policy on agent 22 by a predefined percentage (e.g., 1%, 0%, 7%, 0%). [001] Controller 29 would then compare such a projected estimate with the available amount of storage space on the particular storage node 24. For example, controller 29 computes the following quantity: where AvailableVaultDisk is the amount of disk space available on the particular storage node 24 for storage of the policy, TotalVaultDisk is the amount of physical space on the particular storage node 24, Critical Percentage is the percentage of the TotalVaultDisk that is not available to store backup data from any policies, and RentedSpace is the amount of space currently allocated for storage of other policies that have not yet completed a successful backup to the storage device. Controller 29 would compare the quantity AdjustedAvailableVaultSpace with a projected amount of space to be required by the policy on agent 22. [002] In some arrangements, the controller 29 applies a set of algorithms or rules to make the selection. The table illustrated in Fig. 4 shows a particular scheme for assessing whether to assign a particular storage node 24 to a policy stored on agent 22 for backup. In the scheme, the collection of storage node information that is analyzed by controller 29 is quantified according to the table 42 in Fig. 4. A best-fit value is assigned to a particular state representing a violation of a condition, such as exceeding the maximum number of policies. In some arrangements, a storage node having a best-fit value exceeding a predefined value (e.g., 0x3F) is considered unavailable for assignment. [003] The controller 29 then allocates the particular storage node 24 to the agent 22 to backup the policy stored on the agent 22. Once the allocation is made, controller 29 notifies agent 22 of the assignment so that a backup of the policy from agent 22 to storage node 24 may proceed. Storage space resources for the particular node 24 can then be adjusted to account for the new assignment. In some implementations, database 31 is also updated to account for the new assignment. [004] A method 0 of assigning a storage node from a storage grid to an agent is illustrated in Fig.. A storage grid is defined 2 by a set of storage nodes. A request to assign a backup of a policy to a storage node within the storage grid is received 4 by, for example, an electronic controller. An operation of assigning the backup of the policy to a storage node is performed 6 by, say, the controller. Once the operation has been performed and the assignment has been made, the agent is notified 8 of the assignment. Data may then be backed up 9 from the agent to the storage node chosen for the backup. [00] The storage grid is defined 2 to include storage nodes that may, for example, form a storage chain. A set of storage nodes can be chained together to provide redundancy or data mirroring. The storage nodes in the storage grid are connected to, say, an electronic controller and an agent containing a policy to be back up through a communications medium. [006] The controller receives 4 a request from an agent to assign a backup of a policy to a storage node within the storage grid. The request is received 4 over the communications medium, the communications medium connecting the controller with the agent. [007] Once the request is received, the controller then performs 6 the assignment of the backup of the policy to one of the storage nodes within the storage grid. The assignment is based upon an assessment of various state values within both the agent and a particular storage node. The assessment considers both storage space requirements of the policy stored on the agent and available storage space resources of the particular storage node. Details concerning the storage space requirements of the policy and available space on a particular storage node are described above. [008] Once the storage node has been assigned, the controller then notifies 8 the agent of the assignment. The notification takes place through the electronic communications medium connecting the agent and the storage nodes within the storage grid to the controller. [009] Once the agent has been notified of the assignment, the backing up 9 of the policy on the agent to the assigned storage node commences. [0060] Such smart assignment of a storage node 24 to an agent 22 enables efficient utilization of the storage nodes 24 (e.g., when performing backup operations for multiple agents 22 and policies). Additionally, such assignment simplifies the management of the storage grid and is able to occur automatically and in a consistent manner with little or no manual involvement. [0061] While various embodiments of the invention have been particularly shown and described, it will be understood 7

8 1 by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention as defined by the appended claims. [0062] For example, it should be understood that the provider apparatus 26 may reside on a dedicated device. Alternatively, the provider apparatus 26 may form part of a server, a storage node, or another apparatus which performs other operations. [0063] Additionally, it should be understood that each storage node 24 is capable of backing up multiple policies stored on multiple agents 22. Similarly, each agent 22 is capable of storing multiple policies which are backed up on one or more storage nodes 24. [0064] Furthermore, it should be understood that some embodiments are directed to an electronic backup environment which utilizes intelligent backup storage node assignments. Some embodiments are directed to a storage provider infrastructure (e.g., a provider apparatus 26 in combination with a storage grid ) which performs intelligent backup storage node assignments. Some embodiments are directed to an apparatus or device which performs intelligent backup storage node assignments. Some embodiments are directed to a process of performing intelligent backup storage node assignments. Also, some embodiments are directed to a computer program product which enables computer logic to perform intelligent backup storage node assignments. [006] In some arrangements, provider apparatus 26 is implemented by a set of processors or other types of control/ processing circuitry running software. In such arrangements, the software instructions can be delivered to electronic controller 29 in the form of a computer program product 60 (illustrated generally by a diskette icon 60 in Fig. 2) having a computer readable storage medium which stores the instructions in a nonvolatile manner. Examples of suitable computer readable storage media include tangible articles of manufacture and apparatus such as CD-ROM, flash memory, disk memory, tape memory, and the like. 2 Claims 1. A method of assigning a storage node (24) from a storage grid () to a server (22), the storage grid () including multiple storage nodes (24) capable of backing up a policy stored on the server (22), the method comprising: 3 receiving, by electronic circuitry, an assignment request (4) from the server (22) which requests assignment of one of the multiple storage nodes (24) of the storage grid () to the server (22) to backup the policy stored on the server (22); performing, by electronic circuitry, a storage node assignment operation (6) in an automated manner in response to the assignment request, the storage node assignment operation providing an assignment result identifying a storage node (24) assigned to backup the policy stored on the server (22), the assignment result being based on an assessment of storage space requirements of the policy and available storage space resources of the storage grid (); and notifying, by electronic circuitry, the server (22) of the assignment result (8) to effectuate backing up of the policy stored on the server (22) by the storage node (24). 2. A method as in claim 1 wherein performing the storage node assignment operation (6) in the automated manner in response to the assignment request includes: 4 performing a comparison of the storage space requirements of the policy with available storage space resources of a particular storage node (24) to generate the assessment of storage space requirements of the policy and available storage space resources of the storage grid () A method as in claim 2 wherein the storage space requirements of the policy includes a current amount of storage space currently occupied by the policy on the server (22); wherein the available storage space resources of the particular storage node includes a current amount of free storage space currently available on the particular storage node (24); and wherein comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24) includes (i) multiplying the current amount of storage space currently occupied by the policy on the server (22) by a growth rate factor to generate a future amount of storage space projected to be occupied by the policy on the server (22) at a future point in time, and (ii) comparing the future amount of storage space projected to be occupied by the policy on the server (22) to the current amount of free storage space currently available on the particular storage node (24) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22). 8

9 4. A method as in claim 3, further comprising: prior to comparing the storage space requirements of the policy with the available storage space resources of the particular storage node (24), setting the growth rate factor to be a value which increases the current amount of storage space currently occupied by the policy on the server (22) by a predefined percentage to provide the future amount of storage space projected to be occupied by the policy on the server (22) at the future point in time. 1. A method as in claim 3 wherein the storage space requirements of the policy further includes a backup frequency; wherein the available storage space resources of the particular storage node (24) further includes a current number of versions associated with the particular storage node (24); and wherein comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24) further includes (i) increasing the current number of versions by a particular number of versions based on the backup frequency to provide a potential number of versions, and (ii) comparing the potential number of versions to a predefined maximum number of versions permitted for the particular storage node (24) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22) A method as in claim 3 wherein the storage space requirements of the policy further includes a backup type setting, the backup type setting identifying one of a "continuous" backup type in which a policy backup operation is to be performed every 1 minutes and a "scheduled" backup type in which a policy backup operation is to be performed at user-specified intervals; wherein the available storage space resources of the particular storage node (24) further includes a current number of "continuous" backup type policies assigned to the storage node (24); and wherein comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24) further includes, only when the backup type setting identifies the "continuous" backup type, (i) incrementing the current number of "continuous" backup type policies currently assigned to the particular storage node (24) to provide a potential number "continuous" backup type policies assigned to the particular storage node (24), and (ii) comparing the potential number of "continuous" backup type policies assigned to the storage node (24) to a predefined maximum number of "continuous" backup type policies permitted for the particular storage node (24) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22) A method as in claim 3 wherein the storage space requirements of the policy further includes a load balance setting, the load balance setting identifying whether multiple policies on the server (22) are permitted to be backed up to a same storage node (24); and wherein comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24) further includes, when the load balance setting identifies that multiple policies on the server (22) are not permitted to be backed up to the same storage node (24), detecting whether the particular storage node (24) is already assigned to backup another policy stored on the server (22) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22). 8. A method as in claim 3, further comprising: 4 after assigning the particular storage node (24) to backup the policy stored on the server (22), adjusting the available storage space resources of the particular storage node (24) to account for assignment of the particular storage node (24) to backup the policy stored on the server (22). 9. A method as in claim 8 further comprising: 0 prior to receiving the assignment request, establishing a storage grid () database which stores storage node (24) entries, each storage node (24) entry (i) corresponding to a storage node (24) of the storage grid (), (ii) identifying currently available storage space resources for that storage node (24), and (iii) imposing assignment restrictions for that storage node (24); and dynamically updating the storage node (24) entries of the storage grid () database to account for new storage node (24) assignments.. A method as in claim 2 wherein the storage space requirements of the policy includes a total amount of storage space currently available to the policy on the server (22); wherein the available storage space resources of the particular storage node (24) includes a current amount of free 9

10 1 storage space currently available on the particular storage node (24) and a current amount of allocated storage space on the particular storage node (24); and wherein comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24) includes (i) subtracting the current amount of allocated storage space on the particular storage node (24) from the current amount of free storage space currently available on the particular storage node (24) to provide an amount of non-allocated storage space on the particular storage node (24), and (ii) comparing the total amount of storage space currently available to the policy on the server (22) with the amount of non-allocated storage space on the particular storage node (24) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22). 11. An electronic apparatus (26) to assign a storage node (24) from a storage grid () to a server (22), the storage grid () including multiple storage nodes (24) capable of backing up a policy stored on the server (22), the electronic apparatus (26) comprising: a network interface (27); and a control circuit (29) coupled to the network interface (27), the control circuit (29) being constructed and arranged to 2 receive, through the network interface (27), an assignment request (4) from the server (22) which requests assignment of one of the multiple storage nodes (24) of the storage grid () to the server (22) to backup the policy stored on the server (22), perform a storage node assignment operation (6) in an automated manner in response to the assignment request, the storage node assignment operation (6) providing an assignment result identifying a storage node (24) assigned to backup the policy stored on the server (22), the assignment result being based on an assessment of storage space requirements of the policy and available storage space resources of the storage grid (), and notify the server (22), through the network interface (27), of the assignment result (8) to effectuate backing up of the policy stored on the server (22) by the storage node (24). 12. An electronic apparatus (26) as in claim 11 wherein the control circuit (29), when performing the storage node assignment operation (6) in the automated manner in response to the assignment request, is constructed and arranged to: 3 perform a comparison of the storage space requirements of the policy with available storage space resources of a particular storage node (24) to generate the assessment of storage space requirements of the policy and available storage space resources of the storage grid () An electronic apparatus (26) as in claim 12 wherein the storage space requirements of the policy includes a current amount of storage space currently occupied by the policy on the server (22); wherein the available storage space resources of the particular storage node (24) includes a current amount of free storage space currently available on the particular storage node (24); and wherein the control circuit (29), when comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24), is constructed and arranged to (i) multiply the current amount of storage space currently occupied by the policy on the server (22) by a growth rate factor to generate a future amount of storage space projected to be occupied by the policy on the server (22) at a future point in time, and (ii) compare the future amount of storage space projected to be occupied by the policy on the server (22) to the current amount of free storage space currently available on the particular storage node (24) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22) An electronic apparatus (26) as in claim 13 wherein the control circuit (29) is further constructed and arranged to: after assigning the particular storage node (24) to backup the policy stored on the server (22), adjust the available storage space resources of the particular storage node (24) to account for assignment of the particular storage node (24) to backup the policy stored on the server (22). 1. An electronic apparatus (26) as in claim 12 wherein the storage space requirements of the policy includes a total amount of storage space currently available to the policy on the server (22); wherein the available storage space resources of the particular storage node (24) includes a current amount of free

11 storage space currently available on the particular storage node (24) and a current amount of allocated storage space on the particular storage node (24); and wherein the control circuit (29), when comparing the storage space requirements of the policy with available storage space resources of the particular storage node (24), is constructed and arranged to (i) subtract the current amount of allocated storage space on the particular storage node (24) from the current amount of free storage space currently available on the particular storage node (24) to provide an amount of non-allocated storage space on the particular storage node (24), and (ii) compare the total amount of storage space currently available to the policy on the server (22) with the amount of non-allocated storage space on the particular storage node (24) to determine whether to assign the particular storage node (24) to backup the policy stored on the server (22). Patentansprüche 1 1. Verfahren zum Zuweisen eines Speicherknotens (24) aus einem Speichernetz () zu einem Server (22), wobei das Speichernetz () mehrere Speicherknoten (24) umfasst, die geeignet sind, eine auf dem Server (22) gespeicherte Richtlinie zu sichern, wobei das Verfahren aufweist: 2 Empfangen, mittels eines elektronischen Schaltkreises, einer Zuweisungsanfrage (4) von dem Server (22), die die Zuweisung eines der mehreren Speicherknoten (24) des Speichernetzes () zu dem Server (22) anfragt, um die auf dem Server (22) gespeicherte Richtlinie zu sichern; Durchführen, mittels eines elektronischen Schaltkreises, einer Speicherknotenzuweisungsoperation (6) in einer automatisierten Weise in Antwort auf die Zuweisungsanfrage, wobei die Speicherknotenzuweisungsoperation ein Zuweisungsergebnis bereitstellt, das einen zum Sichern der auf dem Server (22) gespeicherten Richtlinie zugewiesenen Speicherknoten (24) aufzeigt, wobei das Zuweisungsergebnis auf einer Beurteilung von Speicherplatzanforderungen der Richtlinie und verfügbaren Speicherplatzressourcen des Speichernetzes () basiert; und Benachrichtigen, mittels eines elektronischen Schaltkreises, des Servers (22) von dem Zuweisungsergebnis (8), um das Sichern der auf dem Server (22) gespeicherten Richtlinie durch den Speicherknoten (24) zu bewirken. 2. Verfahren nach Anspruch 1, wobei das Durchführen der Speicherknotenzuweisungsoperation (6) in der automatisierten Weise in Antwort auf die Zuweisungsanfrage umfasst: 3 Durchführen eines Vergleichs der Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen eines bestimmten Speicherknotens (24), um die Beurteilung der Speicherplatzanforderungen der Richtlinie und verfügbarer Speicherplatzressourcen des Speichernetzes () zu generieren Verfahren nach Anspruch 2, wobei die Speicherplatzanforderungen der Richtlinie eine momentane Menge an Speicherplatz umfasst, die momentan durch die Richtlinie auf dem Server (22) belegt ist; wobei die verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens eine momentane Menge an freiem Speicherplatz umfassen, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist; und wobei das Vergleichen der Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) umfasst (i) Multiplizieren der momentanen Menge an Speicherplatz, die momentan durch die Richtlinie auf dem Server (22) belegt ist, mit einem Wachstumsratenfaktor, um eine zukünftige Menge an Speicherplatz, die projiziert ist, von der Richtlinie auf dem Server (22) zu einem zukünftigen Zeitpunkt belegt zu sein, zu generieren, und (ii) Vergleichen der zukünftigen Menge an Speicherplatz, die projiziert ist, von der Richtlinie auf dem Server (22) belegt zu sein, mit der momentanen Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, um zu bestimmen, ob dem bestimmten Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern. 4. Verfahren nach Anspruch 3, weiterhin aufweisend: vor dem Vergleichen der Speicherplatzanforderungen der Richtlinie mit den verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24), Setzen des Wachstumsratenfaktors auf einen Wert, der die momentane Menge an Speicherplatz, die momentan durch die Richtlinie auf dem Server (22) belegt ist, um einen vorbestimmten Prozentsatz erhöht, um die zukünftige Menge an Speicherplatz bereitzustellen, die projiziert ist von der Richtlinie auf dem Server (22) zu einem zukünftigen Zeitpunkt belegt zu sein. 11

12 . Verfahren nach Anspruch 3, wobei die Speicherplatzanforderungen der Richtlinie weiterhin eine Sicherungsfrequenz umfassen; wobei die verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) weiterhin eine momentane Zahl an dem bestimmten Speicherknoten (24) zugeordneten Versionen umfassen; und wobei das Vergleichen der Speicherplatzanforderungen der Richtlinie mit den verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) weiterhin umfasst (i) Erhöhen der momentanen Zahl an Versionen um eine bestimmte Zahl an Versionen, basierend auf der Sicherungsfrequenz, um eine potenzielle Zahl an Versionen bereitzustellen, und (ii) Vergleichen der potenziellen Zahl an Versionen mit einer vordefinierten, maximalen Zahl an für den bestimmten Speicherknoten (24) zugelassenen Versionen, um zu bestimmen, ob dem bestimmten Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern Verfahren nach Anspruch 3, wobei die Speicherplatzanforderungen der Richtlinie weiterhin eine Sicherungsarteinstellung umfasst, wobei die Sicherungsarteinstellung eine aus einer "kontinuierlichen" Sicherungsart, bei der eine Richtliniensicherungsoperation alle 1 Minuten durchzuführen ist, und einer "geplanten" Sicherungsart, bei der eine Richtliniensicherungsoperation zu benutzerspezifizierten Intervallen durchzuführen ist, aufzeigt; wobei die verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) weiterhin eine momentane Zahl an dem bestimmten Speicherknoten (24) zugewiesenen Richtlinien "kontinuierlicher" Sicherungsart umfasst; und wobei das Vergleichen der Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) weiterhin umfasst, nur falls die Sicherungsarteinstellung die "kontinuierlichen" Sicherungsart aufzeigt, (i) Erhöhen der momentanen Zahl an Richtlinien "kontinuierlicher" Sicherungsart, die momentan dem bestimmten Speicherknoten (24) zugeordnet sind, um eine potenzielle Zahl an Richtlinien "kontinuierlicher" Sicherungsart, die dem bestimmten Speicherknoten (24) zugeordnet sind, bereitzustellen, und (ii) Vergleichen der potenziellen Zahl an Richtlinien "kontinuierlicher" Sicherungsart, die dem Speicherknoten (24) zugeordnet sind, mit einer vordefinierten maximalen Zahl an für den bestimmten Speicherknoten (24) zugelassenen Richtlinien "kontinuierlicher" Sicherungsart, um zu bestimmen, ob dem bestimmten Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern Verfahren nach Anspruch 3, wobei die Speicherplatzanforderungen der Richtlinie weiterhin eine Lastausgleichseinstellung umfassen, wobei die Lastausgleichseinstellung aufzeigt, ob es mehreren Richtlinien auf dem Server (22) zugelassen ist, auf einem gleichen Speicherknoten (24) gesichert zu werden; und wobei das Vergleichen der Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) weiterhin umfasst, wenn die Lastausgleichseinstellung aufzeigt, dass es verschiedene Richtlinien auf dem Server (22) nicht zugelassen wird auf dem gleichen Speicherknoten (24) gesichert zu werden, zu detektieren, ob der bestimmte Speicherknoten (24) bereits zum Sichern einer anderen auf dem Server (22) gespeicherten Richtlinie zugewiesen ist, um zu bestimmen, ob dem bestimmten Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern Verfahren nach Anspruch 3, weiterhin aufweisend: nach dem Zuweisen des bestimmten Speicherknotens (24), die auf dem Server (22) gespeicherte Richtlinie zu sichern, Anpassen der verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24), um die Zuweisung des bestimmten Speicherknoten (24) zum Sichern der auf dem Server (22) gespeicherten Richtlinie zu berücksichtigen. 9. Verfahren nach Anspruch 8, weiterhin aufweisend: 0 vor dem Empfangen der Zuweisungsanfrage, Einrichten einer Datenbank des Speichernetzes (), die Einträge der Speicherknoten (24) speichert, wobei jeder Eintrag der Speicherknoten (24) (i) einem Speicherknoten (24) des Speichernetzes () entspricht, (ii) momentan verfügbare Speicherplatzressourcen für diesen Speicherknoten (24) aufzeigt, und (iii) Zuweisungsbeschränkungen für diesen Speicherknoten (24) erhebt; und dynamisches Aktualisieren der Einträge des Speicherknotens (24) der Datenbank des Speichernetzes (), um neue Zuweisungen der Speicherknoten (24) zu berücksichtigen.. Verfahren nach Anspruch 2, wobei die Speicherplatzanforderungen der Richtlinie eine Gesamtmenge an Speicherplatz, die momentan für die Richtlinie auf dem Server (22) verfügbar ist, umfassen; wobei die verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) eine momentane Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, und eine momentane 12

13 1 Menge an zugeordnetem Speicherplatz auf dem bestimmten Speicherknoten (24) umfasst; und wobei das Vergleichen der Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) umfasst (i) Abziehen der momentanen Menge an zugeordnetem Speicherplatz auf dem bestimmten Speicherknoten (24) von der momentanen Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, um eine Menge an nicht zugeordnetem Speicherplatz auf dem bestimmten Speicherknoten (24) bereitzustellen und (ii) Vergleichen der Gesamtmenge an Speicherplatz, der momentan der Richtlinie auf dem Server (22) verfügbar ist, mit der Menge an nicht zugeordnetem Speicherplatz auf dem bestimmten Speicherknoten (24), um zu bestimmen, ob dem bestimmten Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern. 11. Eine elektronische Vorrichtung (26) zum Zuweisen eines Speicherknotens (24) aus einem Speichernetz () zu einem Server (22), wobei das Speichernetz () mehrere Speicherknoten (24) umfasst, die geeignet sind, eine auf dem Server (22) gespeicherte Richtlinie zu sichern, wobei die elektronische Vorrichtung (26) aufweist: eine Netzwerkschnittstelle (27); und einen Kontrollschaltkreis (29), der an die Netzwerkschnittstelle (27) gekoppelt ist, wobei der Kontrollschaltkreis (29) konstruiert und angeordnet ist zum 2 3 Empfangen, durch die Netzwerkschnittstelle (27), einer Zuweisungsanfrage (4) von dem Server (22), die die Zuweisung eines der mehreren Speicherknoten (24) des Speichernetzes () zu dem Server (22) zum Sichern der auf dem Server (22) gespeicherten Richtlinie anfragt, Durchführen einer Speicherknotenzuweisungsoperation (6) in einer automatisierten Weise in Antwort auf die Zuweisungsanfrage, wobei die Speicherknotenzuweisungsoperation (6) ein Zuweisungsergebnis bereitstellt, das einen Speicherknoten (24), der zum Sichern der auf dem Server (22) gespeicherten Richtlinie zugewiesen ist, aufzeigt, wobei das Zuweisungsergebnis auf einer Beurteilung der Speicherplatzanforderungen der Richtlinie und der verfügbaren Speicherplatzressourcen des Speichernetzes () basiert, und Benachrichtigen des Servers (22), durch die Netzwerkschnittstelle (27), von dem Zuweisungsergebnis (8), um das Sichern der auf dem Server (22) gespeicherten Richtlinie durch den Speicherknoten (24) zu bewirken. 12. Elektronische Vorrichtung (26) nach Anspruch 11, wobei der Kontrollschaltkreis (29), wenn die Speicherknotenzuweisungsoperation (6) in der automatisierten Weise in Antwort auf die Zuweisungsanfrage durchgeführt wird, konstruiert und angeordnet ist zum: Durchführen eines Vergleichs der Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen eines bestimmten Speicherknotens (24), um die Beurteilung der Speicherplatzanforderungen der Richtlinie und der verfügbaren Speicherplatzressourcen des Speichernetzes () zu generieren Elektronische Vorrichtung nach Anspruch 12, wobei die Speicherplatzanforderungen der Richtlinie eine momentane Menge an Speicherplatz, die momentan von der Richtlinie auf dem Server (22) belegt ist, umfasst; wobei die verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) die momentane Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, umfasst; und wobei der Kontrollschaltkreis (29), wenn er die Speicherplatzanforderungen der Richtlinie mit den verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) vergleicht, konstruiert und angeordnet ist zum (i) Multiplizieren der momentanen Menge an Speicherplatz, die momentan von der Richtlinie auf dem Server (22) belegt ist, mit einem Wachstumsratenfaktor, um eine zukünftige Menge an Speicherplatz, die projiziert ist von der Richtlinie auf dem Server (22) zu einem zukünftigen Zeitpunkt belegt zu sein, zu generieren und (ii) Vergleichen der zukünftigen Menge an Speicherplatz, die projiziert ist, von der Richtlinie auf dem Server (22) belegt zu sein, mit der momentanen Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, um zu bestimmen, ob dem bestimmen Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern. 14. Elektronische Vorrichtung (26) nach Anspruch 13, wobei der Kontrollschaltkreis (29) weiterhin konstruiert und angepasst ist zum: nach dem Zuweisen des bestimmten Speicherknotens (24), die der auf dem Server (22) gespeicherte Richtlinie zu sichern, Anpassen der verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24), um die Zuweisung des bestimmten Speicherknotens (24) zum Sichern der auf dem Server (22) gespeicherten Richtlinie 13

14 zu berücksichtigen Elektronische Vorrichtung (26) nach Anspruch 12, wobei die Speicherplatzanforderungen der Richtlinie eine Gesamtmenge an Speicherplatz, der momentan für die Richtlinie auf dem Server (22) verfügbar ist, umfasst; wobei die verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) eine momentane Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, und eine momentane Menge an auf dem bestimmen Speicherknoten (24) zugeordnetem Speicherplatz umfasst; und wobei der Kontrollschaltkreis (29), wenn er die Speicherplatzanforderungen der Richtlinie mit verfügbaren Speicherplatzressourcen des bestimmten Speicherknotens (24) vergleicht, konstruiert und angepasst ist zum (i) Abziehen der momentanen Menge an zugeordnetem Speicherplatz auf dem bestimmen Speicherknoten (24) von der momentanen Menge an freiem Speicherplatz, die momentan auf dem bestimmten Speicherknoten (24) verfügbar ist, um eine Menge an nicht zugeordnetem Speicherplatz auf dem bestimmten Speicherknoten (24) bereitzustellen, und (ii) Vergleichen der Gesamtmenge an Speicherplatz, die momentan der Richtlinie auf dem Server (22) zur Verfügung steht, mit der Menge an nicht zugeordnetem Speicherplatz auf dem bestimmten Speicherknoten (24), um zu bestimmen, ob dem bestimmten Speicherknoten (24) zugewiesen wird, die auf dem Server (22) gespeicherte Richtlinie zu sichern. 2 3 Revendications 1. Procédé pour affecter un noeud de stockage (24) à partir d une grille de stockage () à un serveur (22), la grille de stockage () comprenant de multiples noeuds de stockage (24) capable de sauvegarder une politique stockée sur le serveur (22), le procédé comprenant : la réception, par circuiterie électronique, d une demande d affectation (4) en provenance du serveur (22) qui demande l affectation d un des multiples noeuds de stockage (24) de la grille de stockage () au serveur (22) pour sauvegarder la politique stockée sur le serveur (22) ; l exécution, par circuiterie électronique, d une opération d affectation de noeud de stockage (6) de manière automatisée en réponse à la demande d affectation, l opération d affectation de noeud de stockage fournissant un résultat d affectation identifiant un noeud de stockage (24) affecté pour sauvegarder la politique stockée sur le serveur (22), le résultat d affectation étant basé sur une évaluation de besoins d espace de stockage de la politique et de ressources d espace de stockage disponibles de la grille de stockage () ; et la notification, par circuiterie électronique, au serveur (22) du résultat d affectation (8) pour effectuer la sauvegarde de la politique stockée sur le serveur (22) par le noeud de stockage (24). 2. Procédé selon la revendication 1, dans lequel l exécution de l opération d affectation de noeud de stockage (6) de manière automatisée en réponse à la demande d affectation comprend : l exécution d une comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles d un noeud de stockage particulier (24) pour générer l évaluation en besoin d espace de stockage de la politique et de ressources d espace de stockage disponibles de la grille de stockage () Procédé selon la revendication 2, dans lequel les exigences d espace de stockage de la politique comprennent une quantité courante d espace de stockage couramment occupée par la politique sur le serveur (22) ; dans lequel les ressources d espace de stockage disponibles du noeud de stockage particulier comprennent une quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) ; et dans lequel la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprend (i) la multiplication de la quantité courante d espace de stockage couramment occupée par la politique sur le serveur (22) par un facteur de taux de croissance pour générer une quantité future d espace de stockage prévue pour être occupée par la politique sur le serveur (22) à un point temporel futur, et (ii) la comparaison de la quantité future d espace de stockage prévue pour être occupée par la politique sur le serveur (22) à la quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22). 4. Procédé selon la revendication 3, comprenant en outre : 14

15 avant la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24), la définition du facteur de taux de croissance pour être une valeur qui augmente la quantité courante d espace de stockage couramment occupée par la politique sur le serveur (22) d un pourcentage prédéfini pour fournir la quantité future d espace de stockage prévue pour être occupée par la politique sur le serveur (22) à un point temporel futur. 1. Procédé selon la revendication 3, dans lequel les exigences d espace de stockage de la politique comprennent en outre une fréquence de sauvegarde ; dans lequel les ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprennent en outre un nombre courant de versions associé au noeud de stockage particulier (24) ; et dans lequel la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprend en outre (i) l augmentation du nombre courant de versions d un nombre particulier de versions sur la base de la fréquence de sauvegarde pour fournir un nombre potentiel de versions, et (ii) la comparaison du nombre potentiel de versions à un nombre maximum prédéfini de versions permis pour le noeud de stockage particulier (24) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22) Procédé selon la revendication 3, dans lequel les exigences d espace de stockage de la politique comprennent en outre une définition de type de sauvegarde, la définition de type de sauvegarde identifiant un parmi un type de sauvegarde «continu» où une opération de sauvegarde de politique doit être effectuée toutes les 1 minutes et un type de sauvegarde «planifié» où une opération de sauvegarde de politique doit être effectuée à des intervalles spécifiés par l utilisateur ; dans lequel les ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprennent en outre un nombre courant de politiques de type de sauvegarde «continu» affecté au noeud de stockage (24) ; et dans lequel la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprend en outre, seulement quand la définition de type de sauvegarde identifie le type de sauvegarde «continu», (i) l incrémentation du nombre courant de politiques de type de sauvegarde «continu» couramment affecté au noeud de stockage particulier (24) pour fournir un nombre potentiel de politiques de type de sauvegarde «continu» affecté au noeud de stockage particulier (24), et (ii) la comparaison du nombre potentiel de politiques de type de sauvegarde «continu» affecté au noeud de stockage (24) à un nombre maximum prédéfini de politiques de type de sauvegarde «continu» autorisées pour le noeud de stockage particulier (24) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22) Procédé selon la revendication 3, dans lequel les exigences d espace de stockage de la politique comprennent en outre une définition d équilibre de charge, la définition d équilibre de charge identifiant si de multiples politiques sur le serveur (22) sont autorisées à être sauvegardées sur un même noeud de stockage (24) ; et dans lequel la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprend en outre, quand la définition d équilibre de charge identifie que de multiples politiques sur le serveur (22) ne sont pas autorisées à être sauvegardées sur le même noeud de stockage (24), la détection du fait que le noeud de stockage particulier (24) soit déjà affecté pour sauvegarder une autre politique stockée sur le serveur (22) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22). 8. Procédé selon la revendication 3, comprenant en outre : 0 après l affectation du noeud de stockage particulier (24) pour sauvegarder la politique stockée sur le serveur (22), l ajustement des ressources d espace de stockage disponibles du noeud de stockage particulier (24) pour tenir compte de l affectation du noeud de stockage particulier (24) pour sauvegarder la politique stockée sur le serveur (22). 9. Procédé selon la revendication 8, comprenant en outre : avant la réception de la demande d affectation, l établissement d une base de données de grille de stockage () qui stocke des entrées de noeud de stockage (24), chaque entrée de noeud de stockage (24) (i) correspondant à un noeud de stockage (24) de la grille de stockage (), (ii) l identification de ressources d espace de stockage couramment disponibles pour ce noeud de stockage (24), et (iii) l imposition de restrictions d affectation pour ce noeud de stockage (24) ; et 1

16 la mise à jour dynamique des entrées de noeud de stockage (24) de base de données de grille de stockage () pour tenir compte de nouvelles affectations de noeud de stockage (24). 1. Procédé selon la revendication 2, dans lequel les exigences d espace de stockage de la politique comprennent une quantité totale d espace de stockage couramment disponible pour la politique sur le serveur (22) ; dans lequel les ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprennent une quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) et une quantité courante d espace de stockage alloué sur le noeud de stockage particulier (24) ; et dans lequel la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprend (i) la soustraction de la quantité courante d espace de stockage alloué sur le noeud de stockage particulier (24) de la quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) pour fournir une quantité d espace de stockage non-alloué sur le noeud de stockage particulier (24), et (ii) la comparaison de la quantité totale d espace de stockage libre couramment disponible pour la politique sur le serveur (22) avec la quantité d espace de stockage non-alloué sur le noeud de stockage particulier (24) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22). 11. Dispositif électronique (26) pour affecter un noeud de stockage (24) à partir d une grille de stockage () à un serveur (22), la grille de stockage () comprenant de multiples noeuds de stockage (24) capable de sauvegarder une politique stockée sur le serveur (22), le dispositif électronique (26) comprenant : 2 3 une interface de réseau (27) ; et un circuit de commande (29) couplé à l interface de réseau (27), le circuit de commande (29) étant construit et agencé pour : - recevoir, par le biais de l interface de réseau (27), une demande d affectation (4) en provenance du serveur (22) qui demande l affectation d un des multiples noeuds de stockage (24) de la grille de stockage () au serveur (22) pour sauvegarder la politique stockée sur le serveur (22), - exécuter une opération d affectation (6) de noeud de stockage de manière automatisée en réponse à la demande d affectation, l opération d affectation (6) de noeud de stockage fournissant un résultat d affectation identifiant un noeud de stockage (24) affecté pour sauvegarder la politique stockée sur le serveur (22), le résultat d affectation étant basé sur une évaluations de besoins d espace de stockage de la politique et de ressources d espace de stockage disponibles de la grille de stockage (), et - notifier au serveur (22), par le biais de l interface de réseau (27), le résultat d affectation (8) pour effectuer la sauvegarde de la politique stockée sur le serveur (22) par le noeud de stockage (24) Dispositif électronique (26) selon la revendication 11, dans lequel le circuit de commande (29), durant l exécution de l opération d affectation de noeud de stockage (6) de manière automatisée en réponse à la demande d affectation, est construit et agencé pour : exécuter une comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles d un noeud de stockage particulier (24) pour générer l évaluation de besoins d espace de stockage de la politique et de ressources d espace de stockage disponibles de la grille de stockage (). 13. Dispositif électronique (26) selon la revendication 12, dans lequel les exigences d espace de stockage de la politique comprennent une quantité courante d espace de stockage couramment occupée par la politique sur le serveur (22) ; dans lequel les ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprennent une quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) ; et dans lequel le circuit de commande (29), durant la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24), est construit et agencé pour (i) multiplier la quantité courante d espace de stockage couramment occupée par la politique sur le serveur (22) par un facteur de taux de croissance pour générer une quantité future d espace de stockage prévue pour être occupée par la politique sur le serveur (22) à un point temporel futur, et (ii) comparer la quantité future d espace de stockage prévue pour être occupée par la politique sur le serveur (22) à la quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22). 14. Dispositif électronique (26) selon la revendication 13, dans lequel le circuit de commande (29) est construit et agencé 16

17 en outre pour : après l affectation du noeud de stockage particulier (24) pour sauvegarder la politique stockée sur le serveur (22), ajuster les ressources d espace de stockage disponibles du noeud de stockage particulier (24) pour tenir compte de l affectation du noeud de stockage particulier (24) pour sauvegarder la politique stockée sur le serveur (22) Dispositif électronique (26) selon la revendication 12, dans lequel les exigences d espace de stockage de la politique comprennent une quantité totale d espace de stockage couramment disponible pour la politique sur le serveur (22) ; dans lequel les ressources d espace de stockage disponibles du noeud de stockage particulier (24) comprennent une quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) et une quantité courante d espace de stockage alloué sur le noeud de stockage particulier (24) ; et dans lequel le circuit de commande (29), durant la comparaison des exigences d espace de stockage de la politique avec des ressources d espace de stockage disponibles du noeud de stockage particulier (24), est construit et agencé pour (i) soustraire la quantité courante d espace de stockage alloué sur le noeud de stockage particulier (24) de la quantité courante d espace de stockage libre couramment disponible sur le noeud de stockage particulier (24) pour fournir une quantité d espace de stockage non-alloué sur le noeud de stockage particulier (24), et (ii) comparer la quantité totale d espace de stockage libre couramment disponible pour la politique sur le serveur (22) avec la quantité d espace de stockage non-alloué sur le noeud de stockage particulier (24) pour déterminer si le noeud de stockage particulier (24) doit être affecté pour sauvegarder la politique stockée sur le serveur (22)

18 18

19 19

20

1. General information... 2 2. Login... 2 3. Home... 3 4. Current applications... 3

1. General information... 2 2. Login... 2 3. Home... 3 4. Current applications... 3 User Manual for Marketing Authorisation and Lifecycle Management of Medicines Inhalt: User Manual for Marketing Authorisation and Lifecycle Management of Medicines... 1 1. General information... 2 2. Login...

Mehr

Einsatz einer Dokumentenverwaltungslösung zur Optimierung der unternehmensübergreifenden Kommunikation

Einsatz einer Dokumentenverwaltungslösung zur Optimierung der unternehmensübergreifenden Kommunikation Einsatz einer Dokumentenverwaltungslösung zur Optimierung der unternehmensübergreifenden Kommunikation Eine Betrachtung im Kontext der Ausgliederung von Chrysler Daniel Rheinbay Abstract Betriebliche Informationssysteme

Mehr

Ingenics Project Portal

Ingenics Project Portal Version: 00; Status: E Seite: 1/6 This document is drawn to show the functions of the project portal developed by Ingenics AG. To use the portal enter the following URL in your Browser: https://projectportal.ingenics.de

Mehr

eurex rundschreiben 094/10

eurex rundschreiben 094/10 eurex rundschreiben 094/10 Datum: Frankfurt, 21. Mai 2010 Empfänger: Alle Handelsteilnehmer der Eurex Deutschland und Eurex Zürich sowie Vendoren Autorisiert von: Jürg Spillmann Weitere Informationen zur

Mehr

IDS Lizenzierung für IDS und HDR. Primärserver IDS Lizenz HDR Lizenz

IDS Lizenzierung für IDS und HDR. Primärserver IDS Lizenz HDR Lizenz IDS Lizenzierung für IDS und HDR Primärserver IDS Lizenz HDR Lizenz Workgroup V7.3x oder V9.x Required Not Available Primärserver Express V10.0 Workgroup V10.0 Enterprise V7.3x, V9.x or V10.0 IDS Lizenz

Mehr

XML Template Transfer Transfer project templates easily between systems

XML Template Transfer Transfer project templates easily between systems Transfer project templates easily between systems A PLM Consulting Solution Public The consulting solution XML Template Transfer enables you to easily reuse existing project templates in different PPM

Mehr

ReadMe zur Installation der BRICKware for Windows, Version 6.1.2. ReadMe on Installing BRICKware for Windows, Version 6.1.2

ReadMe zur Installation der BRICKware for Windows, Version 6.1.2. ReadMe on Installing BRICKware for Windows, Version 6.1.2 ReadMe zur Installation der BRICKware for Windows, Version 6.1.2 Seiten 2-4 ReadMe on Installing BRICKware for Windows, Version 6.1.2 Pages 5/6 BRICKware for Windows ReadMe 1 1 BRICKware for Windows, Version

Mehr

Prediction Market, 28th July 2012 Information and Instructions. Prognosemärkte Lehrstuhl für Betriebswirtschaftslehre insbes.

Prediction Market, 28th July 2012 Information and Instructions. Prognosemärkte Lehrstuhl für Betriebswirtschaftslehre insbes. Prediction Market, 28th July 2012 Information and Instructions S. 1 Welcome, and thanks for your participation Sensational prices are waiting for you 1000 Euro in amazon vouchers: The winner has the chance

Mehr

Parameter-Updatesoftware PF-12 Plus

Parameter-Updatesoftware PF-12 Plus Parameter-Updatesoftware PF-12 Plus Mai / May 2015 Inhalt 1. Durchführung des Parameter-Updates... 2 2. Kontakt... 6 Content 1. Performance of the parameter-update... 4 2. Contact... 6 1. Durchführung

Mehr

Bayerisches Landesamt für Statistik und Datenverarbeitung Rechenzentrum Süd. z/os Requirements 95. z/os Guide in Lahnstein 13.

Bayerisches Landesamt für Statistik und Datenverarbeitung Rechenzentrum Süd. z/os Requirements 95. z/os Guide in Lahnstein 13. z/os Requirements 95. z/os Guide in Lahnstein 13. März 2009 0 1) LOGROTATE in z/os USS 2) KERBEROS (KRB5) in DFS/SMB 3) GSE Requirements System 1 Requirement Details Description Benefit Time Limit Impact

Mehr

GIPS 2010 Gesamtüberblick. Dr. Stefan J. Illmer Credit Suisse. Seminar der SBVg "GIPS Aperitif" 15. April 2010 Referat von Stefan Illmer

GIPS 2010 Gesamtüberblick. Dr. Stefan J. Illmer Credit Suisse. Seminar der SBVg GIPS Aperitif 15. April 2010 Referat von Stefan Illmer GIPS 2010 Gesamtüberblick Dr. Stefan J. Illmer Credit Suisse Agenda Ein bisschen Historie - GIPS 2010 Fundamentals of Compliance Compliance Statement Seite 3 15.04.2010 Agenda Ein bisschen Historie - GIPS

Mehr

p^db=`oj===pìééçêíáåñçêã~íáçå=

p^db=`oj===pìééçêíáåñçêã~íáçå= p^db=`oj===pìééçêíáåñçêã~íáçå= Error: "Could not connect to the SQL Server Instance" or "Failed to open a connection to the database." When you attempt to launch ACT! by Sage or ACT by Sage Premium for

Mehr

Exercise (Part XI) Anastasia Mochalova, Lehrstuhl für ABWL und Wirtschaftsinformatik, Kath. Universität Eichstätt-Ingolstadt 1

Exercise (Part XI) Anastasia Mochalova, Lehrstuhl für ABWL und Wirtschaftsinformatik, Kath. Universität Eichstätt-Ingolstadt 1 Exercise (Part XI) Notes: The exercise is based on Microsoft Dynamics CRM Online. For all screenshots: Copyright Microsoft Corporation. The sign ## is you personal number to be used in all exercises. All

Mehr

Algorithms for graph visualization

Algorithms for graph visualization Algorithms for graph visualization Project - Orthogonal Grid Layout with Small Area W INTER SEMESTER 2013/2014 Martin No llenburg KIT Universita t des Landes Baden-Wu rttemberg und nationales Forschungszentrum

Mehr

KURZANLEITUNG. Firmware-Upgrade: Wie geht das eigentlich?

KURZANLEITUNG. Firmware-Upgrade: Wie geht das eigentlich? KURZANLEITUNG Firmware-Upgrade: Wie geht das eigentlich? Die Firmware ist eine Software, die auf der IP-Kamera installiert ist und alle Funktionen des Gerätes steuert. Nach dem Firmware-Update stehen Ihnen

Mehr

Exercise (Part II) Anastasia Mochalova, Lehrstuhl für ABWL und Wirtschaftsinformatik, Kath. Universität Eichstätt-Ingolstadt 1

Exercise (Part II) Anastasia Mochalova, Lehrstuhl für ABWL und Wirtschaftsinformatik, Kath. Universität Eichstätt-Ingolstadt 1 Exercise (Part II) Notes: The exercise is based on Microsoft Dynamics CRM Online. For all screenshots: Copyright Microsoft Corporation. The sign ## is you personal number to be used in all exercises. All

Mehr

Patentrelevante Aspekte der GPLv2/LGPLv2

Patentrelevante Aspekte der GPLv2/LGPLv2 Patentrelevante Aspekte der GPLv2/LGPLv2 von RA Dr. Till Jaeger OSADL Seminar on Software Patents and Open Source Licensing, Berlin, 6./7. November 2008 Agenda 1. Regelungen der GPLv2 zu Patenten 2. Implizite

Mehr

RailMaster New Version 7.00.p26.01 / 01.08.2014

RailMaster New Version 7.00.p26.01 / 01.08.2014 RailMaster New Version 7.00.p26.01 / 01.08.2014 English Version Bahnbuchungen so einfach und effizient wie noch nie! Copyright Copyright 2014 Travelport und/oder Tochtergesellschaften. Alle Rechte vorbehalten.

Mehr

Lehrstuhl für Allgemeine BWL Strategisches und Internationales Management Prof. Dr. Mike Geppert Carl-Zeiß-Str. 3 07743 Jena

Lehrstuhl für Allgemeine BWL Strategisches und Internationales Management Prof. Dr. Mike Geppert Carl-Zeiß-Str. 3 07743 Jena Lehrstuhl für Allgemeine BWL Strategisches und Internationales Management Prof. Dr. Mike Geppert Carl-Zeiß-Str. 3 07743 Jena http://www.im.uni-jena.de Contents I. Learning Objectives II. III. IV. Recap

Mehr

Customer-specific software for autonomous driving and driver assistance (ADAS)

Customer-specific software for autonomous driving and driver assistance (ADAS) This press release is approved for publication. Press Release Chemnitz, February 6 th, 2014 Customer-specific software for autonomous driving and driver assistance (ADAS) With the new product line Baselabs

Mehr

Erfolgreiche Unternehmen bauen ihre SharePoint-Dashboards mit Visio Sehen heißt verstehen! Claus Quast SSP Visio Microsoft Deutschland GmbH

Erfolgreiche Unternehmen bauen ihre SharePoint-Dashboards mit Visio Sehen heißt verstehen! Claus Quast SSP Visio Microsoft Deutschland GmbH Erfolgreiche Unternehmen bauen ihre SharePoint-Dashboards mit Visio Sehen heißt verstehen! Claus Quast SSP Visio Microsoft Deutschland GmbH 2 Inhalt Was sind Dashboards? Die Bausteine Visio Services, der

Mehr

ISO 15504 Reference Model

ISO 15504 Reference Model Prozess Dimension von SPICE/ISO 15504 Process flow Remarks Role Documents, data, tools input, output Start Define purpose and scope Define process overview Define process details Define roles no Define

Mehr

Instruktionen Mozilla Thunderbird Seite 1

Instruktionen Mozilla Thunderbird Seite 1 Instruktionen Mozilla Thunderbird Seite 1 Instruktionen Mozilla Thunderbird Dieses Handbuch wird für Benutzer geschrieben, die bereits ein E-Mail-Konto zusammenbauen lassen im Mozilla Thunderbird und wird

Mehr

USBASIC SAFETY IN NUMBERS

USBASIC SAFETY IN NUMBERS USBASIC SAFETY IN NUMBERS #1.Current Normalisation Ropes Courses and Ropes Course Elements can conform to one or more of the following European Norms: -EN 362 Carabiner Norm -EN 795B Connector Norm -EN

Mehr

AS Path-Prepending in the Internet And Its Impact on Routing Decisions

AS Path-Prepending in the Internet And Its Impact on Routing Decisions (SEP) Its Impact on Routing Decisions Zhi Qi ytqz@mytum.de Advisor: Wolfgang Mühlbauer Lehrstuhl für Netzwerkarchitekturen Background Motivation BGP -> core routing protocol BGP relies on policy routing

Mehr

The Single Point Entry Computer for the Dry End

The Single Point Entry Computer for the Dry End The Single Point Entry Computer for the Dry End The master computer system was developed to optimize the production process of a corrugator. All entries are made at the master computer thus error sources

Mehr

Titelbild1 ANSYS. Customer Portal LogIn

Titelbild1 ANSYS. Customer Portal LogIn Titelbild1 ANSYS Customer Portal LogIn 1 Neuanmeldung Neuanmeldung: Bitte Not yet a member anklicken Adressen-Check Adressdaten eintragen Customer No. ist hier bereits erforderlich HERE - Button Hier nochmal

Mehr

IoT Scopes and Criticisms

IoT Scopes and Criticisms IoT Scopes and Criticisms Rajkumar K Kulandaivelu S 1 What is IoT? Interconnection of multiple devices over internet medium 2 IoT Scope IoT brings lots of scope for development of applications that are

Mehr

Infrastructure as a Service (IaaS) Solutions for Online Game Service Provision

Infrastructure as a Service (IaaS) Solutions for Online Game Service Provision Infrastructure as a Service (IaaS) Solutions for Online Game Service Provision Zielsetzung: System Verwendung von Cloud-Systemen für das Hosting von online Spielen (IaaS) Reservieren/Buchen von Resources

Mehr

EEX Kundeninformation 2002-09-11

EEX Kundeninformation 2002-09-11 EEX Kundeninformation 2002-09-11 Terminmarkt Bereitstellung eines Simulations-Hotfixes für Eurex Release 6.0 Aufgrund eines Fehlers in den Release 6.0 Simulations-Kits lässt sich die neue Broadcast-Split-

Mehr

SAP PPM Enhanced Field and Tab Control

SAP PPM Enhanced Field and Tab Control SAP PPM Enhanced Field and Tab Control A PPM Consulting Solution Public Enhanced Field and Tab Control Enhanced Field and Tab Control gives you the opportunity to control your fields of items and decision

Mehr

EEX Kundeninformation 2002-08-30

EEX Kundeninformation 2002-08-30 EEX Kundeninformation 2002-08-30 Terminmarkt - Eurex Release 6.0; Versand der Simulations-Kits Kit-Versand: Am Freitag, 30. August 2002, versendet Eurex nach Handelsschluss die Simulations -Kits für Eurex

Mehr

DKRZ Datenhierarchie Von der Antragstellung bis zur Archivierung

DKRZ Datenhierarchie Von der Antragstellung bis zur Archivierung DKRZ Datenhierarchie Von der Antragstellung bis zur Archivierung 07-May-2014 Hannes Thiemann Deutsches Klimarechenzentrum (DKRZ) Datenmanagement Antrag Ressourcen Archivierung + Zugriff Support LiveDemo

Mehr

Aufgabenstellung Wie verwende ich den in Windows XP und Windows 2000 enthaltenen SNTP- Client w32time an SICLOCK TM/TS?

Aufgabenstellung Wie verwende ich den in Windows XP und Windows 2000 enthaltenen SNTP- Client w32time an SICLOCK TM/TS? SICLOCK Application Note AN-0001 Titel w32time an SICLOCK TM/TS Aufgabenstellung Wie verwende ich den in Windows XP und Windows 2000 enthaltenen SNTP- Client w32time an SICLOCK TM/TS? Schlüsselwörter NTP,

Mehr

TVHD800x0. Port-Weiterleitung. Version 1.1

TVHD800x0. Port-Weiterleitung. Version 1.1 TVHD800x0 Port-Weiterleitung Version 1.1 Inhalt: 1. Übersicht der Ports 2. Ein- / Umstellung der Ports 3. Sonstige Hinweise Haftungsausschluss Diese Bedienungsanleitung wurde mit größter Sorgfalt erstellt.

Mehr

TomTom WEBFLEET Tachograph

TomTom WEBFLEET Tachograph TomTom WEBFLEET Tachograph Installation TG, 17.06.2013 Terms & Conditions Customers can sign-up for WEBFLEET Tachograph Management using the additional services form. Remote download Price: NAT: 9,90.-/EU:

Mehr

Lesen Sie die Bedienungs-, Wartungs- und Sicherheitsanleitungen des mit REMUC zu steuernden Gerätes

Lesen Sie die Bedienungs-, Wartungs- und Sicherheitsanleitungen des mit REMUC zu steuernden Gerätes KURZANLEITUNG VORAUSSETZUNGEN Lesen Sie die Bedienungs-, Wartungs- und Sicherheitsanleitungen des mit REMUC zu steuernden Gerätes Überprüfen Sie, dass eine funktionsfähige SIM-Karte mit Datenpaket im REMUC-

Mehr

Readme-USB DIGSI V 4.82

Readme-USB DIGSI V 4.82 DIGSI V 4.82 Sehr geehrter Kunde, der USB-Treiber für SIPROTEC-Geräte erlaubt Ihnen, mit den SIPROTEC Geräten 7SJ80/7SK80 über USB zu kommunizieren. Zur Installation oder Aktualisierung des USB-Treibers

Mehr

Tivoli Storage Manager (TSM) TSM VE Lizensierungsmodell. Andreas Kindlbacher, SWG

Tivoli Storage Manager (TSM) TSM VE Lizensierungsmodell. Andreas Kindlbacher, SWG Tivoli Storage Manager (TSM) TSM VE Lizensierungsmodell Andreas Kindlbacher, SWG 2009 IBM Corporation 2 Agenda IBM Software Group Passport Advantage: PVU vs Terabyte pricing Bestimmung des zu lizensierenden

Mehr

Restschmutzanalyse Residual Dirt Analysis

Restschmutzanalyse Residual Dirt Analysis Q-App: Restschmutzanalyse Residual Dirt Analysis Differenzwägeapplikation, mit individueller Proben ID Differential weighing application with individual Sample ID Beschreibung Gravimetrische Bestimmung

Mehr

XV1100K(C)/XV1100SK(C)

XV1100K(C)/XV1100SK(C) Lexware Financial Office Premium Handwerk XV1100K(C)/XV1100SK(C) All rights reserverd. Any reprinting or unauthorized use wihout the written permission of Lexware Financial Office Premium Handwerk Corporation,

Mehr

Anleitung zur Schnellinstallation TFM-560X YO.13

Anleitung zur Schnellinstallation TFM-560X YO.13 Anleitung zur Schnellinstallation TFM-560X YO.13 Table of Contents Deutsch 1 1. Bevor Sie anfangen 1 2. Installation 2 Troubleshooting 6 Version 06.08.2011 1. Bevor Sie anfangen Packungsinhalt ŸTFM-560X

Mehr

SmartClass Firmware-Update Vorgehensweise

SmartClass Firmware-Update Vorgehensweise Benutzeranweisungen SmartClass Firmware-Update Vorgehensweise 2008.01 (V 1.x.x) Deutsch Please direct all enquiries to your local JDSU sales company. The addresses can be found at: www.jdsu.com/tm-contacts

Mehr

Load balancing Router with / mit DMZ

Load balancing Router with / mit DMZ ALL7000 Load balancing Router with / mit DMZ Deutsch Seite 3 English Page 10 ALL7000 Quick Installation Guide / Express Setup ALL7000 Quick Installation Guide / Express Setup - 2 - Hardware Beschreibung

Mehr

Frequently asked Questions for Kaercher Citrix (apps.kaercher.com)

Frequently asked Questions for Kaercher Citrix (apps.kaercher.com) Frequently asked Questions for Kaercher Citrix (apps.kaercher.com) Inhalt Content Citrix-Anmeldung Login to Citrix Was bedeutet PIN und Token (bei Anmeldungen aus dem Internet)? What does PIN and Token

Mehr

Robotino View Kommunikation mit OPC. Communication with OPC DE/EN 04/08

Robotino View Kommunikation mit OPC. Communication with OPC DE/EN 04/08 Robotino View Kommunikation mit OPC Robotino View Communication with OPC 1 DE/EN 04/08 Stand/Status: 04/2008 Autor/Author: Markus Bellenberg Festo Didactic GmbH & Co. KG, 73770 Denkendorf, Germany, 2008

Mehr

Granite Gerhard Pirkl

Granite Gerhard Pirkl Granite Gerhard Pirkl 2013 Riverbed Technology. All rights reserved. Riverbed and any Riverbed product or service name or logo used herein are trademarks of Riverbed Technology. All other trademarks used

Mehr

German English Firmware translation for T-Sinus 154 Access Point

German English Firmware translation for T-Sinus 154 Access Point German English Firmware translation for T-Sinus 154 Access Point Konfigurationsprogramm Configuration program (english translation italic type) Dieses Programm ermöglicht Ihnen Einstellungen in Ihrem Wireless

Mehr

Aber genau deshalb möchte ich Ihre Aufmehrsamkeit darauf lenken und Sie dazu animieren, der Eventualität durch geeignete Gegenmaßnahmen zu begegnen.

Aber genau deshalb möchte ich Ihre Aufmehrsamkeit darauf lenken und Sie dazu animieren, der Eventualität durch geeignete Gegenmaßnahmen zu begegnen. NetWorker - Allgemein Tip 618, Seite 1/5 Das Desaster Recovery (mmrecov) ist evtl. nicht mehr möglich, wenn der Boostrap Save Set auf einem AFTD Volume auf einem (Data Domain) CIFS Share gespeichert ist!

Mehr

(Prüfungs-)Aufgaben zum Thema Scheduling

(Prüfungs-)Aufgaben zum Thema Scheduling (Prüfungs-)Aufgaben zum Thema Scheduling 1) Geben Sie die beiden wichtigsten Kriterien bei der Wahl der Größe des Quantums beim Round-Robin-Scheduling an. 2) In welchen Situationen und von welchen (Betriebssystem-)Routinen

Mehr

In vier Schritten zum Titel. erfolgreichen Messeauftritt. Four steps to a successful trade fair. Hier beginnt Zukunft! The future starts here!

In vier Schritten zum Titel. erfolgreichen Messeauftritt. Four steps to a successful trade fair. Hier beginnt Zukunft! The future starts here! In vier Schritten zum Titel erfolgreichen Messeauftritt. Four steps to a successful trade fair. Hier beginnt Zukunft! The future starts here! Einleitung Intro Um Sie dabei zu unterstützen, Ihren Messeauftritt

Mehr

H. Enke, Sprecher des AK Forschungsdaten der WGL

H. Enke, Sprecher des AK Forschungsdaten der WGL https://escience.aip.de/ak-forschungsdaten H. Enke, Sprecher des AK Forschungsdaten der WGL 20.01.2015 / Forschungsdaten - DataCite Workshop 1 AK Forschungsdaten der WGL 2009 gegründet - Arbeit für die

Mehr

EEX Kundeninformation 2007-09-05

EEX Kundeninformation 2007-09-05 EEX Eurex Release 10.0: Dokumentation Windows Server 2003 auf Workstations; Windows Server 2003 Service Pack 2: Information bezüglich Support Sehr geehrte Handelsteilnehmer, Im Rahmen von Eurex Release

Mehr

Group and Session Management for Collaborative Applications

Group and Session Management for Collaborative Applications Diss. ETH No. 12075 Group and Session Management for Collaborative Applications A dissertation submitted to the SWISS FEDERAL INSTITUTE OF TECHNOLOGY ZÜRICH for the degree of Doctor of Technical Seiences

Mehr

USB Treiber updaten unter Windows 7/Vista

USB Treiber updaten unter Windows 7/Vista USB Treiber updaten unter Windows 7/Vista Hinweis: Für den Downloader ist momentan keine 64 Bit Version erhältlich. Der Downloader ist nur kompatibel mit 32 Bit Versionen von Windows 7/Vista. Für den Einsatz

Mehr

PCIe, DDR4, VNAND Effizienz beginnt im Server

PCIe, DDR4, VNAND Effizienz beginnt im Server PCIe, DDR4, VNAND Effizienz beginnt im Server Future Thinking 2015 /, Director Marcom + SBD EMEA Legal Disclaimer This presentation is intended to provide information concerning computer and memory industries.

Mehr

JONATHAN JONA WISLER WHD.global

JONATHAN JONA WISLER WHD.global JONATHAN WISLER JONATHAN WISLER WHD.global CLOUD IS THE FUTURE By 2014, the personal cloud will replace the personal computer at the center of users' digital lives Gartner CLOUD TYPES SaaS IaaS PaaS

Mehr

Integration of D-Grid Sites in NGI-DE Monitoring

Integration of D-Grid Sites in NGI-DE Monitoring Integration of D-Grid Sites in NGI-DE Monitoring Steinbuch Centre for Computing Foued Jrad www.kit.edu D-Grid Site Monitoring Status! Prototype D-Grid Site monitoring based on Nagios running on sitemon.d-grid.de

Mehr

Perinorm Systemvoraussetzungen ab Version Release 2010

Perinorm Systemvoraussetzungen ab Version Release 2010 Perinorm Systemvoraussetzungen ab Version Release 2010 1. DVD Version - Einzelplatzversion Betriebssystem Unterstützte Betriebssysteme Windows XP, Windows Vista Windows 7 (falls bereits verfügbar) Auf

Mehr

Sepiola Mockups. Overview. Show notes. Primäre Navigation anklicken um zum gewünschten Mockups zu gehen. Backup usage. Overview.

Sepiola Mockups. Overview. Show notes. Primäre Navigation anklicken um zum gewünschten Mockups zu gehen. Backup usage. Overview. Show notes usage Incremental s Free 35% 30% 35% 711 MB 598 MB 739 MB Quota: 2 GB change quota under Settings schedule Last s Successfull Tuesday, 19.3.09 12:16 Successfull Wednesday, 19.3.09 12:25 Successfull

Mehr

BLK-2000. Quick Installation Guide. English. Deutsch

BLK-2000. Quick Installation Guide. English. Deutsch BLK-2000 Quick Installation Guide English Deutsch This guide covers only the most common situations. All detail information is described in the user s manual. English BLK-2000 Quick Installation Guide

Mehr

IBM Security Lab Services für QRadar

IBM Security Lab Services für QRadar IBM Security Lab Services für QRadar Serviceangebote für ein QRadar SIEM Deployment in 10 bzw. 15 Tagen 28.01.2015 12015 IBM Corporation Agenda 1 Inhalt der angebotenen Leistungen Allgemeines Erbrachte

Mehr

Software development with continuous integration

Software development with continuous integration Software development with continuous integration (FESG/MPIfR) ettl@fs.wettzell.de (FESG) neidhardt@fs.wettzell.de 1 A critical view on scientific software Tendency to become complex and unstructured Highly

Mehr

Total Security Intelligence. Die nächste Generation von Log Management and SIEM. Markus Auer Sales Director Q1 Labs.

Total Security Intelligence. Die nächste Generation von Log Management and SIEM. Markus Auer Sales Director Q1 Labs. Total Security Intelligence Die nächste Generation von Log Management and SIEM Markus Auer Sales Director Q1 Labs IBM Deutschland 1 2012 IBM Corporation Gezielte Angriffe auf Unternehmen und Regierungen

Mehr

Employment and Salary Verification in the Internet (PA-PA-US)

Employment and Salary Verification in the Internet (PA-PA-US) Employment and Salary Verification in the Internet (PA-PA-US) HELP.PYUS Release 4.6C Employment and Salary Verification in the Internet (PA-PA-US SAP AG Copyright Copyright 2001 SAP AG. Alle Rechte vorbehalten.

Mehr

MindestanforderungenanDokumentationvon Lieferanten

MindestanforderungenanDokumentationvon Lieferanten andokumentationvon Lieferanten X.0010 3.02de_en/2014-11-07 Erstellt:J.Wesseloh/EN-M6 Standardvorgabe TK SY Standort Bremen Standard requirements TK SY Location Bremen 07.11.14 DieInformationenindieserUnterlagewurdenmitgrößterSorgfalterarbeitet.DennochkönnenFehlernichtimmervollständig

Mehr

CHAMPIONS Communication and Dissemination

CHAMPIONS Communication and Dissemination CHAMPIONS Communication and Dissemination Europa Programm Center Im Freistaat Thüringen In Trägerschaft des TIAW e. V. 1 CENTRAL EUROPE PROGRAMME CENTRAL EUROPE PROGRAMME -ist als größtes Aufbauprogramm

Mehr

Windream Objektspeicher 6.0.2.0

Windream Objektspeicher 6.0.2.0 Windream Objektspeicher 6.0.2.0 Directory Pools und Filestream Pools verfügen über neue Optionen zur Integration von NetApp. Das Leistungsmerkmal wird über die Lizenz des windream Objektspeichers freigeschaltet.

Mehr

Introducing PAThWay. Structured and methodical performance engineering. Isaías A. Comprés Ureña Ventsislav Petkov Michael Firbach Michael Gerndt

Introducing PAThWay. Structured and methodical performance engineering. Isaías A. Comprés Ureña Ventsislav Petkov Michael Firbach Michael Gerndt Introducing PAThWay Structured and methodical performance engineering Isaías A. Comprés Ureña Ventsislav Petkov Michael Firbach Michael Gerndt Technical University of Munich Overview Tuning Challenges

Mehr

SONAS Projekt OwnCloud Speicher

SONAS Projekt OwnCloud Speicher SONAS Projekt OwnCloud Speicher ITEK-September 2012 Project Timeline Month August September October November December January February March Year 2012 2012 2012 2012 2012 2013 2013 2013 SONAS General

Mehr

SolidQ Flex Services Walkthrough Part I

SolidQ Flex Services Walkthrough Part I Part I Im Folgenden stellen wir Ihnen in Text und Bild die wichtigsten Funktionen der SolidQ Flex Services vor. 1. Dashboard Nach dem Einloggen sieht man zunächst das Dashboard. Dies gilt sowohl für den

Mehr

Praktikum Entwicklung Mediensysteme (für Master)

Praktikum Entwicklung Mediensysteme (für Master) Praktikum Entwicklung Mediensysteme (für Master) Organisatorisches Today Schedule Organizational Stuff Introduction to Android Exercise 1 2 Schedule Phase 1 Individual Phase: Introduction to basics about

Mehr

Technische Spezifikation ekey FW update

Technische Spezifikation ekey FW update Technische Spezifikation ekey FW update Allgemein gültig Produktbeschreibung Mit dem ekey Firmware update kann bei allen ekey home Fingerscannern und Steuereinheiten eine Softwareaktualisierung durchgeführt

Mehr

Business-centric Storage How appliances make complete backup solutions simple to build and to sell

Business-centric Storage How appliances make complete backup solutions simple to build and to sell Business-centric Storage How appliances make complete backup solutions simple to build and to sell Frank Reichart Sen. Dir. Prod. Marketing Storage Solutions 0 The three horrors of data protection 50%

Mehr

1.1 Media Gateway - SIP-Sicherheit verbessert

1.1 Media Gateway - SIP-Sicherheit verbessert Deutsch Read Me System Software 7.10.6 PATCH 2 Diese Version unserer Systemsoftware ist für die Gateways der Rxxx2- und der RTxxx2-Serie verfügbar. Beachten Sie, dass ggf. nicht alle hier beschriebenen

Mehr

(51) Int Cl.: H04L 29/12 (2006.01)

(51) Int Cl.: H04L 29/12 (2006.01) (19) (11) EP 1 7 246 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 09.0.07 Bulletin 07/19 (1) Int Cl.: H04L 29/12 (06.01) (21) Application number:

Mehr

SOMNOcheck. PC-Software für SOMNOcheck / SOMNOcheck effort PC software for SOMNOcheck / SOMNOcheck effort

SOMNOcheck. PC-Software für SOMNOcheck / SOMNOcheck effort PC software for SOMNOcheck / SOMNOcheck effort SOMNOcheck PC-Software für SOMNOcheck / SOMNOcheck effort PC software for SOMNOcheck / SOMNOcheck effort Installationsanweisung für Windows 7 (32-bit/64-bit) Installation instructions for Windows 7 (32-bit/64-bit)

Mehr

Cloud for Customer Learning Resources. Customer

Cloud for Customer Learning Resources. Customer Cloud for Customer Learning Resources Customer Business Center Logon to Business Center for Cloud Solutions from SAP & choose Cloud for Customer https://www.sme.sap.com/irj/sme/ 2013 SAP AG or an SAP affiliate

Mehr

PPM Integrated UI Project Management Tabs into Item Detail

PPM Integrated UI Project Management Tabs into Item Detail Project Management Tabs into Item Detail A PLM Consulting Solution Public This consulting solution enables you to streamline your portfolio and project management process via an integrated UI environment.

Mehr

Disclaimer & Legal Notice. Haftungsausschluss & Impressum

Disclaimer & Legal Notice. Haftungsausschluss & Impressum Disclaimer & Legal Notice Haftungsausschluss & Impressum 1. Disclaimer Limitation of liability for internal content The content of our website has been compiled with meticulous care and to the best of

Mehr

SanStore: Kurzanleitung / SanStore: Quick reference guide

SanStore: Kurzanleitung / SanStore: Quick reference guide SanStore Rekorder der Serie MM, MMX, HM und HMX Datenwiedergabe und Backup Datenwiedergabe 1. Drücken Sie die Time Search-Taste auf der Fernbedienung. Hinweis: Falls Sie nach einem Administrator-Passwort

Mehr

Distributed testing. Demo Video

Distributed testing. Demo Video distributed testing Das intunify Team An der Entwicklung der Testsystem-Software arbeiten wir als Team von Software-Spezialisten und Designern der soft2tec GmbH in Kooperation mit der Universität Osnabrück.

Mehr

Aufbau eines IT-Servicekataloges am Fallbeispiel einer Schweizer Bank

Aufbau eines IT-Servicekataloges am Fallbeispiel einer Schweizer Bank SwissICT 2011 am Fallbeispiel einer Schweizer Bank Fritz Kleiner, fritz.kleiner@futureways.ch future ways Agenda Begriffsklärung Funktionen und Aspekte eines IT-Servicekataloges Fallbeispiel eines IT-Servicekataloges

Mehr

Abteilung Internationales CampusCenter

Abteilung Internationales CampusCenter Abteilung Internationales CampusCenter Instructions for the STiNE Online Enrollment Application for Exchange Students 1. Please go to www.uni-hamburg.de/online-bewerbung and click on Bewerberaccount anlegen

Mehr

Algorithms & Datastructures Midterm Test 1

Algorithms & Datastructures Midterm Test 1 Algorithms & Datastructures Midterm Test 1 Wolfgang Pausch Heiko Studt René Thiemann Tomas Vitvar

Mehr

Inequality Utilitarian and Capabilities Perspectives (and what they may imply for public health)

Inequality Utilitarian and Capabilities Perspectives (and what they may imply for public health) Inequality Utilitarian and Capabilities Perspectives (and what they may imply for public health) 1 Utilitarian Perspectives on Inequality 2 Inequalities matter most in terms of their impact onthelivesthatpeopleseektoliveandthethings,

Mehr

Klausur Verteilte Systeme

Klausur Verteilte Systeme Klausur Verteilte Systeme SS 2005 by Prof. Walter Kriha Klausur Verteilte Systeme: SS 2005 by Prof. Walter Kriha Note Bitte ausfüllen (Fill in please): Vorname: Nachname: Matrikelnummer: Studiengang: Table

Mehr

How to access licensed products from providers who are already operating productively in. General Information... 2. Shibboleth login...

How to access licensed products from providers who are already operating productively in. General Information... 2. Shibboleth login... Shibboleth Tutorial How to access licensed products from providers who are already operating productively in the SWITCHaai federation. General Information... 2 Shibboleth login... 2 Separate registration

Mehr

Labour law and Consumer protection principles usage in non-state pension system

Labour law and Consumer protection principles usage in non-state pension system Labour law and Consumer protection principles usage in non-state pension system by Prof. Dr. Heinz-Dietrich Steinmeyer General Remarks In private non state pensions systems usually three actors Employer

Mehr

Verzeichnisdienste in heterogenen Systemen

Verzeichnisdienste in heterogenen Systemen Verzeichnisdienste in heterogenen Systemen Zielsetzungen Implementierung Aufbau: Active Directory (AD) auf Basis von Windows Server 008 R mit Windows Client(s), Linux Client(s) und einem Linux Server (Dateiserver).

Mehr

Formatting the TrekStor i.beat run

Formatting the TrekStor i.beat run DE EN Formatting the TrekStor i.beat run Formatierung des TrekStor i.beat run a Beim Formatieren werden ALLE Daten auf dem MP3-Player gelöscht. In diesem Abschnitt wird Ihnen erläutert, wie Sie Ihren MP3-Player

Mehr

TalkIT: Internet Communities Tiroler Zukunftsstiftung Donnerstag, 22. 4. 2010

TalkIT: Internet Communities Tiroler Zukunftsstiftung Donnerstag, 22. 4. 2010 TalkIT: Internet Communities Tiroler Zukunftsstiftung Donnerstag, 22. 4. 2010 Reinhard Bernsteiner MCiT Management, Communication & IT MCI MANAGEMENT CENTER INNSBRUCK Universitätsstraße 15 www.mci.edu

Mehr

WH1 Citrix Follow-Me Data: The Enterprise Version of File Sharing. Peter Schulz, Product Manager, Citrix Joerg Vosse, Systems Engineer, Citrix

WH1 Citrix Follow-Me Data: The Enterprise Version of File Sharing. Peter Schulz, Product Manager, Citrix Joerg Vosse, Systems Engineer, Citrix WH1 Citrix Follow-Me Data: The Enterprise Version of File Sharing Peter Schulz, Product Manager, Citrix Joerg Vosse, Systems Engineer, Citrix Users Demand: Instant file access from any device File Sharing

Mehr

Wie agil kann Business Analyse sein?

Wie agil kann Business Analyse sein? Wie agil kann Business Analyse sein? Chapter Meeting Michael Leber 2012-01-24 ANECON Software Design und Beratung G.m.b.H. Alser Str. 4/Hof 1 A-1090 Wien Tel.: +43 1 409 58 90 www.anecon.com office@anecon.com

Mehr

Mash-Up Personal Learning Environments. Dr. Hendrik Drachsler

Mash-Up Personal Learning Environments. Dr. Hendrik Drachsler Decision Support for Learners in Mash-Up Personal Learning Environments Dr. Hendrik Drachsler Personal Nowadays Environments Blog Reader More Information Providers Social Bookmarking Various Communities

Mehr

VPPR Stab Sicherheit, Gesundheit und Umwelt Safety, Security, Health and Environment. Laser which rules apply in Switzerland?

VPPR Stab Sicherheit, Gesundheit und Umwelt Safety, Security, Health and Environment. Laser which rules apply in Switzerland? Laser which rules apply in Switzerland? ETH Zürich KT/07.07.2008 When in danger say STOP! VPPR Laser classes Class 1 Eye safe < 0.39 mw Class 1M Eye safe without optical instruments 400 700 nm < 0.39 mw

Mehr

Exercise (Part I) Anastasia Mochalova, Lehrstuhl für ABWL und Wirtschaftsinformatik, Kath. Universität Eichstätt-Ingolstadt 1

Exercise (Part I) Anastasia Mochalova, Lehrstuhl für ABWL und Wirtschaftsinformatik, Kath. Universität Eichstätt-Ingolstadt 1 Exercise (Part I) Notes: The exercise is based on Microsoft Dynamics CRM Online. For all screenshots: Copyright Microsoft Corporation. The sign ## is you personal number to be used in all exercises. All

Mehr

Continuous Auditing eine gut gemeinte aber schlechte Idee kommt zurück

Continuous Auditing eine gut gemeinte aber schlechte Idee kommt zurück Continuous Auditing eine gut gemeinte aber schlechte Idee kommt zurück Michel Huissoud Lic.iur, CISA, CIA 5. November 2012 - ISACA/SVIR-Fachtagung - Zürich Überwachung Continuous Monitoring Continuous

Mehr