921 results about "Dynamic resource" patented technology

Certain embodiments enable resources assigned or allocated to an operating virtual machine (VM) to be modified while the VM is operating and without having to stop, restart, or reboot the VM. The modification may correspond to increasing or decreasing the amount of a resource being assigned to the VM. In this manner, resources assigned to a VM at the time of creation of the VM are not static and can instead be dynamically changed while the VM is operating without having to stop, reboot, or restart the VM. In some embodiments, the changes to the resources allocated to one or more VMs provided for a user (e.g., a customer) may be made according to or in response to a Service Level Agreement (SLA) entered into by the user, in response to an event such as a failover or switchover event, and the like.

Embodiments of the invention address deficiencies of the art in respect to dynamic computing resource allocation, and provide a method, system and computer program product for dynamic resource allocation for disparate application performance requirements. In one embodiment of the invention, a resource allocation data processing system can include a shared resource pool including resources and a resource configurator coupled to the shared resource pool. The system further can include a service processor coupled to the resource configurator, wherein the service processor can include an application programming interface (API) exposing methods for commanding the resource configurator to configure the resources in the shared resource pool.

A virtual computer system including a reallocation means, in which a plurality of LPAR are operated by logically dividing physical resources composing a physical computer exclusively or in time dividing manner so as to dynamically change reallocation of physical resources among each of LPARs. Based on load conditions measured by an application or an OS of each LPAR, physical resource allocation to each LPAR is determined, thereby conducting reallocation of LPAR.

A method for realizing dynamic allocation of channel processing resources and load balancing in a centralized base station is disclosed, said centralized base station comprising a plurality of channel processing units independent of each other and remote radio frequency units connected to said channel processing units. The method comprises: dividing a plurality of cells under control of said centralized base station into a plurality of cell groups that are geographically adjacent and are centralized in the same regions different channel processing units performing channel processing of corresponding cell groups, respectively, wherein the channel processing units which are responsible for processing geographically adjacent cell groups are an adjacent channel processing unit for each other; determining a processing load amount of the respective channel processing units and traffic of the respective cells; and adaptively adjusting the cell groups for which the respective channel processing units are responsible for performing channel processing based on the determined processing load amount of the respective channel processing units and the determined traffic of the relevant cells, thereby balancing processing loads of the respective channel processing units. The method can effectively utilize the channel processing resources.

In an embodiment, the systems, methods, and devices disclosed herein comprise a computer resource monitoring and allocation system. In an embodiment, the resource monitoring and allocation system can be configured to allocate computer resources that are available on various nodes of a cluster to specific jobs and/or sub-jobs and/or tasks and/or processes.

A method and system for achieving stability while reallocating resources in a logically partitioned environment. The present invention comprises Performance Enhancement Program (PEP), Classification Program (CP), System Analysis Program (SAP), and System Evaluation Program (SEP). PEP allows a user to enter several performance parameters. CP classifies each of the virtual systems in the managed system based on their workload. SAP analyses the managed system to determine the configuration of the managed system. Managed systems configurations are classified according to the reciprocity of resource allocation and the overall symmetry of the managed systems. SEP evaluates the configuration of the managed system and recommends alterations for improved performance of the managed system. The managed system will be optimized when the functional differentiator (FD) of the virtual systems is small enough to allow reallocation of resources without an unacceptable sacrifice in managed system stability.

A mobile communication system and method utilizing Orthogonal Frequency Division Multiplexing (OFDM) receives channel quality information (CQIs) for subcarriers through which reference signals are transmitted and subcarriers through which data signals are transmitted, in subbands, each including a predetermined number of subcarriers among a plurality of the subcarriers. The CQIs are fed back from respective receivers. Resources are dynamically assigned to the respective receivers according to the feedback CQIs, thereby enabling dynamic resource assignment with minimized signaling overhead.

A method and system for capacity and coverage enhancement in wireless networks is provided. Each cell has a base station and in-cell relay stations. The base station includes interference avoidance/averaging mechanism, dynamic resource partitioning mechanism or a combination thereof. The interference avoidance/averaging mechanism dynamically creating a FH pattern based on interference information obtained from its serving cell. The base station may include a scheduler for dynamic resource partitioning mechanism for managing scheduling in the cell.

A resource allocation method for use in a wireless ATM network comprises receiving on a wireless signaling channel a request for access to a shared frequency-time sliced wireless medium. A channel matrix is then searched for a set of available frequency-time slots. The channel matrix represents a time frame within the shared frequency-time sliced wireless medium, and is used to keep track of resource allocation in the time-frequency sliced medium. The set of available time-slots is then allocated if the allocation does not violate a frequency switching constraint, and if the set of available frequency-time slots contains a number of slots no smaller than a requested number of slots. In a preferred embodiment of the invention, the searching step uses a greedy resource allocation strategy to search a channel-chunk matrix comprising a list of contiguous chunks of available time slots in each frequency of the shared frequency-time sliced wireless medium. The greedy resource allocation strategy comprises the following successive allocation steps: searching for a single contiguous set of available time slots in a single frequency, where the size of the set of available slots is equal to the requested size [60]; searching for a single contiguous set of available time slots in a single frequency, where the size of the set of available slots is greater than the requested size [64]; searching for separate chunks of available time slots in a single frequency [66]; and searching for separate chunks of available time slots in multiple frequencies [68]. Each allocation step comprises checking whether the allocation violates a frequency switching constraint.

