Abstract: Various embodiments provide a method and apparatus of providing a network and storage-aware virtual machine (VM) placement that optimizes placement based on network layer metrics, performance characteristics of the storage arrays and application constraints. Advantageously, since storage is often necessary in servicing application requests, basing VM placement on performance characteristics of the storage arrays as well as network layer metrics can lead to a significant improvement in VM performance.

Abstract: Service models may be generated in response to services exposed by two or more IaaS service providers, and an interface may be provided for selection and specification of the service models.

Abstract: Methods and systems for the optimization of available computing resources within a virtual environment are disclosed. An exemplary method comprises determining the sizes of the computing resources available to the virtual machine and determining optimal data structures for the virtual machine based on the sizes of the computing resources. The optimal data structures may include an indexing data structure and a historic data. The method may further comprise allocating a Random Access Memory (RAM) and disk storage to the optimal data structures and configuring the optimal data structures within the RAM and the disk storage. The optimization of data structures involves balancing requirements of the indexing data structure and the historic data.

Abstract: A host system reallocates resources in a virtual computing environment by first receiving a request to reallocate a first quantity of a first resource type. Next, potential trade-off groups are evaluated and a trade-off group is selected based on the evaluation. The selected trade-off group includes a set of applications running in the virtual computing environment that can use one or more alternate resource types as a substitute for the first quantity of the first resource type. After the selection, the host system reallocates the first quantity of the first resource type from the trade-off group. This reallocation may be made from the trade-off group to either a first application running in the virtual computing environment or the host system itself. If the reallocation is to the host system, then the total quantity of the first resource type allocated to applications running in the virtual computing environment is thereby reduced.

Abstract: According to one aspect of the present disclosure, a system and technique for workload processing includes a host having a processor unit and a memory. A scheduler is executable by the processor unit to: receive a request to process a workload; access historical processing data to determine execution statistics associated with previous processing requests; determine whether the data of the workload is available for processing; in response to determining that the data is available for processing, determine whether a process for the workload is available; in response to determining that the process is available, determine resource availability on a computing platform for processing the workload; determine whether excess capacity is available on the computing platform based on the resource availability and the execution statistics; and in response to determining that excess capacity exists on the computing platform, initiate processing of the workload on the computing platform.

Abstract: Technologies for transferring offloading or on-loading data or tasks between a processor and a coprocessor include a computing device having a processor and a sensor hub that includes a coprocessor. The coprocessor receives sensor data associated with one or more sensors and detects events associated with the sensor data. The coprocessor determines frequency, resource usage cost, and power state transition cost for the events. In response to an offloaded task request from the processor, the coprocessor determines an aggregate load value based on the frequency, resource usage cost, and power state transition cost, and determines whether to accept the offloaded task request based on the aggregate load value. The aggregate load value may be determined as an exponential moving average. The coprocessor may determine whether to accept the offloaded task request based on a principal component analysis of the events. Other embodiments are described and claimed.

Abstract: Synchronization stateless process execution is disclosed. In various embodiments, an indication is received that an instance of a process with respect to which stateless execution is being performed is to enter a block of the process with respect to which synchronization with one or more other instances of the process is to be provided. A current turn to perform the block with respect to which synchronization is to be provided is secured on behalf of the process instance. The block with respect to which synchronization is to be provided is allowed to be performed by the process instance.

Abstract: A method for monitoring performance of events occurring in a multiprocessor system is provided where the performance monitoring units (PMUs) are globally synchronized. The global synchronization is carried out with a dedicated bit field set to any of pause, stop, restart, or reset command. The command is sent across the scan communications interface (SCOM) of all chips by using existing fabric connecting all nest units to control the PMUs in the system. A pre-scale counter before a main counter may be used to buffer event counts until a reset or a restart command is sent to the SCOM in the system.

Abstract: A core executing processes in plural threads specifies one gate to read out a state of the gate from a thread progress control unit holding information of plural gates disposed in a loop state, setting a state of a gate disposed subsequently relative to a gate when a state of the gate is set to a first state to a second state, and setting the state of the gate to the first state when a certain period of time elapses from a first request of reading the state for the gate which is set to the second state, by every certain process in each thread. The core executes a next process when the state of the specified gate is the first state, and makes the execution of the next process wait until the state becomes the first state when it is not the first state.

