Abstract: Various aspects are disclosed for unified resource management of containers and virtual machines. A podVM resource configuration for a pod virtual machine (podVM) is determined using container configurations. The podVM comprising a virtual machine (VM) that provides resource isolation for a pod based on the podVM resource configuration. A host selection for the podVM is received from a VM scheduler. The host selection identifies hardware resources for the podVM. A container scheduler is limited to bind the podVM to a node corresponding to the hardware resources of the host selection from the VM scheduler. The podVM is created in a host corresponding to the host selection. Containers are started within the podVM. The containers correspond to the container configurations.

Abstract: Various aspects are disclosed for unified resource management of containers and virtual machines. A podVM resource configuration for a pod virtual machine (podVM) is determined using container configurations. The podVM comprising a virtual machine (VM) that provides resource isolation for a pod based on the podVM resource configuration. A host selection for the podVM is received from a VM scheduler. The host selection identifies hardware resources for the podVM. A container scheduler is limited to bind the podVM to a node corresponding to the hardware resources of the host selection from the VM scheduler. The podVM is created in a host corresponding to the host selection. Containers are started within the podVM. The containers correspond to the container configurations.

Abstract: Various aspects are disclosed for unified resource management of containers and virtual machines. A podVM resource configuration for a pod virtual machine (podVM) is determined using container configurations. The podVM comprising a virtual machine (VM) that provides resource isolation for a pod based on the podVM resource configuration. A host selection for the podVM is received from a VM scheduler. The host selection identifies hardware resources for the podVM. A container scheduler is limited to bind the podVM to a node corresponding to the hardware resources of the host selection from the VM scheduler. The podVM is created in a host corresponding to the host selection. Containers are started within the podVM. The containers correspond to the container configurations.

Abstract: Various aspects are disclosed for unified resource management of containers and virtual machines. A podVM resource configuration for a pod virtual machine (podVM) is determined using container configurations. The podVM comprising a virtual machine (VM) that provides resource isolation for a pod based on the podVM resource configuration. A host selection for the podVM is received from a VM scheduler. The host selection identifies hardware resources for the podVM. A container scheduler is limited to bind the podVM to a node corresponding to the hardware resources of the host selection from the VM scheduler. The podVM is created in a host corresponding to the host selection. Containers are started within the podVM. The containers correspond to the container configurations.

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

Abstract: Systems and methods for reducing network cost in a hyper-converged infrastructure are disclosed. The network cost of workload pairs can be assessed. Migration of the workloads can be considered to reduce the network cost and improve the network efficiency of the hyper-converged infrastructure.

Abstract: Systems and methods for reducing network cost in a hyper-converged infrastructure are disclosed. The network cost of workload pairs can be assessed. Migration of the workloads can be considered to reduce the network cost and improve the network efficiency of the hyper-converged infrastructure.

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

Abstract: A management server and method for performing resource management operations in a distributed computer system utilizes interference scores for clients executing different workloads, including a client to be placed in the distributed computer system, as utilization values of resources, which are assigned continuously variable weights to produce weighted resource utilization values. The weighted resource utilization values are used to generate overall selection scores for host computers of the distributed compute system, which are then used to recommend a target host computer among the host computers of the distributed computer system to place the client.

Abstract: A management server and method for performing resource management operations in a distributed computer system utilizes interference scores for clients executing different workloads to create an interference affinity-type rule for at least some of the clients contending for a resource based on the interference scores for that resource. The interference affinity-type rule can then be used to recommend a target host computer to place a client.

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

Abstract: A management server and method for performing resource management operations in a distributed computer system utilizes interference scores for clients executing different workloads, including a client to be placed in the distributed computer system, as utilization values of resources, which are assigned continuously variable weights to produce weighted resource utilization values. The weighted resource utilization values are used to generate overall selection scores for host computers of the distributed compute system, which are then used to recommend a target host computer among the host computers of the distributed computer system to place the client.

Abstract: A management server and method for performing resource management operations in a distributed computer system utilizes interference scores for clients executing different workloads to create an interference affinity-type rule for at least some of the clients contending for a resource based on the interference scores for that resource. The interference affinity-type rule can then be used to recommend a target host computer to place a client.

