Abstract: An order allocation algorithm maximizes throughput by reducing the number of stops that a container makes in the process of fulfilling a customer order. This is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. Ultimately, all items in the customer order are assigned a pod. The collection of pods defines a container path through the distribution center.

Abstract: A client device (701) of a communication system (700) includes, for example, a processor (304) programmed to include a device management tree wherein the processor is operative to receive security policy information (1000), such as that associated with a non-server entity, such as an application on the device, for example, and updates the device management tree with the received security policy information (1002). The device management tree is then accessed in response to a security policy access request, such as from a application or other non server entity during runtime of the wireless client device (1004). As such, not only does the device management tree include external security policy subjects, such as server identities, but different internal security policy subjects are also used to configure a device management tree with suitable security policy enforcement information.

Abstract: Order allocation techniques that reduce the number of stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. Ultimately, all items in the customer order are assigned a pod. The collection of pods defines a container path through the distribution center.

Abstract: A communication unit (101) includes a transceiver (105) for communication over a communication network (107), and a processor (103). The processor (103) can install software components, including a first software component and a second software component. Responsive to a boot, the processor (103) can verifying the first software component against a first pre-determined value corresponding to at least the first software component; and subsequent to completion of the boot, verify the second software component against a second pre-determined value corresponding to at least the second software component.

Abstract: A mobile device having a framework (901) comprising a logical device management tree (903), a device management engine (905), and a plurality of application specific logical device management sub-trees (907, 909) logically connected to the logical device management tree.

Abstract: A wireless communication network 104, and a method thereof, comprising a server (110, 210) that generates (706) a patch, a wireless communication device (102, 216) comprising a transceiver (302) that receives (804) the patch and a processor (304) that processes the patch. The patch identifies one of a same command, a change command and a difference command. The same command indicates an unchanged file. The change command indicates a changed file. The difference command indicates that data submitted in this command has been differenced by a file-level difference based on a file extension. The processor (304) of the wireless communication device (102, 216) scans (806) the patch for any difference commands indicating that data submitted in this command has been differenced by a file-level difference based on a file extension.

Abstract: A client device (701) of a communication system (700) includes, for example, a processor (304) programmed to include a device management tree interface (702) that provides access for a plurality of non device management agents (210, 618) and at least one device management agent (208) to a device management engine (222) that accesses a corresponding device management tree (226). The processor updates data, for the plurality of non device management agents and at least one device management agent, via the device management engine (222) and corresponding device management tree (226), through the device management tree interface (702).

Abstract: A client device (102) of a communication system (100) comprising a provisioning and management framework (206). The framework (206) receives (404) a client provisioning document from a source (110), and the client provisioning document includes a device management characteristic. The client device (102) then identifies (408) a device management characteristic from the client provisioning document. Thereafter, the client device (102) provides (424) data based on the device management characteristic of the client provisioning document to a device management tree (226, 426).

Abstract: A processor (304) of a wireless communication device (102, 216) scans (806) a patch for any difference commands indicating that data submitted in this command has been differenced by a file-level difference based on a file extension. Memory (306) contains data representing a device management tree (DMT). The processor (304) updates data of the device management tree to provide dynamic update of the DMT to facilitate software updates based on the patch.

Abstract: A communication architecture for performing work in a distributed computing environment involves client processes on client nodes sending work requests to a director. The director examines the work requests to determine one or more resources required to perform the work as well as one or more server nodes that can provide the required resources. The director then forwards the work requests to server processes on the server nodes that can provide the required resources. The work requests provided to the server processes specify that the work results are to be provided directly from the server processes to the client processes that made the work requests. The director maintains a table of resource data that specifies the services and/or resources that are provided by and/or made available on the server nodes in the distributed computing environment.

Abstract: A method and system for reducing overhead associated with recovering after a failure. According to the method, a checkpoint value is maintained that indicates which records of a plurality of records have to be processed after the failure. The plurality of records contain change information that corresponds to a plurality of data blocks. A target checkpoint value is determined based on a desired number of data block reads that will be required during a redo phase of recovery. Changes contained in volatile memory are then written to nonvolatile memory to advance the checkpoint value to at least the target checkpoint value.

Abstract: A method and system for reducing overhead associated with recovering after a failure. According to the method, a checkpoint value is maintained that indicates which records of a plurality of records have to be processed after the failure. The plurality of records contain change information that corresponds to a plurality of data blocks. A target checkpoint value is determined based on a desired number of data block reads that will be required during a redo phase of recovery. Changes contained in volatile memory are then written to nonvolatile memory to advance the checkpoint value to at least the target checkpoint value.

Abstract: A warehouse management system that maximizes throughput and reduces carrying costs by reducing the number of stops that a container makes in the process of fulfilling a customer order. This is accomplished by allocating inventory to orders using the following series of considerations. First, the system selects a pod in order to maximize throughput. If there are multiple locations within the pod that stock the same inventory item, then the method chooses one of those locations based upon the expiration date. Finally, if multiple of these locations have units that expire within the same expiration period, the location with the fewest units is chosen.

Abstract: A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.

Abstract: A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.

Abstract: A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.

Abstract: A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.

Abstract: A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.

Abstract: A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.

Abstract: A method and system are provided for reconfiguring a multiple node system after an epoch change in a manner that reduces the overhead and system unavailability typically incurred during reconfiguration. A resource-to-master mapping is established using the combination of a resource-to-bucket hash function and a bucket-to-node hash function. The resource-to-bucket hash function is not changed in response to an epoch change. The bucket-to-node hash function does change in response to epoch changes. Techniques are disclosed for adjusting the dynamic bucket-to-node hash function after an epoch change in a manner that load balances among the new number of nodes in the system. Further, the changes to the bucket-to-node assignments are performed in a way that reduces the number of resources that have to be remastered. In one embodiment, only those resources that lose their masters during an epoch change are assigned new masters during an initial reconfiguration.