Abstract: Example methods and systems are directed to dispatching database tasks. An application may access data associated with a task. The data may indicate features (e.g., processing functionality) that will be used to complete the task. The application may determine whether all such features are implemented in the database layer. The application may dispatch the task to the database layer if all features are implemented therein. The application may perform the task in the application layer if one or more of the features are not available in the database layer. In some example embodiments, the task involves materials requirements planning. Such a task may include determining, for a given bill of materials (“BOM”), the quantity of materials available on-hand, the quantity available from suppliers, the transport or delivery time for the various quantities, and other data regarding the BOM.

Abstract: Queue storage queues event entries from a hardware event detector that are to be communicated to a software event handler. An event register stores a most recently received event entry. A comparator compares a newly received event entry with the content of the event register and if a match occurs, then these event entries are merged by setting a merged entry bit and discarding the newly received event entry. When a non-matching event entry is received, then the unqueued event within the event register is stored into the queue storage. If the queue storage is empty, then the event register and the comparator are bypassed. When the queue storage becomes empty, then any currently unqueued event within the event register is stored into the queue storage. The event entries may be translation error event entries in a system which translates between virtual addresses and physical addresses.

Abstract: A graphical program execution environment that facilitates communication between a producer program and a consumer program is disclosed. The producer program may store data in a memory block allocated by the producer program. A graphical program may communicate with the producer program to obtain a reference to the memory block. The graphical program may asynchronously pass the reference to the consumer program, e.g., may pass the reference without blocking or waiting while the consumer program accesses the data in the memory block. After the consumer program is finished accessing the data, the consumer program may asynchronously notify the graphical program execution environment to release the memory block. The graphical program execution environment may then notify the producer program that the block of memory is no longer in use so that the producer program can de-allocate or re-use the memory block.

Abstract: This disclosure describes communication techniques that may be used within a multiple-processor computing platform. The techniques may, in some examples, provide software interfaces that may be used to support message passing within a multiple-processor computing platform that initiates tasks using command queues. The techniques may, in additional examples, provide software interfaces that may be used for shared memory inter-processor communication within a multiple-processor computing platform. In further examples, the techniques may provide a graphics processing unit (GPU) that includes hardware for supporting message passing and/or shared memory communication between the GPU and a host CPU.

Abstract: A method of managing an asynchronous messaging queue with a client computer in an asynchronous messaging system, where the client computer is programmed to store an manage the asynchronous messaging queue, includes receiving a reactive message in the asynchronous messaging queue, the reactive message including an identification of a previously initiated message and an action to be performed on the previously initiated message; and upon determining that the previously initiated message has already been received in the asynchronous messaging queue, performing the action on the previously initiated message with the client computer.

Abstract: Disclosed is a method for administering messages. In response to a determination that one or more consuming applications have failed to process the same message on a queue a predetermined number of times, the message is made unavailable to consuming applications. Responsive to determining that a predetermined number of messages have been made unavailable to consuming applications, one or more consuming applications are prevented from consuming messages from the queue.

Abstract: A method of hosting a first application (e.g., a virtual application) inside a second application (e.g., a control displayed by a web browser). The method includes executing the first application inside a runtime environment generated at least in part by a runtime engine. The executing first application calls user interface functions that when executed inside the runtime environment generate a first user interface. The runtime engine captures these calls, generates messages comprising information associated with the captured calls, and forwards the messages to a user interface manager that is a separate application from the runtime engine. The user interface manager receives the messages, translates the information associated with the captured calls into instructions for the second application, and sends the instructions to the second application. The control receives the instructions sent by the user interface manager, and displays a second user interface for the first application based on the instructions.

