Abstract: A management computer monitors an allocated capacity of a source virtual volume and an allocated capacity of a virtual pool having a storage area allocated to a destination virtual volume in a storage, judges whether the allocated capacity of the source virtual volume can be covered in the virtual pool or not, and informs the user of a result that data migration fails when the allocated capacity of the source virtual volume cannot be covered. When the allocated capacity of the source virtual volume cannot be covered, the management computer uses another storage area to increase the capacity of the virtual pool. Accordingly, when data migration is performed between the virtual volumes, capacities of physical areas allocated to the source virtual volume and the destination virtual volume can be grasped so that the data migration can be performed accurately between the source virtual volume and the destination virtual volume.

Abstract: A shared memory stores packets for a packet processor. The shared memory is arranged into banks that are word-interleaved. All banks may be accessed in parallel during each time-slot by different requesters. A staggered round-robin arbiter connects requesters to banks in a parallel fashion. Requestor inputs to the arbiter are staggered to allow access to different banks in a sequential order over successive time-slots. Multi-processor tribes have many processors that generate random requests to the shared memory. A slot scheduler arranges these random requests into a stream of sequential requests that are synchronized to the staggered round-robin arbiter. A packet interface requestor stores incoming packets from an external network into the shared memory. The packet's offset within pages of the shared memory is determined by the first available bank that the packet can be written to, eliminating delays in storing incoming packets and spreading storage of frequently-accessed fields.

Abstract: In a distributed system that includes multiple machines, a scheduler attempts to schedule a task on a machine that is not currently overloaded with work. If a task is scheduled on a machine that does not yet have copies of the portions of the data set on which the task needs to operate, then that machine obtains copies of those portions from other machines that already have them. Whenever a “source” machine ships a copy of a portion to another “destination” machine in the distributed system, the destination machine persistently stores that copy on the destination machine's persistent storage mechanism. The copy also remains on the source machine. Thus, portions of the data set are automatically replicated whenever those portions are shipped between machines of the distributed system. Each machine in the distributed system has access to “global” information that indicates which machines have which portions of the data set.

Abstract: In one embodiment, the invention provides an apparatus for caching data in a network, with the apparatus including a proxy cache configured to receive request for an object from a client and to fetch data blocks from a server. The proxy cache may be configured to cache the data blocks in a hierarchical relationship within the object. The object may be, for example, a data file or a directory. The data blocks that are cached in the proxy cache define an active data set which is based upon a request from a client.

Abstract: A method is provided for synchronizing data sources. The method includes receiving at least first and second data tables. The data tables have one or more mutually similar fields and one or more dissimilar fields from one another. First normalized, second normalized, and intermediate data tables are stored, each including respective first normalized, second normalized, and intermediate data table fields that each correspond to the mutually similar fields of the first and second data tables. The first normalized data table is at least partially populated with corresponding entries from the first data table and the second normalized data table is at least partially populated with corresponding entries in the second data table. Intermediate data table entries are respectively replaced with corresponding inconsistent data entries of the first and second normalized data tables. An apparatus and a computer program product for accomplishing the above method are also provided.

Abstract: A system and method for providing an integrated storage appliance is disclosed. The storage appliance includes a storage subsystem, a process cluster coupled to the storage subsystem, and a customizable software stack that includes storage-access application so executed by the processor cluster, wherein subsystem, processor cluster and software stack are integrated such that the storage appliance exhibits greater combined reliability, higher availability, and higher serviceability characteristics than would be provided by a sum of the characteristics unintegrated components.

Abstract: A system and method for executing a computer program in a network. The system includes a surrogate proxy processor which, when executing the computer program, is programmed to receive at least one foveated image from at least one of the foveating proxy server and a further device that is connected to the foveating proxy server, wherein the foveating proxy server generates the at least one foveated image, and transmit the foveated image to at least one of the client computer and a another device. In addition, a system is provided which includes a foveating proxy server, and at least two surrogate proxy servers communicating with one another. At least one of the at least two surrogate proxy servers communicates with the foveating proxy server, and another one of the at least two proxy servers communicates with at least one of the client computer and a further device, wherein the at least two surrogate proxy servers are cascaded along a multi-hop portion of the network.

