Abstract: A data processing apparatus formed on an integrated circuit comprising: a plurality of processors; power control circuitry configured to control power up and power down of the processors; a read only memory for storing boot up software for booting up each of the processors. The power control circuitry is configured to respond to receipt of a check state request, to control one of the processors that is currently powered down to power up and to access the boot up software. The boot up software accessed in response to the check state request controls the processor to perform a measurement indicative of a current state of the data processing apparatus and to output a value indicative of the measurement.

Abstract: A method for managing OpenFlow communications between an OpenFlow Agent and an OpenFlow Controller is disclosed. The method involves extending the command line interface (CLI) based on distributed management task force (DTMF) server management command line protocol (SM CLP) exposed by an integrated Lights Out Management (LOM) software preexisting in enterprise class network equipment to support a plurality of OpenFlow targets, a plurality of verbs, and a plurality of properties, adding a managed element configured to provide handlers for each of the plurality of OpenFlow targets, registering the managed element for the plurality of OpenFlow targets with a manageability access point (MAP) entity, and configuring at least one of the plurality of properties to facilitate communication between an OpenFlow Agent and an OpenFlow Controller within the enterprise class network equipment using the plurality of OpenFlow targets, the plurality of verbs, and the plurality of properties.

Abstract: Garbage collection of objects within the heap of a computing system, and movement of adjacent sets of live objects as a whole in order to perform compaction. The compaction may be performed even if there are adjacent sets of live objects that include one or more pinned objects that should not be moved by the garbage collector. The garbage collector uses gaps to include relocation information with respect to sets of adjacent objects of the same pinned status. Some gaps may be formulated by writing over the live objects themselves, in which case that written over data is saved off prior to formulating the gap. When compaction is performed, the saved off data is used to fully integrate the adjacent objects of the same pinned status in the process of compaction.

Abstract: The present invention provides an apparatus, method and computer program product for a registry, such as a UDDI registry, to restrict access to business entity definitions contained in the registry according to permission details associated with the business service definition. A business entity definition may comprise a plurality of information elements. Permission details, which define users or groups of users with permission to access the information element, are then associated with one or more of these information elements. When a user request is received to access a business entity definition access is restricted to only those information elements for which the user has the required permission.

Abstract: Utilizing a computing device to determine and enforce limits on cloud computing containers transmitting data over a network. A determination is made of total container time remaining available for a first container to execute in a computing environment, the first container utilizing one or more processor threads executing on a computing device. Processor packet transmission time is determined for processing and transmission of a packet or a batch of packets via a network stack associated with the computing device by the one or more processor threads utilized by the first container. An updated total container time remaining for the first container is calculated, accounting for the processor packet transmission time. The updated total container time remaining is enforced by descheduling all processor threads utilized by the first container if the updated total container time remaining is insufficient.

Abstract: Technical solutions are described for optimizing operation of a server cluster. An example method includes receiving a job request that executes using a set of data blocks, the job request being associated with an expected completion time. The cluster server is used to identify a set of replica servers, wherein each server from the set of replica servers contains the set of data blocks. In response to each server from the set of replica servers estimating a completion time for the job request that is more than the expected completion time, a new server is initiated, the set of data blocks is relocated from a first server from the set of replica servers to the new server, and the job request is allocated to the new server.

Abstract: Techniques disclosed herein dynamically scale components of an application using microservices. An exemplary technique involves executing the application on a computing device such as a server. For example, the application can be executed to host server-side services using the components of the application locally on the computing device. The technique monitors use of the components during execution of the application and determines to migrate a component to a microservice based on the use of the component during the execution of the application. The technique then migrates the component to a micro service by initiating launch of the micro service on a remote computing device and converting local calls for the component to remote calls for the microservice in the application.

Abstract: A system and method for determining a configuration of a plurality of tasks to meet the specified deadline of a linear workflow of a real-time heterogeneous network. Often times, while meeting expected application performance in the heterogeneous network, it may possible to have graceful degradation of quality for ensuring timing constraints at the same time. In a multi-layered architecture, where each layer is equipped with multiple computational resources, the time optimization for each of the plurality of tasks can be achieved through approximate computing and analyzing all possible configurations of each task in a workflow within a particular layer.