Abstract: A sensor interface is provided with a number of sensor inputs and a number of client inputs. The client inputs are configured to receive a number of data requests from a number of clients. The number of data requests include at least one data request that specifies a particular type of data to be returned, without identifying a particular physical sensor to be used in acquiring the particular type of data. A processor is configured to i) determine what sensor data can be used to satisfy the number of data requests, ii) configure ones of the sensor inputs to receive sensor data from a number of physical sensors, and iii) if possible, satisfy the number of data requests using the received sensor data. Methods and apparatus pertaining to such a sensor interface are also disclosed.

Abstract: A method for software bug resolution includes generating, with a software bug reporting client module, a software bug report for a bug, the bug being detected in a piece of software. The method further includes prompting a user to add information about the bug to the software bug report and sending the software bug report to a bug reporting entity to be presented as a post on a feed, the feed associated with the bug reporting entity. The method further includes receiving, from the bug reporting entity, a notification of a response to the post, and pushing, through the software bug reporting client module, the notification to the user.

Abstract: Embodiments of the invention provide systems and methods for logging of messages in a development environment. More specifically, embodiments of the present invention provide dynamically adaptive logging of runtime messages generated by an application. These embodiments provide a way to handle the volume of information stored in the logs by dynamically changing the severity associated with generated messages based on previous code path execution. Embodiments can use a set of metrics to replace the usual static log level associated with the code by the developer. For example, such metrics can include but are not limited to a cost-based (storage volume on disk), an exception-based (weight increase in catch block), and/or a crowd-based (community can vote down noise). As a result, embodiments can provide more detailed information when the error is recurring for a particular user but without generating so much information as to make the log difficult to use.

Abstract: An apparatus comprising a data storage device to store a plurality of register tracking values, each of the plurality of register tracking values to indicate a last successful Input/Output (I/O) port check, an initialization module to reset a first register tracking value in the data storage device upon receipt of an initialization signal from an I/O refresh subsystem corresponding to the first register tracking value and a failure detection module to identify a second register tracking value in the data storage device that has a value indicating an expired register tracking value.

Abstract: Classifying memory errors may include accessing data from a location within a memory array of a memory device. The memory array may include at least one bit field to store memory error classification information. One or more memory errors in the data may be determined. One or more memory errors may further be classified. In response to the classifying, memory error classification information may be stored as one or more bit values within the bit field.

Abstract: A method and device for error detection includes performing error detection for each data word received in a burst access to a memory. When no error is detected, the data words are written to a cache and indicated as valid data. In response to detecting an error in a data word, the error is corrected and the corrected data written to the cache without indicating the data as valid. In addition, the location of the detected error, indicating the data symbol associated with the error, is recorded in an error vector. The error vectors associated with each data word in the burst access are compared to determine whether a detected error was properly corrected.

Abstract: Provided are a memory device and a memory module, which perform both an ECC operation and a redundancy repair operation. The memory device repairs a single-bit error due to a ‘fail’ cell by using an error correction code (ECC) operation, and also repairs the ‘fail’ cell by using a redundancy repair operation when the ‘fail’ cell is not repairable by the ECC operation. The redundancy repair operation includes a data line repair and a block repair. The ECC operation may change a codeword corresponding to data per one unit of memory cells including the ‘fail’ cell, and may also change the size of parity bits regarding the changed codeword.

Abstract: A method, non-transitory computer readable medium, and storage management computing device that obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.

Abstract: A data storage system employs a de-clustered RAID (DCR) organization with a Vertical Rotation approach to prevent overflow of cache buffers. The Vertical Rotation Controller limits the size of the I/O operation relative to a respective Physical Disk Extent (PDE) to the cache buffer, and writes/reads a computed parity stripe matching the size of the cache, to form chunk bundles in the PDEs. When a bundle is filled in a first PDE residing at a first row, a PDE residing at a second row vertically displaced from the first row is engaged for forming another bundle. The process continues until all PDEs in a Vertical Rotation Group (VRG) are filled, or continues to a next VRG vertically displaced from a previous one to end I/O requesting.