A multi-service network switch capable of providing multiple network services from a single platform. The switch incorporates a distributed packet forwarding architecture where each of the various cards is capable of making independent forwarding decisions. The switch further allows for dynamic resource management for dynamically assigning modem and ISDN resources to an incoming call. The switch may also include fault management features to guard against single points of failure within the switch. The switch further allows the partitioning of the switch into multiple virtual routers where each virtual router has its own set of resources and a routing table. Each virtual router is further partitioned into virtual private networks for further controlling access to the network. The switch supports policy based routing where specific routing paths are selected based on a domain name, a telephone number, and the like. The switch also provides tiered access of the Internet by defining quality of access levels to each incoming connection request. The switch may further support an IP routing protocol and architecture in which the layer two protocols are independent of the physical interface they run on. Furthermore, the switch includes a generic forwarding interface software for hiding the details of transmitting and receiving packets over different interface types.

The invention provides apparatus and methods for a Virtual Private Network (VPN) in a network that offers a simple user interface for efficient utilization of network resources. The VPN is defined for a specified set of endpoints each of which is associated with a single “hose.” A hose provides access to the VPN through an access point which may be a node of the network, for example. The hose is a single interface to the VPN for communication to all other endpoints of the VPN. The VPN achieves network resource allocation efficiency by exploiting resource sharing possibilities via multiplexing routing paths between endpoints and dynamic resource allocation techniques that permit real time resource allocation resizing. When a VPN is established with a VPN service provider, the routing paths between the endpoints of the VPN is optimized for multiplexing opportunities so that resource allocations between nodes along routing paths within the IP network is reduced to a minimum.

It is provided a method, comprising assigning a first direct resource of a radio interface to a first vehicle-to-vehicle service based on a resource information received from a base station in a cellular mode via a cellular resource of the radio interface, wherein, in the resource information, the first direct resource and the first vehicle-to-vehicle service are indicated as being correlated, and the first vehicle-to-vehicle service is to be used or to be provided by at least a first one of one or more vehicle devices, and wherein, in the cellular mode, a communication of an apparatus performing the method with each of the one or more vehicle devices different from the apparatus is performed via the base station; performing the first vehicle-to-vehicle service via the first direct resource in a vehicle-to-vehicle mode, wherein, in the vehicle-to-vehicle mode, the communication of the apparatus with each of the one or more vehicle devices is performed directly with the respective vehicle device and does not involve the base station.

A method for resource allocation in an FDMA communication system is disclosed in which the resource allocation method includes distinguishing a dynamic resource allocation service, an amount of resource allocation for which changes every transmission time, and a static resource allocation service, an amount of resource allocation for which is fixed every transmission time; determining a start point of the static resource allocation service in a one-dimensionally arranged logical resource, and sequentially allocating resources for each static resource allocation service; and allocating resources left after the static resource allocation, to the dynamic resource allocation service in a reverse direction as that of the static resource allocation service, starting from a last resource located in the opposite side of static resources for the static resource allocation service in the one-dimensionally arranged logical resource.

In one embodiment, the present invention is a method for allocation of finite computational resources amongst multiple entities, wherein the method is structured to optimize the business value of an enterprise providing computational services. One embodiment of the inventive method involves establishing, for each entity, a service level utility indicative of how much business value is obtained for a given level of computational system performance. The service-level utility for each entity is transformed into a corresponding resource-level utility indicative of how much business value may be obtained for a given set or amount of resources allocated to the entity. The resource-level utilities for each entity are aggregated, and new resource allocations are determined and executed based upon the resource-level utility information. The invention is thereby capable of making rapid allocation decisions, according to time-varying need or value of the resources by each of the entities.

A multi-service network switch capable of providing multiple network services from a single platform. The switch incorporates a distributed packet forwarding architecture where each of the various cards is capable of making independent forwarding decisions. The switch further allows for dynamic resource management for dynamically assigning modem and ISDN resources to an incoming call. The switch may also include fault management features to guard against single points of failure within the switch. The switch further allows the partitioning of the switch into multiple virtual routers where each virtual router has its own set of resources and a routing table. Each virtual router is further partitioned into virtual private networks for further controlling access to the network. The switch's supports policy based routing where specific routing paths are selected based a domain name, a telephone number, and the like. The switch also provides tiered access of the Internet by defining quality of access levels to each incoming connection request. The switch may further support an IP routing protocol and architecture in which the layer two protocols are independent of the physical interface they run on. Furthermore, the switch includes a generic forwarding interface software for hiding the details of transmitting and receiving packets over different interface types.