Abstract: A processor system includes an application processor, which has a processor core and hardware performance counters, and a monitoring processor, which is coupled to the application processor by a data transmission interface. The monitoring processor has a look-up table, in which target performance profiles of the progression over time of performance events of the hardware performance counters are stored for an application which is to be executed on the application processor and monitored. The monitoring processor has an evaluating logic which is linked to the look-up table and is configured to record the progression over time of performance events of the hardware performance counters during the execution of the application to be monitored on the application processor and to compare the progression with the target performance profiles stored in the look-up table.

Abstract: A system for managing configuration of multiple computing systems associated with a customer in a cloud computing environment. A command associated with the desired configuration is identified for execution on a total quantity of instances associated with the customer system to be configured. An invocation rate parameter selected by the customer system is used to control a rate in which the configuration command is invoked on the targeted instances. Based on the invocation rate parameter, the system invokes the configuration command on identified portions or sets of the targeted instances during different stages of the configuration invocation.

Abstract: This disclosure relates to method and system for intelligent link load balancing. In one embodiment, a method for performing intelligent link load balancing in a computer network including a number of network service providers (NSPs) is disclosed. The method includes monitoring ongoing network traffic transaction data of the computer network, predicting a current network latency level for the ongoing network traffic transaction data for each of the NSPs based on a relationship between a network latency level and network traffic transaction data for each of the NSPs, determining an optimal NSP to route ongoing network traffic based on an analysis of the current network latency level of each of the NSPs, and effecting routing of the ongoing network traffic through the optimal NSP. The relationship is learnt based on an analysis of historical network latency level and historical network traffic transaction data for each of the NSPs.

Abstract: Methods and systems are presented for allocating resources based on dynamic core allocation in a scheduler hierarchy of a storage system. One method includes reserving a set of core processors including one or more core processors for execution of system IOs in the data storage system. The data storage system includes a controller including non-volatile memory (NVRAM) for handling IOs and a first central processing unit (CPU) having a plurality of core processors, a solid state memory (SSD) configured as a read cache memory, and permanent data storage. The method includes dynamically adjusting the number of core processors in the set based on a current utilization of a resource. The method includes scheduling an IO on a first core processor of the plurality of core processors that has the least magnitude of scheduled utilization.

Abstract: A utilization test generates the multiple dimensions of resource load on the first computer, the multiple dimensions including at least two of: a processor utilization dimension, a main memory utilization dimension, a mass storage utilization dimension, and a network utilization dimension. The utilization test performs iterations of attempts to generate said each dimension of the resource load on the first computer, in an amount equal to a changeable target utilization of said each dimension of the resource load on the first computer. The utilization test adjusts the adjusted utilization to attempt to correct for inequality between (i) the actual utilization of a particular one of the multiple dimensions of the resource load on the first computer, and (ii) the changeable target utilization of the particular one of the multiple dimensions of the resource load on the first computer.

Abstract: Methods, systems, and computer-readable media for job scheduling based on job execution history are disclosed. A request is received to schedule a workload comprising a plurality of jobs. A resource allocation score for the workload is determined. The resource allocation score represents (at least in part) an estimated likelihood of successful execution of the workload. A first portion of the workload is scheduled for execution, and a remaining portion (if any) of the workload is delayed. A quantity of jobs in the first portion of the workload is determined based (at least in part) on the resource allocation score. Execution of the first portion of the workload is initiated.

Abstract: Processing received job requests for a multi-versioned distributed computerized service. For each received job request, the job request is channeled to an appropriate service processing node that depends on the version of the distributed computing service that is to handle the job request. A version of the distributed computing service is assigned to the incoming job request. A service processing node that runs a runtime library for the assigned service version is then identified. The identified service processing node also has an appropriate set of one or more executables that allows the service processing node to plan an appropriate role (e.g., compiler, scheduler, worker) in the distributed computing service. The job request is then dispatched to the identified service processing node.