Abstract: A method for asymmetrically scheduling buffer cache of disk array. The method including: (1) detecting whether access from a upper layer is hit in a buffer cache, proceeding to (7) if yes, and proceeding to (2) if no; (2) detecting whether the buffer cache is full, proceeding to (3) if yes, and proceeding to (5) if no; (3) detecting whether the number of pages of a sacrificial disk is greater than a threshold, proceeding to (4) if yes, and proceeding to (6) if no; (4) selecting and replacing a cold page of the sacrificial disk; (5) buffering data requested by a user in a blank page in the buffer cache; (6) selecting and replacing all cold pages of the buffer cache; and (7) reading or writing the data, and changing positions or status thereof in pages of the buffer cache.

Abstract: A method begins by a processing module of a dispersed storage network (DSN) detecting a likelihood of having a missing encoded data slice based on local physical to DSN address mapping information. When the likelihood of having the missing encoded data slice exists, the method continues with the processing module sending a query regarding the missing encoded data slice to another storage unit of the DSN and receiving a response to the query from the other storage unit. When the response includes identity of a related encoded data slice of a set of encoded data slices, the method continues with the processing module commencing execution of a rebuilding function to generate a new encoded data slice to replace the missing encoded data slice.

Abstract: Avoiding compression of high-entropy data during creation of a backup of a source storage. In one example embodiment, a method for avoiding compression of high-entropy data during creation of a backup of a source storage may include identifying a chunk with an original size in a file in a source storage, compressing, during creation of a backup of the source storage, the chunk to generate a compressed chunk with a compressed size, determining a compression ratio for the chunk by comparing the original size to the compressed size, determining whether the compression ratio is less than the compression threshold, and, in response to determining that the compression ratio is less than the compression threshold, automatically designating the file as a high-entropy file and automatically avoiding compression, during the creation of the backup, of chunks in a second similar file in the source storage.

Abstract: As disclosed herein a computer program product for optimizing data synchronization when performing a block-level backup includes program instructions comprising instructions to receive a customized merging plan, create a padding map comprising missing data information, request missing data from a local backup server, wherein the instructions to request missing data comprise instructions to send the padding map to the local backup server, receive from the local backup server the missing data, and perform a snapshot consolidation according to the customized merging plan to provide a consolidated snapshot. The program instructions may include instructions to record missing data files and data blocks in the padding map. A computer system, corresponding to the computer program product is also disclosed herein.

Abstract: A method of for system management, comprising initiating a workflow operating on a processor. Initiating a sub-workflow operating on the processor from the workflow. Electronically reading state data for one or more resources designated by the sub-workflow prior to performing a first logical process of the sub-workflow. Storing the state data in a non-transient data memory. Performing logical processes associated with the sub-workflow using the processor. Restoring the state data for the one or more resources if it is determined that an error has occurred.

Abstract: Save set indexing outside of backup windows is described. A system creates a snapshot of a save set without creating an index of the save set. The system creates the index of the save set in response to creating the snapshot of the save set.

Abstract: A method for data container group management in a deduplication system is provided. The method includes arranging a plurality of data container groups according to a plurality of file systems. A subset of the plurality of data container groups correspond to each of the plurality of file systems, each of the plurality of data container groups having a reference database, a plurality of data containers, and a data container group identifier (ID). The method includes performing a first backup process for a first client-policy pair with deduplication via a first one of the plurality of data container groups and performing a second backup process for a second client-policy pair with deduplication via a second one of the plurality of data container groups.

Abstract: Methods for creating backup of data of a virtual environment to allow non-staged recovery are described. The described method may include receiving data of a virtual environment through one or more data streams for backup. The method also includes generating metadata corresponding to the received data and storing the received data at a first location of a backup storage unit. Further, the method includes storing the generated metadata at a second location of the backup storage unit, where the second location is different from the first location of the backup storage unit. The method further includes mapping the at least one predefined file to the stored data to create a mapping table to allow direct access to the stored data for non-staged recovery.

Abstract: One embodiment of the present invention provides a switch. The switch includes one or more ports, a persistent storage module, a restoration module, and a retrieval module. The persistent storage module stores configuration information associated with the switch in a data structure, which includes one or more columns for attribute values of the configuration information, in a local persistent storage. The restoration module instantiates a restoration database instance in the persistent storage from an image of the persistent storage. The retrieval module retrieves attribute values from a data structure in a current database instance and the restoration database instance in the persistent storage. The restoration module then applies the differences between attribute values of the restoration database instance and the current database instance in the persistent storage to switch modules of the switch, and operates the restoration database instance as the current database instance in the persistent storage.