A platform that may be used to dynamically reallocation resources to support an Internet application is disclosed. In an embodiment, the platform may include two layers of distribution, one at the DNS layer and one at an Internet data center layer. The platform may include a dynamic resource allocation manager that causes instances of applications to be initiated in Internet data centers in response to dynamic conditions and characteristics of the application. A monitoring system module may be provided to keep the dynamic resource allocation manager informed as the health and utilization of instances of the application.

A dynamic resource allocation method in an OFDMA system is provided. A base station determines if each of a plurality of SSs supports subchannel-based dynamic resource allocation. If an SS supports the subchannel-based dynamic resource allocation, the base station allocates resources to the SS on a subchannel basis. If the SS does not support the subchannel-based dynamic resource allocation, the base station allocates resources to the SS on a burst basis.

A multi-service network switch capable of providing multiple network services from a single platform. The switch incorporates a distributed packet forwarding architecture where each of the various cards is capable of making independent forwarding decisions. The switch further allows for dynamic resource management for dynamically assigning modem and ISDN resources to an incoming call. The switch may also include fault management features to guard against single points of failure within the switch. The switch further allows the partitioning of the switch into multiple virtual routers where each virtual router has its own wet of resources and a routing table. Each virtual router is further partitioned into virtual private networks for further controlling access to the network. The switch's supports policy based routing where specific routing paths are selected based a domain name, a telephone number, and the like. The switch also provides tiered access of the Internet by defining quality of access levels to each incoming connection request. The switch may further support an IP routing protocol and architecture in which the layer two protocols are independent of the physical interface they run on. Furthermore, the switch includes a generic forwarding interface software for hiding the details of transmitting and receiving packets over different interface types.

Dynamic resource allocation systems, apparatus, and methods are disclosed for selectively improving the ability of a receiver to determine a channel estimate in an Orthogonal Frequency Division Multiple Access (OFDMA) system. A wireless communication system can use a common pilot channel configuration to aid channel estimation in one or more receivers in communication with the system. A receiver in communication with the system may be unable to demodulate received data due to an inaccurate channel estimate. The receiver can communicate to a transmitter in the system a request for additional channel estimation resources. The wireless communication system can provide additional channel estimation resources by inserting dedicated pilot channels into one or more of the frequencies allocated to symbols for the receiver. If the receiver is still unable to demodulate received data, the wireless communication system can incrementally insert additional pilot channels in the symbol associated with the receiver.

Embodiments of the present invention provide a dynamic resource allocator to allocate resources performance optimization in, for example, a computer system. The dynamic resource allocator to allocate a resource to one or more threads associated with an application based on a performance rate. Embodiments of the present invention may further include a performance monitor to monitor the performance rate of the one or more threads. The dynamic resource allocator to allocate an additional resource to the one or more threads, if the thread is performing above a performance threshold. In embodiments of the present invention, the dynamic resource allocation strategy may be decided based on, for example, optimizing the overall system throughput, minimizing power consumption, meeting system performance goals (e.g., real time requirements), user specified performance priorities and/or application specified performance priorities.

A wireless communication network uses backhaul negotiation based upon static and dynamic resource assignment on jamming graphs. Static reuse factor design methods including fractional frequency reuse (FFR) are addressed. The jamming graph is used to summarize the interfering relationship between transmitters (nodes in the jamming graph). Negotiation-based algorithm is used to arrive at a static resource assignment so that a large reuse factor can be achieved while jamming scenario can be avoided. As a result of such algorithm, each transmitter is assigned some resources, over which traffic transmission can be done instantaneously to reduce the packet delay for short packets. Based on the result of static resource negotiation algorithm, a dynamic resource algorithm can be run, such that the resources assigned to different nodes can be share in a bursty traffic scenario to further reduce packet delay for larger packet size cases, while jamming be also avoided.

A packet-switched data network is disclosed that includes a dynamic resource reservation adjustment module that adjusts unicast data flows in reserved resources of the data network to maintain an optimal level of QoS for an application session. A receiver node obtains a reservation for a plurality of unicast packet flows from various routers on the data network. The receiver node also makes a partial reservation for a predetermined amount of bandwidth on each respective router to compensate for one of the unicast packet flows if a respective router experiences a bottleneck.

A method suitable for optimizing allocation of resources, in support of k users, in a multi-processor time-shared computer system. The method includes the steps of inputting data comprising current job requirements; operating upon the current job requirements for determining required resources; storing said required resources for subsequent processing by a resource allocator; and executing the required resources for generating a resource allocation for said k users.