Abstract: Techniques for arbitrating control access to a shared resource among multiple client applications concurrently consuming a shared data stream associated with the shared resource are described. A server component instantiates a shared resource component representing the shared resource and associated shared data stream. The server component publishes a shared resource interface that provides central interface for the multiple client applications to access the shared resource and associated shared data stream. Each client application may access the shared resource in either control mode or shared mode to consume the shared data stream. In control mode, the client application has read-write access to control parameters representing a configuration of the shared resource that are usable to modify aspects of the shared data stream. In shared mode, the client application has read-only access to the control parameters.

Abstract: Detecting deadlock in a distributed computing environment. Potential deadlocks between resources of nodes in a computing cluster by determining resource reverse pairs of the resources for each transaction from trace or log files using data analytics. The potential deadlocks are identified offline by matching a global or local resource between the nodes in sub-transactions of each transaction as recursively identified from a transaction resource chain.

Abstract: Measures, including methods, apparatuses and non-transitory computer-readable storage media, associated with network orchestration. A model of a physical resources part of a network and a model of a virtualised resources part of the network are obtained. The physical/virtualised resources part of the network includes a plurality of physical resources/at least one virtualised network function and represents dependencies between different physical/virtualised resources in the physical/virtualised resources part of the network. At least one optimisation operation is performed using the models of the physical and virtualised resources parts of the network to identify an optimised mapping of the at least one virtualised network function onto at least one of the plurality of physical resources. The at least one virtualised network function is instantiated on the at least one of the plurality of physical resources based on the identified optimised mapping.

Abstract: An embodiment of the invention provides a system and method for managing computing resources in a cloud computing environment, wherein the system includes a data analysis module connected to a processor. The data analysis module predicts the demand for the computing resources, wherein the demand is predicted based on internet user activity. The internet user activity includes: the number of web pages that include at least one select term a predetermined amount of times, the number of times the web pages that include the at least one select term a predetermined amount of times are viewed, and the number of times the select term is entered into an internet search engine. The processor increases resource capacity in the cloud computing environment when the predicted demand is above a first threshold. The processor decreases resource capacity in the cloud computing environment when the predicted demand is below a second threshold.

Abstract: One embodiment provides for a general-purpose graphics processing unit comprising a processing array including multiple compute blocks, each compute block including multiple processing clusters and a thread dispatch unit to dispatch threads of a workload to the multiple compute blocks based on a parallelism metric, wherein the thread dispatch unit, based on the parallelism metric, is to perform one of a first operation and a second operation, the first operation to distribute threads across the multiple compute blocks and the second operation is to concentrate threads within one of the multiple compute blocks.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, are described for: allocating a first pool of workers on a plurality of nodes, wherein each node comprises one or more of the workers from the first pool; providing a first set of instructions to the first pool of workers for performing a first task configured to interact with a computer system; activating the first pool of workers to perform the first task; updating at least a portion of the first set of instructions for a subset of the first pool of workers while the workers are performing the first task; and monitoring at least one performance metric associated with the computer system while the workers from the subset of the first pool are performing the first task.

Abstract: Performance-hint-driven dynamic resource management, including: receiving workload requirements and sensor inputs of a system; determining a new allocation for resources of the system; reconfiguring the resources of the system using the new allocation; evaluating performance of the system based on the reconfigured resources of the system; and generating performance hints based on the evaluated performance of the system.

Abstract: A method for allocating core resources of a multi-core CPU according to embodiments of the present disclosure, comprising: determining the number of time critical threads included in a focus process, wherein said focus process is created when a predetermined software is running; and allocating core resources for the time critical threads and making the allocated core resources dedicated to the time critical threads, based on the number of core resources included in the multi-core CPU and the number of the time critical threads, so as to maximize the number of the time critical threads that occupy exclusive core resources. In said method, it's desirable to try to allocate separate core resources for time critical threads included in a focus process, and said time critical threads can be locked within the correspondingly allocated core resources, so that the allocation of core resources can be more balanced.