Abstract: A method for diagnosing an aborted transaction from a plurality of transactions is executed by a processor core with a transactional memory, that stores information corresponding to a plurality of transactions executed by the processor core, and a transaction diagnostic register. The processor core retrieves context summary information from at least one register of the processor core. The processor core stores the context summary information of aborted transactions into the transactional memory or the transaction diagnostic register. The context summary information can be used for diagnosing the aborted transactions.

Abstract: Described are techniques for processing requests. A request is received at a server from a client to apply a first update to first data. A cached copy of the first data is stored in a cache of the server. A quality of service is associated with the request. The quality of service affects when the first update is applied to the cached copy of the first data. The first update is applied to the first data. In accordance with the quality of service, the first update is applied to the cached copy of the first data.

Abstract: Various systems, methods, and apparatuses for operating a wireless charging device in an electric vehicle are disclosed. One method includes detecting a system fault indicative of one or more faults in the wireless charging device in the electric vehicle or in the transmitter. The method further includes determining a fault severity level from a plurality of fault severity levels based on a type of the system fault detected. A total number of types of system faults can be greater than a total number of the plurality of fault severity levels. The method further includes performing one or more system fault response operation based on the determined fault severity level. Each of the plurality of fault severity levels can be associated with a different set of system fault response operations.

Abstract: A user device is provided. The device includes a main power supply, and an auxiliary power supply. The main power supply provides a main power. The auxiliary power supply cuts off the main power according to a power level of the main power supply and provides an auxiliary power upon Sudden Power-Off (SPO).

Abstract: A read/write cache device and method persistent in the event of a power failure are disclosed herein. The read/write cache device includes a meta-information part, a recency/frequency (RF) table part, a mapping table part, and a log area. The meta-information part provides information about whether metadata has integrity and information about the version of metadata stored in two metadata regions. The RF table part provides information about the recency and frequency of each of low-speed segments of a plurality of high-speed and low-speed segments and information about whether each of the low-speed segments is cached, in order to maintain the consistency of the metadata. The mapping table part provides information about a low-speed segment that is cached to each of the high-speed segments. The log area provides changed caching information that is not applied into the mapping table part.

Abstract: A method of providing failure recovery capabilities to a cloud environment for scientific HPC applications. An HPC application with MPI implementation extends the class of MPI programs to embed the HPC application with various degrees of fault tolerance. An MPI fault tolerance mechanism realizes a recover-and-continue solution. If an error occurs, only failed processes re-spawn, the remaining living processes remain in their original processors/nodes, and system recovery costs are thus minimized.

Abstract: Methods and apparatus for a primary role reporting service for resource groups are disclosed. A reporting intermediary assigned to a resource group of a network-accessible service receives role information indicating the identity of a primary member of the group from a state manager of the network-accessible service. The intermediary receives a health status query pertaining to the resource group from a health checking subsystem used by a network address discovery service, and provides a health status response based on the role information. The response provided by the reporting intermediary is used by the network address discovery service to provide a network address in response to a lookup query for the resource group.

Abstract: An arrangement for testing a control unit via a test environment, having a computer-based test management tool, wherein the test management tool is configured for model-based development and/or management of at least one test plan implemented as a data structure in order to test the control unit, and the test plan has at least one test and a start condition for initiating execution of the test plan; a computer-based test execution control tool, wherein the test execution control tool is configured to initiate execution of the test plan on the test environment when the start condition is met; and a computer-based database, wherein the database is configured to store the test plan implemented as a data structure and is also configured for shared, common access to the test plan by the test management tool and the test execution control tool.