Abstract: A system comprises a first node that provides a broadcast request for data. The first node receives a read conflict response to the broadcast request from the first node. The read conflict response indicates that a second node has a pending broadcast read request for the data. A third node provides the requested data to the first node in response to the broadcast request from the first node. The first node fills the data provided by the third node in a cache associated with the first node.

Abstract: Early issue of transaction ID is disclosed. An apparatus comprising decoder to generate a first node ID indicative of the destination of a cache transaction from a caching agent, a transaction ID allocation logic coupled to and operating in parallel to the decoder to select a transaction ID (TID) for the transaction based on the first node ID, a packet creation unit to create a packet that includes the transaction, the first node ID, the TID and a second node ID corresponding to the requestor.

Abstract: A method and system for handling received out-of-order network data using generic buffers for non-posting TCP applications is disclosed. When incoming out-of-order data is received and there is no application buffer posted, a TCP data placement may notify a TCP reassembler to terminate a current generic buffer, allocate a new current generic buffer, and DMA the incoming data into the new current generic buffer. The TCP data placement may notify the TCP reassembler the starting TCP sequence number and the length of the new current generic buffer. Moreover, the TCP data placement may add entries into a TCP out-of-order table when the incoming data creates a new disjoint area. The TCP data placement may adjust an existing disjoint area to reflect any updates. When a TCP application allocates or posts a buffer, then the TCP reassembler may copy data from a linked list of generic buffers into posted buffers.

Abstract: Provided are techniques for storing local versions of a data set. A first number that indicates how many local versions of the data set are to be stored in local storage given an amount of available local storage is received. It is determined whether a second number that indicates a total number of local versions of the data set that the local storage is capable of storing exceeds the first number. In response to determining that the second number exceeds the first number, the amount of local storage that is capable of storing the first number of local versions of the data set is used.

Abstract: An example embodiment of the present invention provides processes relating to a cache coherence protocol for distributed shared memory. In one process, a DSM-management chip receives a request to modify a block of memory stored on a node that includes the chip and one or more CPUs, which request is marked for fast invalidation and comes from one of the CPUs. The DSM-management chip sends probes, also marked for fast invalidation, to DSM-management chips on other nodes where the block of memory is cached and responds to the original probe, allowing the requested modification to proceed without waiting for responses from the probes. Then the DSM-management chip delays for a pre-determined time period before incrementing the value of a serial counter which operates in connection with another serial counter to prevent data from leaving the node's CPUs over the network until responses to the probes have been received.

Abstract: A system for sharing block data includes a non-removable device for storing block data (e.g. a hard drive) that is networked with a plurality of computers. Each computer can initiate discovery commands and read/write commands, and transmit these commands over the network to the non-removable storage device. Computer commands are intercepted and processed by a logical algorithm program at the storage device. One function of the logical algorithm program is to instruct each computer to treat the non-removable block storage device as a removable block device. Because the computers treat the storage device as a removable block device, they relinquish control of the device (after use) to other computers on the network. The logical algorithm program also functions to allocate temporary ownership of the block storage device to one of the computers on the network and passes temporary ownership from computer to computer on the network.

Abstract: Methods and apparatus provide for receiving a request from an initiating device to initiate a data transfer into a local memory for execution of one or more programs therein, the local memory being operatively coupled to a first of a plurality of parallel processors capable of operative communication with a shared memory; facilitating the data transfer into the local memory; and producing a synchronization signal indicating that the data transfer into the local memory has been completed.

Abstract: Provided is a system and method for directing group communication in a system environment that has a plurality of discrete application nodes networked with at least one discrete memory node, establishing a shared memory providing a passive message queue. A code library permits an application node member of a group to assemble a message selected from the group of send, join, leave, or read. The send, join and leave messages permit a first application node to add a message to the queue for all members of a group including the first application node at the time the message was added. The instruction set permitting the addition of the message is executed atomically.

Abstract: An algorithm extracts a company ID from a LAN MAC address corresponding to a cable modem connected to a CMTS, cross-references the company ID to a corresponding company name in a company-name database, and then displays the company name in a command line user interface.