Abstract: A deallocation elasticity application system comprising an allocation controller configured to monitor a usage of a resource relative to a capacity of the resource, wherein the controller activates an additional resource when the usage exceeds an activation trigger; the controller configured to record at least one of a time required to add the additional resource and an increased usage during the time required to add the additional resource; and wherein the controller sets a deallocation trigger earlier than the activation trigger by an amount corresponding to at least one of the time required to add the additional resource and the increased usage during the activation period.

Abstract: A resource management method of an electronic apparatus according to an example embodiment includes storing resource information including at least one resource category for assorting hardware resources and software resources by type and an attribute category indicating attribute information of resources included in the at least one resource category in a memory of the electronic apparatus, and in response to an application requesting a specific resource, allocating the specific resource to the application based on the resource information.

Abstract: Methods for classifying functions as belonging to a particular software system is disclosed. Various embodiments are also described that use and display the result of the function classification in various ways, regardless of whether the information was generated by any particular of the described methods. One example graph combines function membership data, time interval frame data, and call stack profile data in the form of an Icicle Graph. The Icicle Graph is then distorted into a Sunburst Graph, resulting in an overall Software System Sunburst Icicle Graph.

Abstract: Technologies are provided in embodiments to dynamically bias performance of logical processors in a core of a processor. One embodiment includes identifying a first logical processor associated with a first thread of an application and a second logical processor associated with a second thread, obtaining first and second thread preference indicators associated with the first and second threads, respectively, computing a first relative performance bias value for the first logical processor based, at least in part, on a relativeness of the first and second thread preference indicators, and adjusting a performance bias of the first logical processor based on the first relative performance bias value. Embodiments can further include increasing the performance bias of the first logical processor based, at least in part, on the first relative performance bias value indicating a first performance preference that is higher than a second performance preference.

Abstract: The present disclosure provides a framework for adaptive resource handling of applications being executed in distributed systems so as to ensure efficient resource utilization. The present disclosure provides a framework: to enable a client to participate in identifying application uniquely using tags such that resource adaptation is more effective, to collect and store resource statistics for an application task against various parameters, to monitor resources done based on historical statistics collected, to resource management is done based on historically identified resource usage limits, and if exact match for the records are not found then based on confidence score the limits are identified, and to enable each resource manager (RM) agent to receives the workers to be launched with both limits: given by the application (hard limit) and by the historical statistics (soft limit).

Abstract: In an example embodiment performance is optimized in a complex event stream (CEP) system. Information about a plurality of CEP threads is obtained. Then nearness among the plurality of CEP threads is determined, wherein nearness between a first and a second CEP thread indicates how much interaction is expected to occur between the first and second CEP thread. Based on the determined nearness, the plurality of CEP threads are organized into a plurality of CEP thread groups. Then, each of the plurality of CEP thread groups are assigned to a different processing node, with each processing node having one or more processors and a memory.

Abstract: Systems, methods, and software can be used to share content. In some aspects, the electronic device receives an installation manifest for an application. The installation manifest indicates one or more resources on the electronic device that the application is configured to access. The electronic device receives resource usage information associated with the application. The resource usage information indicates how often the application uses at least one resources. A resource permission request for the application is outputted on the electronic device based on the installation manifest and the resource usage information.

Abstract: Implementations of the disclosure provide for mechanisms for resource reconciliation in a virtualized computer system. A method of the disclosure includes receiving a request initiated by a user to allocate a first amount of a resource; determining, using a processing device, whether the request can be fulfilled in view of a second amount of the resource available in a virtualized computer system; and allocating the second amount of the resource for the user in response to determining that the request cannot be fulfilled.

Abstract: Techniques are provided for automated employment of respective quota managers for framework instances, where the respective quota managers can negotiate amongst themselves to manage usage of a resource of a shared computing system in relation to a quota for the resource for a tenant of the shared computing system. This can allow tenants to share their quota among multiple frameworks, enable quota exchange between multiple frameworks, and choose a quota with a minimum costs, and thus maximize savings.