Abstract: Disclosed herein are a method and an apparatus for shortening a data comparison test time by using peer-to-peer transfers between peripheral component interconnect express (PCIe) endpoints when testing solid state drive (SSD) devices. A memory device test apparatus performing a data comparison test of a memory device mounted in a downstream port of a peripheral component interconnect express (PCIe) switch by performing a writing process and a reading-back process by a control of a host central processing unit (CPU) includes: a comparison test unit (FPGA) connected to the downstream port of the PCIe switch, performing peer-to-peer communication with the memory device to supply write data to the memory device and receive read-back data from the memory device, and performing the data comparison test.

Abstract: An approach for improving efficiency of cycle-reproducible debug in a multi-core environment is provided. The approach executes an exerciser image on one or more cores, wherein the exerciser image includes one or more different seeds. The approach determines a seed from the one or more different seeds that locates a fail-condition. Responsive to determining a seed from the one or more different seeds that locates the fail condition, the approach determines an upper bound and a lower bound of the fail-condition. The approach determines an exact cycle where the fail-condition occurs. The approach constructs a multi-cycle trace for the fail-condition.

Abstract: Embodiments of the present invention relate to an error simulator for a test platform. The test platform includes a test process, a system under test (SUT), the error simulator and at least one downstream system. The error simulator is a transparent proxy that intercepts traffic from/to the SUT. The error simulator forwards only “success” commands from the SUT to the downstream system(s) and forwards actual responses from the downstream system(s) to the SUT. However, when the error simulator receives a “failure” command from the SUT, the error simulator automatically returns a corresponding error message that is obtained from preprogrammed failure information to the SUT. The preprogrammed failure information details one or more “failure” commands and corresponding error messages, and is received from the test process by the error simulator either prior to the start of testing or immediately preceding a failure during a test.

Abstract: A method, apparatus and product for test generation. The method comprises generating a first set of instructions for a hardware component, that are to be executed when operating in a first mode of operation; in response to a parsed template statement being a marker statement, generating an intermediary set of one or more instructions to cause the hardware component to change the mode of operation to a second mode in accordance with the marker instruction, and modifying the expected mode of the hardware component to a second mode; and generating a second set of instructions for the hardware component, that are to be executed when operating in the second mode of operation. The generation of instructions comprises determining the expected mode and generating instructions in accordance with the expected mode of the hardware component. The generation is performed without having an expected full state of the hardware component.

Abstract: Controlling a byte code transformer on detection of completion of an asynchronous command. An asynchronous command is received by an asynchronous manager from a test framework. The asynchronous command manager issues the asynchronous command to an application. A transformer is loaded for transforming byte code associated with the application in order to output one or more method names and associated timestamps of one or more method entry points and one or more method exit points. A check is made as to whether an expected result has been generated by the application. In response to determining that an expected result has been successfully generated, a time period associated with successful generation of the expected result is compared with the timestamps in order to determine matching timestamps and associated matching method names. The transformer is modified in accordance with the matching method names such that a subsequent transformation executes on byte code associated with the matching method names.

Abstract: An electronic system that can automatically set a report rate, which comprises: a first electronic apparatus; a second electronic apparatus; a transmitting interface, wherein the second electronic apparatus transmits data to the first electronic apparatus via the transmitting interface; and a processing unit, for automatically setting a report rate of the second electronic apparatus or the transmitting interface according to a type of a software program that the first electronic apparatus executes.

Abstract: Systems and methods may provide for monitoring one or more runtime performance characteristics of a link and determining a state of the link based on at least one of the one or more runtime performance characteristics. Additionally, a retraining of the link may be automatically scheduled based on the state of the link. In one example, scheduling the retraining of the link further includes setting one or more retraining parameters.

Abstract: Techniques are described for metadata-based monitoring of lifecycle operations on software deployments. In one embodiment, a set of metadata is stored in volatile or non-volatile store. The set of metadata may include a plurality of signatures and map a first signature of the plurality of signatures to a first status identifier for a first benchmark of a particular operation. A first set of log data that is associated with one or more software deployments is monitored for occurrence of the first signature. Based, at least in part, on the monitoring, a status of the first benchmark with respect to the first set of one or more software deployments is determined. Report data that indicates the status of the first benchmark is then generated and displayed.