Abstract: A node in a multi-node system includes a memory, an active device that includes a cache, an interface that sends and receives coherency messages on an inter-node network coupling the node to another node, and an address network that communicates address packets between the devices in the node. In response to receiving a coherency message from the other node requesting an access right to a coherency unit, the interface sends an address packet on the address network. The address packet is a first type of address packet if the coherency unit is in the modified global access state in the node and a second type of address packet otherwise. If the active device is the owner of the coherency unit, the active device responds to the first type of address packet and ignores the second type of address packet.

Abstract: A storage area network and method for defining a static Fibre Channel Fabric that does not require a Principal Switch. The storage area network comprises one or more hosts, one or more storage devices, and a static Fabric connecting the one or more hosts and storage devices. Within the static Fabric, the Switches have their Domain_ID and Fabric_Name statically set. The method comprises accessing the Fabric, selecting a Switch in the Fabric, and statically configuring the Domain_ID and Fabric_Name for the selected Switch. The above sequence is repeated for each Switch in the static Fabric. In one embodiment, after being statically configured, the Switch is isolated from any dynamically set Switches in the Fabric. The Switch detects which of its Ports are connected to dynamically set Switches, and then isolates them, while maintaining operational the Ports connected to statically configured Switches.

Abstract: A tiered distribution service is provided in a content delivery network (CDN) having a set of surrogate origin (namely, “edge”) servers organized into regions and that provide content delivery on behalf of participating content providers, wherein a given content provider operates an origin server. According to the invention, a cache hierarchy is established in the CDN comprising a given edge server region and either (a) a single parent region, or (b) a subset of the edge server regions. In response to a determination that a given object request cannot be serviced in the given edge region, instead of contacting the origin server, the request is provided to either the single parent region or to a given one of the subset of edge server regions for handling, preferably as a function of metadata associated with the given object request. The given object request is then serviced, if possible, by a given CDN server in either the single parent region or the given subset region.

Abstract: A network interface adapter includes a network interface and a client interface, for coupling to a client device so as to receive from the client device work requests to send messages over the network using a plurality of transport service instances. Message processing circuitry, coupled between the network interface and the client interface, includes an execution unit, which generates the messages in response to the work requests and passes the messages to the network interface to be sent over the network. A memory stores records of the messages that have been generated by the execution unit in respective lists according to the transport service instances with which the messages are associated. A completion unit receives the records from the memory and, responsive thereto, reports to the client device upon completion of the messages.

Abstract: A network device implements congestion management of sessions of a network protocol. In one implementation, an incoming request component receives session requests for a negotiation session between the network device and a second network device. A capacity pool stores a value relating to capacity of the network device to continue to efficiently process the session requests. New sessions are initiated when the value stored in the capacity pool is less than an estimate of the capacity of the network device at which the network device maximizes processor usage while minimizing session timeouts.

Abstract: Systems, methods, and products provided for facilitating the reuse of data blocks. In one implementation, a registration server receives request data objects from programs that request use of a data block. When the data block is not already registered with the registration server, the registration server registers the data block, for example in a list of registration data objects. A registration handle object is returned to the requesting program and provides a reference to the resources for accessing the data block. The present invention facilitates efficient use of resources in connection with multiple requests for a data block because resources needed for handling the binary data block are not duplicated.

Abstract: An information processing apparatus includes a storage unit including plural memory banks, a wireless communication unit for executing the wireless communication process, a communication quality information storage unit for storing the communication quality information indicating the communication quality of the wireless communication unit in the case where one of the plural memory banks is used, a memory bank selection unit for selecting the memory bank based on the communication quality information stored in the communication quality information storage unit in the case where the wireless communication process is executed by the wireless communication unit, and a memory bank switching unit for switching to the memory bank selected by the memory bank selection unit.

Abstract: An object of this invention is to speed up file access and shorten the switching time upon failure. There is provided a computer system with plural storage systems and plural servers, in which: the storage systems each have a disk drive for storing files read/written by the servers and a storage control device, which has an interface connected to the servers via a network and a controller for controlling file read/write in the disk drive; the storage control device and the servers each have a cache memory, which temporarily stores files read/written by the servers, and a file cache control information unit, which keeps information of files stored in the cache memory; and the file cache control information unit holds information indicating whether or not a file is stored in the cache memory of the storage control device and/or the cache memories of the servers.