Abstract: Systems and methods of allocating execution loads to execution components are disclosed. The systems and methods select one of the execution components and one of the execution loads based on selection criteria. The systems and methods then determine whether the selected execution load may be allocated to the selected execution component. If the selected execution load may be allocated to the selected execution component, the systems and methods allocate the execution load accordingly. If the selected execution load may not be allocated to the selected execution component, the systems and methods select another one of the execution components and another one of the execution loads for attempted allocation.

Abstract: Methods and systems for performing heterogeneous computations on homogeneous input data are disclosed. A plurality of computational specifications are distributed among a plurality of worker nodes. The computational specifications comprise definitions of a plurality of heterogeneous computations. The heterogeneous computations are performed using the worker nodes. Individual ones of the heterogeneous computations are performed based on the set of input data and corresponding ones of the computational specifications, and individual ones of the heterogeneous computations produce respective results. An aggregate result is generated based on the respective results of the heterogeneous computations.

Abstract: An adaptive mechanism may include a receiver, an Arithmetic Logic Unit (ALU) identifier, and an assignment module. The receiver may receive tasks representing iterations of inexact algorithms. Each task may have a corresponding iteration power level. The ALU identifier may identify a set of available ALUs. Each ALU may have a corresponding ALU power level. The assignment module may assign tasks to available ALUs to optimize a total ALU power used.

Abstract: A computer-implemented mechanism is provided that monitors usage of one or more computing resources within a set of computing components relative to a received workload. The mechanism calculates a maximum workload for the set of computing components from the monitored use of the computing resources within the set of computing components and determines an available overhead between the calculated maximum workload for the set of computing components and a current workload being performed by the set of computing components. The mechanism selects one or more maintenance tasks for the set of computing components, the total workload of the selected maintenance tasks being less than the determined available overhead.

Abstract: The invention relates to a method for managing an architecture, wherein the architecture comprises a main platform including a plurality of partitions for executing software, and at least one secondary platform. The method further comprises at least one step of associating each partition of the main platform with at least one processing member by installing, for each partition and each processing member, a driver specific to the relevant partition, the driver ensuring a secured link between the relevant partition and the operating member(s) with which the partition is associated.

Abstract: A disclosed example method to automate deployment of a software defined data center includes generating, by executing an instruction with at least one processor, a task list based on tasks provided in an automation plan to deploy the software defined data center; determining, by executing an instruction with the at least one processor, dependencies between the tasks prior to executing the tasks; determining, by executing an instruction with the at least one processor, whether a resource that is to be an output of a first one of the tasks exists before execution of the first one of the tasks; removing, by executing an instruction with the at least one processor, the first one of the tasks from the task list when the resource exists before execution of the first one of the tasks; generating an execution schedule, by executing an instruction with the at least one processor, based on the dependencies and ones of the tasks remaining in the task list; and executing, with the at least one processor, the ones of the

Abstract: A computer-implemented method is presented for removing overlap character array of a programming language where a part of the character array is used as a value of a string. The computer-implemented method includes, when comparison of a first string and a second string succeeds, modifying the string using a larger character array to use a smaller character array. The computer implemented method further includes collecting the larger character array in a subsequent GC process. When the offset of the string's value in the character array needs to be used, it is atomically accessed with the value field by using the two-word compare and swap instruction or by allocating the value and offset field in the same word.

Abstract: Identifying shellcode in a sequence of instructions by identifying a first instruction, the first instruction identifying a first bound of a sequence of instructions, identifying a second instruction, the second instruction identifying a second bound of the sequence of instructions, and generating a distribution for the sequence of instructions, bounded by the first instruction and the second instructions, the distribution indicative of whether the sequence of instructions is likely to include shellcode.

Abstract: System and methods for on-demand isolated execution of specific tasks. A system receives, via a communication interface, requests to execute tasks. The system reacts to each of the requests by allocating, on-demand and per the request received, a unique sub-set of physical computational resources, so as to result in several such unique sub-sets of resources. The system executes, per each of the tasks, the respective commands of the task, by converting the respective commands of the task into executable instructions and running the executable instructions. The respective commands of each of the tasks are converted so as to cause the resulting executable instruction to refrain from accessing other unique sub-sets that were not allocated to the task, thereby facilitating said on-demand isolated execution of each of the tasks.