Abstract: A system and method are provided for implementing a peak-to-average power ratio (PAPR) reduction scheme for Orthogonal Frequency-Division Multiple Access (OFDMA) modulation. A unique PAPR reduction scheme for OFDMA modulation for systems operated according to a DOCSIS standard achieves results similar to those attributable to tone reservation schemes in a manner that does not negatively affect an amount of available data capacity, particularly in implementations with limited numbers of subcarriers. The disclosed systems and methods are particularly adaptable to next generation cable gateways and/or next generation cable modems. These next generation cable gateways and/or cable modems may find particular utility in advanced hybrid fiber/coaxial cable systems. The adaptable cable gateways/modems may include a cable gateway system-on-chip (SOC) configuration. The disclosed schemes may be applicable to OFDM modulation. For OFDM, however, the known tone reservation algorithms also may be employed.

Abstract: Methods and systems to mitigate impulse interference in an OFDM QAM signal. A per-symbol noise measure, or quality measure (QM) is computed for a symbol k as a MSE of distances between carriers in the symbol and points of corresponding QAM constellations. MSE(k) is averaged over multiple symbols to compute a background signal QM, AVG_MSE(k). If MSE(k) exceeds AVG_MSE(k) by a moderate amount, symbol k may be moderately affected by impulse interference, and per-carrier SNR estimates are downgraded for all data carriers in symbol k, prior to LLR computation. SNR downgrading may be linear or step-wise based on an extent to which MSE(k) exceeds AVG_MSE(k). If MSE(k) exceeds AVG_MSE(k) by a significant amount, symbol k may be significantly affected by impulse interference, and LLRs may be set to indicate that all data carriers are erased in symbol k.

Abstract: A system and method are provided for implementing a soft Reed-Solomon (RS) decoding scheme, technique or algorithm to improve physical layer performance in cable modems and cable gateways. The algorithm is implemented in a forward error correction (FEC) module connected to a QAM demodulator. The RS decoding scheme is implemented without significantly complicating hardware or processing overhead. The soft Reed-Solomon (RS) decoding scheme extracts candidate RS symbols and their Log Likelihood Ratios (LLRs) from QAM symbols. The set of highest probable candidate blocks are then chosen and these are decoded using a variant of the Chase algorithm until a valid codeword is detected at the decoder output.

Abstract: An embodiment of the present invention provides a method for digital television demodulation, comprising using adjacent-channel power dependent automatic gain control (AGC) for the digital television demodulation, wherein an AGC technique takes into account a total power as well as power of adjacent channels to control gain of a gain control amplifier.

Abstract: A system and method are provided for implementing a soft Reed-Solomon (RS) decoding scheme, technique or algorithm to improve physical layer performance in cable modems and cable gateways. At 1024-QAM, a receiver is provided in which a signal to noise ratio is reduced by at least about 1 dB relaxing design considerations and specifications for other components in the system including for the tuner. A soft-RS-symbol generation scheme is provided to enable soft-input RC decoding in a forward error correction (FEC) module connected to a QAM demodulator. The RS decoding scheme is implemented without significantly complicating hardware or processing overhead. A typical receiver hardware requirement in an FEC module to implement the disclosed scheme may be comparatively modest, e.g., on an order of approximately 50K gates.

Abstract: A system and method are provided for implementing a peak-to-average power ratio (PAPR) reduction scheme for Orthogonal Frequency-Division Multiple Access (OFDMA) modulation. A unique PAPR reduction scheme for OFDMA modulation for systems operated according to a DOCSIS standard achieves results similar to those attributable to tone reservation schemes in a manner that does not negatively affect an amount of available data capacity, particularly in implementations with limited numbers of subcarriers. The disclosed systems and methods are particularly adaptable to next generation cable gateways and/or next generation cable modems. These next generation cable gateways and/or cable modems may find particular utility in advanced hybrid fiber/coaxial cable systems. The adaptable cable gateways/modems may include a cable gateway system-on-chip (SOC) configuration. The disclosed schemes may be applicable to OFDM modulation. For OFDM, however, the known tone reservation algorithms also may be employed.