Abstract: A method and a system allow presentation of web pages to an internet appliance (e.g., a hand-held computer, a mobile telephone, or a digital personal assistant) according to user preferences. The user preferences are captured by a management server, which provides a web page customization service in conjunction with a document manager, which parses the web pages to identify information units. The customized web pages are stored in a database using a standardized hypertext document representation device, such as XML. The customized web pages are accessible from a portal adapted for accessing by the internet appliance. In one implementation, the user is also offered pre-configured resources for frequently used services when accessing the portal using the internet device.

Abstract: There is disclosed apparatus and methods of multicasting in a shared address space. A shared memory address space may include two or more multicast portions. Each multicast portion may be associated with a respective end point and with at least one other multicast portion. Data units may be transmitted to at least some of the end points via memory-mapped I/O into the shared memory address space. When a destination address of a data unit is in a first multicast portion associated with a first end point, the data unit may be transmitted to the first end point, revised to specify a destination address in a second multicast portion associated with the first multicast portion, and transmitted to a second end point associated with the second multicast portion.

Abstract: Applications, systems and methods for efficiently accessing and controlling data of devices among multiple computers over a network. Strategic cache management processes are provided to manage the data in cache memory of the storage devices involved. Communication of data over the network may be managed by means of one or more connection servers which may also manage any or all of authentication, authorization, security, encryption and point-to-multipoint communications functionalities. Alternatively, computers may be connected over a wide area network without a connection server, and with or without a VPN. Data transmissions may be managed to minimize bandwidth and may be temporally and/or spatially compressed.

Abstract: A method, a system, an apparatus, and a computer program product are presented for a fragment caching methodology. Within the request path from a client to a server, a first computing device may attach to a request message a message header that indicates that the first computing device supports fragment processing; a second computing device within the request path processes this request message. When the second computing device receives a response message corresponding to the request message, it can check for a message header directive that indicates that it should cache the response message's fragment only if the response path does not have at least one computing device that supports the processing of fragments; if so, then it forwards the response message without caching its contained fragment.

Abstract: The present invention allows notification of information held by a first computer to a second computer even if the first computer and the second computer are not communicably connected. The first server 1 sends information which is used when the second server ii backs up (hereafter called catalog information) to the first storage system 21. The first storage system 21 converts the received catalog information into an electronic file having a predetermined file name and writes it to the PVOL 45, and writes the data group including the catalog information in the PVOL 45 to the SVOL 145 in the second storage system 121. The second server II acquires the catalog information from the SVOL 145 by searching the predetermined file name in the SVOL 145, and backs up the data in the SVOL 145 using the acquired catalog information.

Abstract: A method for controlling a storage system having first and second switches and a storage device connected to the switches via a network in response to a request from a host, the storage device having first and second areas, each of the first and second switch accessing to the first and second area, the method includes, receiving a request for copying data stored in the first area to the second area from the host, transmitting initiation notification of the copying to the second switch, executing the copying by the first switch, maintaining progress status of the copying, controlling the second switch to refer to the progress upon receiving a request for access to the first or second area by the host before completion of the copying, and determining whether to permit access to the first or second area by the second switch.

Abstract: A method, apparatus and computer product that, in a system having a client computer, and apparatus for connecting the client computer to a network having a server for backing up the client computer, enables transferring data from the client computer to the server, by connecting the client computer to the network; backing up data on the client computer to a storage device attached to the network when the client computer is connected to the network; and transferring the data from the storage device to the server, preferably at a time determined by the server.

Abstract: A system architecture for managing a group of heterogeneous workstations that may be widely dispersed geographically. A system according to the present teachings enables users to access remote workstations and run applications on the remote workstations transparently and enables seamless integration of remote desktop sharing and distributing desktops among heterogeneous workstations. The system also provides enforcement of protections among user and workstations, user account management and workstation allocation management. The present architecture is platform independent and enables workstations to be accessed from anywhere using a graphical user interface through the Internet.