Abstract: Cloud security may be provided remotely via a device with network capabilities. Virtual resources managed by the cloud configuration may also be modified and updated based on status changes to the device that may be managed by an administrator. One example may include at least one of associating a virtual resource with a physical device, configuring the virtual resource based on an initial state of the physical device, detecting a change in the initial state of the physical device to a different state of the physical device, and updating the virtual resource based on the different state of the physical device.

Abstract: In an embodiment of the present invention, a method includes partitioning a plurality of remote direct memory access context objects among a plurality of virtual functions, establishing a remote direct memory access connection between a first of the plurality of virtual functions, and migrating the remote direct memory access connection from the first of the plurality of virtual functions to a second of the plurality of virtual functions without disconnecting from the remote peer.

Abstract: A method is described. The method includes calculating data transfer metrics for kernel-to-kernel connections of a program having a plurality of kernels that is to execute on an image processor. The image processor includes a plurality of processing cores and a network connecting the plurality of processing cores. Each of the kernel-to-kernel connections include a producing kernel that is to execute on one of the processing cores and a consuming kernel that is to execute on another one of the processing cores. The consuming kernel is to operate on data generated by the producing kernel. The method also includes assigning kernels of the plurality of kernels to respective ones of the processing cores based on the calculated data transfer metrics.

Abstract: A polygon simplification computer system for performing polygon simplification within a web application pipeline has a memory device including a three-dimensional data model (3D data model), a Node.js environment, and a polygon simplification module for performing one or more polygon simplification operations on the 3D data model. The polygon simplification module has a binding component including a set of bindings that convert JavaScript into C++ source code, and a mesh simplification module comprising a C++ compiled polygon simplification framework. The polygon simplification module receives a request for the 3D data model, converts the request into a set of C++ instructions, transmits the instructions to the mesh simplification module, receives a 3D simplified data model, and transmits the 3D simplified data model to a client computing device.

Abstract: The number of processors that store data can be limited for some data in order to improve efficiency in database system that uses multiple processing units to process data. For example, a map can be provided for one or more sparse database tables (or tables) that are relatively small in view of the number of processors that are available. The map can effectively assign distinct portions of the data, e.g., rows of a database, for processing only to a limited number of processors (or processing units). The database system can use the map to process data accordingly.

Abstract: Technologies for assigning workloads based on resource utilization phases include an orchestrator server to assign a set of workloads to the managed nodes. The orchestrator server is also to receive telemetry data from the managed nodes and identify, as a function of the telemetry data, historical resource utilization phases of the workloads. Further, the orchestrator server is to determine, as a function of the historical resource utilization phases and as the workloads are performed, predicted resource utilization phases for the workloads, and apply, as a function of the predicted resources utilization phases, adjustments to the assignments of the workloads among the managed nodes as the workloads are performed.

Abstract: Providing a statistical analysis of all files in a file system based on random sampling of data blocks to identify individual user consumption of file system resources and characteristics of the files stored in the file system. In one or more of the various embodiments, the file system is based on information for a plurality of cylinder groups. Also, each cylinder group may include at one or more known locations at least three types of data structures that enable reverse mapping of data blocks to root directories.

Abstract: A system, method, and computer-readable medium to receive at least one data table relating to a data set; receive a plurality of dimensions; combine, by a first parallelization process, the plurality of dimensions into a plurality of different clusters, each cluster being a grouping of different dimensions; transmit each of the plurality of different clusters to a cloud platform; divide, by a second parallelization process, the at least one data table into a plurality of different chunks of data; and transmit each of the plurality of different chunks of data to the cloud platform, in parallel to and independent of the transmission of the plurality of different clusters the cloud platform, the cloud platform to generate a data model based on a combination of the transmitted plurality of different clusters and the transmitted plurality of different chunks of data.

Abstract: A system, apparatus and method for dynamic resource allocation is provided, where a network resource shared by a plurality of electronic devices having unique service profiles and unique billing profiles is monitored. Allocation of the shared network resource as well as the service profiles and billing profiles are dynamically modified.