Abstract: A method for a computer system includes determining a dependency graph for a user-selected aggregate asset comprising a plurality of nodes, determining node types for the plurality of nodes, when a first node of the plurality of nodes comprises a file-level asset node, the method includes determining first status data associated with the first node, when a second node of the plurality of nodes comprises an aggregate asset node, the method includes determining a plurality of file-level asset nodes that are children nodes of the aggregate asset node, and determining status data associated with each of the plurality of file-level asset nodes, aggregating the first status data and the status data associated with the plurality of file-level asset nodes to form status data for the aggregate asset for the user.

Abstract: A system and method is disclosed for failure recovery and communications in a shared storage system. The shared storage system includes at least two host nodes, each of which includes two ports. Each of the ports of each of the nodes is coupled to input ports of a storage enclosure. The input ports of the storage enclosures are in turn coupled to one another to form communications links between each of the host nodes. When the communications links between the host nodes fail, the host nodes are able to pass configuration information to each other by saving configuration information to a central location in a shared storage, such as a dedicated location in one of the storage drives of the storage enclosure that is directly coupled to both host nodes. The host nodes are able to force their peer nodes to read configuration changes before accessing possibly corrupted data from a previous configuration.

Abstract: Systems, methods, and computer program products are presented for transiently clearing a reservation on a device, where the reservation belongs to a host that owns the device and the reservation blocks a host that does not own the device from performing an operation with the device. The reservation is cleared transiently by the host that does not own the device. While the reservation is cleared, the operation is performed with the device using the host that does not own the device.

Abstract: A method of controlling a buffer for reducing jitter in a packet network is provided, with a fast attack and a slow decay time to track delay changes in the network. The principal function of the method for controlling the jitter buffer is to minimize the delay within the buffer and use packet loss compensation in the event that the buffer enters an underflow condition.

Abstract: Non-mutating tree-structured file identifiers are used to identify files stored in a file system. Each of multiple files in the file system has a corresponding non-mutating file identifier, and these file identifiers are assigned and maintained using a tree structure.

Abstract: A remote management system is coupled to a target information handling system so that a virtual device on the remote system can transmit information such as software, data, applications and upgrades to the target system. The target system includes a local real device such as a media drive which is switchably coupled to a channel of the target system. Upon command from the remote management system the target system switches the channel from a connection with the local real device to a connection with the remote virtual device. Software installations by a remote operator at the remote system are thus facilitated. In this manner the channel is shared between the local real device and the remote virtual device.

Abstract: A method and apparatus for enhanced data storage in peer-to-peer (P2P) networks. Users subscribe to a P2P storage network that allows each user to store files on the storage network by swapping blocks of the user's files with blocks from storage of a peer, or peers, on the network. A user desiring to utilize the storage network for a certain data block must take back an equal, or substantially equal, storage block from another peer on the network thereby insuring no net change, or minimal net change, in total storage across the P2P storage network. In addition, the diffusion of data blocks throughout the storage network is employed whereby individual peers swap data blocks on a random basis thereby further enhancing the security of the swapped blocks from direct attacks.

Abstract: A distributed data system may include nodes hosting at least one multi-threaded process operable to access portions of distributed data. A lock mechanism may grant locks to multi-threaded processes for portions of the distributed data. Only a process holding a lock may access a portion corresponding to the lock. Threads of other processes may not access the portion. A process may include one or more threads that may acquire a locks for the distributed data portion on behalf of the process. In one embodiment, the lock mechanism may allow any thread of a process release a lock held by the process. In embodiments, the last thread to access the distributed data portion corresponding to the lock may release the lock in response to no more threads of the process require access to the distributed data portion and/or in response to a request to release the lock.

Abstract: A computer implemented method of computer implemented method for installing a code object in a user process virtual memory space, while the user process is running is provided. The user process is run in a virtual memory space. A controller process is run in a different virtual memory space than the user process. The control process requests to a kernel module to install the code object into the virtual memory space of the user process. The kernel module installs the code object into the virtual memory space of the user process, while the user process is running.

Abstract: A system and method for efficiently linking together replicas of a storage object. The location of a first replica of the storage object may be stored on a node in a network. When new replicas of the storage object are created, the node that stores the new replica may efficiently lookup the location of the first replica and utilize the location information to perform an efficient process to link the new replica to the first replica and any other existing replicas by causing routing information to be created on various nodes.

Abstract: The invention provides a system and method for providing virtual directories for servlets, particularly for use by many different Web applications that share common files and resources, and that are intended for providing those resources to large numbers of users. Virtual directories provide a mechanism for automatically changing the root folder from the default Web application (webapp) root document folder (docroot) to a virtual directory or folder, in response to certain http/URL requests. The purpose of the feature is to allow the developer to configure different document roots for certain requests. By doing this they can direct certain kind of requests (particularly those for common resources) to a common document root. Virtual directories ensure that common resources do not have to be copied for all web applications separately, and the burden on the server itself is minimized.

Abstract: On at least one of computers constituting a plurality of nodes on a network N, a management information file representing links between nodes is stored. The computer of each node stores, into a predetermined memory area on the network, digital information pieces generated on the computer. The computer sends the stored digital information pieces to the network N, in response to a request from another computer. The computer which issued the request obtains, from the network N, the sent digital information pieces and the management information file and visualizes the obtained digital information pieces in a view particular thereto; the visualization is carried out on the basis of relations between the request-issuing computer node and the computer node storing the obtained digital information pieces, wherein the relations are identified by the use of the management information file.

Abstract: A method and apparatus for a multiprocessor system to simultaneously process multiple data write command issued from one or more peripheral component interface (PCI) devices by controlling and limiting notification of invalidated address information issued by one memory controller managing one group of multiprocessors in a plurality of multiprocessor groups. The method and apparatus permits a multiprocessor system to almost completely process a subsequently issued write command from a PCI device or other type of computer peripheral device before a previous write command has been completely processed by the system. The disclosure is particularly applicable to multiprocessor computer systems which utilize non-uniform memory access (NUMA).

Abstract: A computer system having a plurality of host computers and a storage system is provided which allows any one host computer to perform a global copy operation on any arbitrary or all storage areas in the storage system. To this end, storage areas provided by the disk devices are grouped into groups by allocating group numbers to a plurality of specified storage areas. The copy operation can be performed by specifying desired groups. Each of the groups is made up of sub-groups and the sub-groups are defined for each computer to assure a consistency of copy order of the sub-groups.

Abstract: A method of restoring data in a computer network system wherein a plurality of client systems have access to a storage pool coupled to an associated storage area network (SAN) includes: requesting a restore wherein each of the plurality of client systems may participate in the restore; and coordinating access to the data stored in the storage pool by tracking a plurality of data portions of the data to be restored and by blocking access to each of the plurality of data portions that have been restored by one of the plurality of client systems to avoid duplicative restoration efforts. A master restore table may also be constructed to assist with coordinating access to the stored data. A computer network system configured to coordinate a restore request where a plurality of client systems may participate in the restore is also provided.

Abstract: A system in accordance with an embodiment of the invention provides Quality of Service (QoS) for Storage Access. Such QoS is partially enabled in one embodiment by the automatic pooling of storage devices and provisioning virtual targets from those pools. QoS is enforced in one embodiment by keeping the bandwidth for each connection within a specified range, and particularly, by controlling the number of allowed concurrent requests from an initiator. Load balancing is also provided in one embodiment, improving response times for requests, further easing the ability to provide QoS.

Abstract: This invention is a system and method for network management for data transfer which may include replication in a data storage environment. It is useful for managing network allocation of resources (e.g., bandwidth) needed for such replication of data in a data storage environment. The invention is particularly useful with a network using an internet protocol environment and allows for management of bandwidth needed for a replication process. The method includes the steps of requesting from a server for services on an internet network, a bandwidth for data transfer over the internet. The data is transferred in response to a bandwidth allocation from the server based on the request. The network traffic characteristics (e.g. packet loss or latency, and session time outs) are monitored during the data transfer. If the process lags behind more bandwidth is allocated.

Abstract: A method of migrating data from an old storage subsystem to a new storage subsystem in a data processing system which comprises host computers and storage subsystems. There is provided a route-changing phase before the data is migrated from the old storage subsystem to the new storage subsystem. In the route-changing phase, each host computer can access both the old and new storage subsystems and the new storage subsystem writes data into the old storage subsystem in response to a write request from the host computer and reads data from the old storage subsystem and sends the data to the host computer in response to a read request from the host computer.