Abstract: A language-based model to support asynchronous operations set forth in a synchronous syntax is provided. The asynchronous operations are transformed in a compiler into an asynchronous pattern, such as an APM-based pattern (or asynchronous programming model based pattern). The ability to compose asynchronous operations comes from the ability to efficiently call asynchronous methods from other asynchronous methods, pause them and later resume them, and effectively implementing a single-linked stack. One example includes support for ordered and unordered compositions of asynchronous operations. In an ordered composition, each asynchronous operation is started and finished before another operation in the composition is started. In an unordered composition, each asynchronous operation is started and completed independently of the operations in the unordered composition.

Abstract: A method for handling storage in response to migration of a virtual machine in a virtualization environment, including receiving an I/O request for a virtual disk, determining that a service virtual machine which implements a storage controller is not registered as owner of the virtual disk, obtaining ownership of the virtual disk by the service virtual machine, the service virtual machine handling the I/O request after obtaining ownership of the virtual disk.

Abstract: A system is described allowing a virtual desktop to be booted directly from a desktop image stored in a backup database without requiring content from the desktop image to be copied into the virtual disk of the virtual machine hosting the virtual desktop. The hosting virtual machine contains a synthetic virtual disk acting as a stub disk by redirecting read requests targeted for the synthetic disk from the guest operating system to corresponding locations of the storage where the desktop image is kept.

Abstract: An example method to maintain services in a cloned virtual machine (VM) includes detecting a cloning operation of a virtual machine, the cloning operation causing the cloned virtual machine to be generated from a source virtual machine having a first virtual network interface card (VNIC) with a first machine access control (MAC) address, the cloned virtual machine having a second VNIC with a second MAC address unique from the first MAC address, and causing a device identifier associated with the second VNIC of the cloned virtual machine to be changed to match a device identifier associated with the first VNIC of the source virtual machine, the device identifier of the cloned virtual machine being generated by a guest operating system running in the cloned virtual machine upon detection of the presence of the second VNIC with the second MAC address.

Abstract: A profile store can include a guest profile. A converter can be in the control domain. The converter can convert a gesture detected on a touch input device to a domain input for the guest domain. The guest profile for the guest domain can be used for the conversion.

Abstract: A method of migrating a data compute node (DCN) in a datacenter comprising a plurality of host physical computing devices, a compute manager, and a network manager is provided. The method by the network manager configures a plurality of logical networks and provides a read-only configuration construct of at least one of the plurality of logical networks to the virtualization software of each host. The construct of each logical network includes a unique identification of the logical network. The method by the compute manager obtains the unique identification of one or more of the logical networks, determining that a particular logical network is available on first and second hosts based on the unique identification of the particular logical network, and configures a first DCN to move from the first host to the second host based on the determination that the first and second hosts are on the particular logical network.

Abstract: Embodiments provide data in-flight (DIF) services to software applications such as virtual machines (VMs) at an application level without requiring modification to established storage protocols. In exemplary embodiments, a software application is associated with a DIF services policy indicating one or more DIF services to apply to the software application. Data transmitted by the software application to a destination is tagged based on the DIF services policy associated with the software application and transmitted to the destination.

Abstract: A physical machine calculates, for each virtual switch, an increment of a usage of a processor in accordance with the number of packets to be collected, by using a usage of the processor by a virtual switch and a number of packets passing through each port when mirroring is executed and when mirroring is not executed, respectively. For each of candidates for capture point, the physical machine calculates, for each physical machine, a usage of the processor by a hypervisor when mirroring is executed, by using an increment of a usage of the processor by the virtual switch and a usage of the processor by the hypervisor when mirroring is not executed. The physical machine determines a combination of ports used for collection of packets from among the candidates for capture point, in accordance with a deviation of the calculated usage of the processor by each hypervisor.

Abstract: A host-side overcommit value is set upon a physical node that implements virtual machines (VM Node). The overcommit value is determined by receiving a selected enablement template that includes a selected computing capacity and a selected overcommit value. A user-side normalization factor is determined that normalizes the selected computing capacity against a reference data handling system. A comparable computing capacity of the VM Node is determined. A host-side normalization factor is determined that normalizes the comparable computing capacity against the reference data handling system. The host-side overcommit value is determined from the selected overcommit value, the user-side normalization factor, and the host-side normalization factor. The host-side overcommit value may indicate the degree the comparable computing capacity is overcommitted to virtual machines deployed upon heterogeneous VM Nodes as normalized against the reference system.

Abstract: The method includes estimating an amount of unused memory in a memory allocation of one or more virtual machines based on a data associated with one or more applications previously dispatched to the one or more virtual machines. The method includes receiving a request for executing a new application. The method includes estimating an amount of memory utilized by one of the one or more virtual machines to execute the new application. The method includes dispatching the new application to one of the one or more virtual machine having an amount of unused memory exceeding the estimated amount of memory required to execute the new application. The method includes updating the data associated with the one or more applications previously dispatched to the one or more virtual machines by adding an identifier of the new application to the data.

Abstract: A system and method supports dynamic thread pool sizing suitable for use in multi-threaded processing environment such as a distributed data grid. Dynamic thread pool resizing utilizes measurements of thread pool throughput and worker thread utilization in combination with analysis of the efficacy of prior thread pool resizing actions to determine whether to add or remove worker threads from a thread pool in a current resizing action. Furthermore, the dynamic thread pool resizing system and method can accelerate or decelerate the iterative resizing analysis and the rate of worker thread addition and removal depending on the needs of the system. Optimizations are incorporated to prevent settling on a local maximum throughput. The dynamic thread pool sizing/resizing system and method thereby provides rapid and responsive adjustment of thread pool size in response to changes in work load and processor availability.

Abstract: A non-transitory computer-readable storage medium storing a set of instructions that are executable by a processor. The set of instructions, when executed by one or more processors of a multi-processor computing system, causes the one or more processors to perform operations including initiating a first processor of the multi-processor computing system with an operating system image of an operating system, the operating system image including a predetermined object map, initiating a second processor of the multi-processor computing system with the operating system image, placing a plurality of system objects with corresponding processors according to the predetermined object map, receiving a triggering event causing a change to the predetermined object map and relocating one of the system objects to a different one of the processors based on the change to the predetermined object map.

Abstract: A conditional instruction end facility is provided that allows completion of an instruction to be delayed. In executing the machine instruction, an operand is obtained, and a determination is made as to whether the operand has a predetermined relationship with respect to a value. Based on determining that the operand does not have the predetermined relationship with respect to the value, the obtaining and the determining are repeated. Based on determining that the operand has the predetermined relationship with respect to the value, execution of the instruction is completed.

Abstract: Hybrid transaction memory systems and accompanying methods. A transaction to be executed is received, and an initial attempt is made to execute the transaction in a hardware path. Upon a failure to successfully execute the transaction in the hardware path, an attempt is made to execute the transaction in a hardware-software path. The hardware-software path includes a software path and at least one hardware transaction.

Abstract: Aspects of the subject technology relate to switching tabs in an application. A system is configured to provide for the display an application interface. The application interface includes a toolbar and content associated with a first tab from a plurality of tabs open in the application. The system is further configured to receive, via an input device, a swipe gesture on the toolbar in the application interface and enter, in response to the receiving of the swipe gesture, a tab switching mode in the application in which a tab switching interface is displayed on the touch screen.

Abstract: In one embodiment, a computer-implemented method for dispatching a function call includes receiving, at a supervisor processing element (PE) and from an origin PE, an identifier of a target device, a stack frame of the origin PE, and an address of a function called from the origin PE. The supervisor PE allocates a target PE of the target device. The supervisor PE copies the stack frame of the origin PE to a new stack frame on a call stack of the target PE. The supervisor PE instructs the target PE to execute the function. The supervisor PE receives a notification that execution of the function is complete. The supervisor PE copies the stack frame of the target PE to the stack frame of the origin PE. The supervisor PE releases the target PE of the target device. The supervisor PE instructs the origin PE to resume execution of the program.

Abstract: A method and apparatus for scheduling processing jobs is described. In one embodiment, a scheduler receives a request to process one or more computation jobs. The scheduler generates a size metric corresponding to a size of an executable image of each computation job and a corresponding data set associated with each computation job. The scheduler adjusts a priority of each computation job based on a system configuration setting and schedules the process of each computation job according to the priority of each computation job. In another embodiment, the scheduler distributes the plurality of computation jobs on one or more processors of a computing system, where the system configuration setting prioritizes a computation job with a smaller size metric than a computation job with a larger size metric.

Abstract: Causing a processor to execute a plurality of tasks includes determining a count for each task to be executed, determining a total count representing a sum of all counts for all tasks to be included in a run list, and constructing the run list by distributing corresponding entries for each task within the run list a number of times in accordance with each task's weighting factor. The weighting factor corresponds to a ratio of the each task's count with respect to a total count. Causing a processor to execute a plurality of tasks may also include executing the tasks in the run list in a round-robin manner where a particular entry in the run list is skipped in response to a corresponding task having previously relinquished a slot prior to expiration of time allotted for the task to run in the slot.

Abstract: A method for automatically gauging a benefit of a tuning action. The method including collecting a plurality of observations of a running state of a plurality of threads in a computer system, as executed by a processing in a computer system. Identifying a plurality of resources the computer system and a capacity of each resource of the plurality of resources. Mapping an observation of the running state of each thread of the plurality of threads to a resource that the observation of each thread uses, respectively. Applying the tuning action to a first resource of the plurality of resources to determine an impact on the performance of the computer system.

Abstract: A data processing apparatus has processing circuitry for processing threads each having thread state data. The threads may be processed in thread groups, with each thread group comprising a number of threads processed in parallel with a common program executed for each thread. Several thread state storage regions are provided with fixed number of thread state entries for storing thread state data for a corresponding thread. At least two of the storage regions have different fixed numbers of entries. The processing circuitry processes as the same thread group threads having thread state data stored in the same storage region and processes threads having thread state data stored in different storage regions as different thread groups.

Abstract: According to one embodiment of the present invention, a method is provided. The method may include a computer registering a first instance of a logical partition on a source server with a logical unit and placing a first persistent reservation on the logical unit, wherein the first persistent reservation indicates that only the first instance of the logical partition can hold a reservation on the logical unit. The method may further include the computer registering a second instance of the logical partition on a destination server with the logical unit and downgrading the first persistent reservation, such that the first and second instances of the logical partition can hold persistent reservations on the logical unit. The method may further include the computer placing, by one or more computer processors, a second persistent reservation on the logical unit.

Abstract: Techniques to provide proxies for web services are described. A technique may include providing proxies for web services that translate one format to a format native used, or understood, by the web service without having to rewrite existing APIs. In one embodiment, for example, an apparatus may comprise a processing unit and a network interface coupled to the processing unit. The apparatus may further include a web service executing web service requests on the processing unit using a native format. The apparatus may further include a proxy to receive a web service request in a first format via the network interface and to translate the web service request from the first format to the native format. Other embodiments are described and claimed.

Abstract: Improved utilization of connections that can be either available or blocked is provided by associating an atemporal connection state with each connection. If a connection is available, messages are transmitted on the connection normally. If a connection is blocked, the atemporal connection state is updated to reflect the changes that were made but not transmitted. In this manner, a record is kept that allows correct transmission of the information when the connection comes back up. More specifically, after a connection status changes from blocked to available, recovery messages are automatically generated from the atemporal connection state and transmitted on the connection.

Abstract: A tool for autoscaling applications in a shared cloud resource environment. The tool registers, by one or more computer processors, one or more trigger conditions. The tool initiates, by one or more computer processors, a scaling event based, at least in part, on at least one of the one or more trigger conditions. The tool determines, by one or more computer processors, a scaling decision for the scaling event based, at least in part, on one or more scaling rules related to the one or more trigger conditions.

Abstract: One or more embodiments of the invention set forth techniques to create a process in a graphical processing unit (GPU) that has access to memory buffers in the system memory of a computer system that are shared among a plurality of GPUs in the computer system. The GPU of the process is able to engage in Direct Memory Access (DMA) with any of the shared memory buffers thereby eliminating additional copying steps that have been needed to combine data output of the various GPUs without such shared access.

Abstract: A connection handler is provided on a computing system. The connection handler provides an application with heterogeneous connection objects. Heterogeneous internal connection pools provide homogeneous connection objects related to a specific configuration. Requests are received from the application where the request includes an identification of a specifically configured connection object. A connection object is provided to the application from a respective internal connection pool.

Abstract: A method for profiling an application on a virtual machine is provided. A series of analysis steps to be performed on profiled data can be created. The series of analysis steps can be saved as a report specification. A back-end profiler can then be caused to perform profiling on the application. Profiled data can be received from the back-end profiler. The profiled data can be stored as a model. The model can then be adapted based on the series of analysis steps from the report specification. Output data can be generated based on the adapted model. Finally, the output data is displayed to a user.

Abstract: A method comprising identifying a source program to send a target program map interaction data set to a target program, identifying a target program map function set that includes at least one target program map function, identifying a source program map function set that includes at least one source program map function, determining a transfer map function set that is a set intersection of the target program map function set and the source program map function set, identifying a source program map interaction data set, determining a target program map interaction data set to include each source program map interaction data item from the source program map interaction data set that corresponds with at least one target program map function of the target program map function set, and sending the target program map interaction data set to the target program is disclosed.

Abstract: A mail handler is provided. The mail handler manages a source queue for incoming messages. The source queue has a first count of slots in memory and is associated with a source read pointer and a source write pointer. The mail handler manages the source write pointer and the source read pointer. The mail handler also manages a destination queue for outgoing messages. The destination queue has a second count of slots in memory and is associated with a destination read pointer and a destination write pointer. The mail handler advances the destination write pointer in response to at least one of (i) transferring one or more messages form the source queue to the destination queue and (ii) reserving one or more slots in the destination queue. The at least one processor advances the destination read pointer in response to reading at least one message from the destination queue.

Abstract: A computer-implemented method includes managing function calls between a plurality of nodes and a super node of a rack system having a distributed operating system (OS). The OS includes a plurality of functions divided into first class and a second class, and each of the plurality of nodes excludes functions in the second class. Managing the function calls includes detecting a call to a first function on a first node of the plurality of nodes. It is determined that the first function belongs to the second class of functions and is not available on the first node. The call to the first function is routed to the super node, responsive to determining that the first function belongs to the second class, where the super node includes code for the functions in the second class.

Abstract: A method and associated system for interfacing between a caller application and a service module. Upon receiving a request for performing a transaction that includes at least one caller application attribute describing the request, the service module builds a service module data structure pursuant to the received request. The service module data structure includes a generic service document and at least one service module attribute. Each service module attribute is stored in a relational table of the service module data structure. The request is serviced within the service module data structure, resulting in instantiating the generic service document. The generic service document is returned to the caller application. Storing each service module attribute in the relational table includes: determining a category and a level of a first service module attribute; and storing in the relational table a first container pursuant to the category and the level.

Abstract: A system, method, computer program, and/or computer readable medium for providing application isolation and live migration to one or more applications and their associated resources. The computer readable medium includes computer-executable instructions for execution by a processing system. The computer-executable instructions may be for creating a new isolated environment, for creating a copy of an isolated environment, live migrating applications within and between isolated environments, and for deploying an isolated environment Further, the instructions may be for launching one or more applications within one or more isolated environment, for terminating one or more applications within one or more isolated environments, for configuring resource mappings, exceptions and policies, for triggering a live migrate, and for delivery of one or more applications within isolated environments over the network.

Abstract: A method for detecting abnormal subsequences in data sequence includes constructing a hierarchical data structure of a target subsequence, each node in a bottommost layer of the data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the data structure of the target subsequence and of the first number of reference subsequences constructed in advance, the second number of neighbors having minimum Euclidean distances from the target subsequence; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, which have minimum Euclidean distances from each reference subsequence and determining whether the target subsequence is an abnormal subsequence.

Abstract: A method for verifying bad pattern in time series sensing data by calculating a bad pattern error rate, which can be applied to the time series sensing data measured and produced from a predetermined sensor provided in predetermined equipment, and an apparatus thereof are provided. The method includes receiving information on the bad pattern applied to time series sensing data measured by a suspicious sensor, accessing the time series sensing data of each product, generated by the suspicious sensor during a verification period, calculating similarity measures between the bad pattern based on the bad pattern information and the time series sensing data for each product, and calculating an error rate of the bad pattern based on the similarity measures.

Abstract: A message determination apparatus includes a storage unit that stores messages generated in a system, an extracting unit that extracts a message whose occurrence interval is in a certain range from the messages stored on the storage unit, and a determining unit that determines whether the occurrence interval of the message extracted at the extracting unit is out of a certain range in the messages generated in the system. Accordingly, a fault on the system can be detected when the occurrence interval is out of a certain range.

Abstract: An interrupt supervision system comprises an interrupt controller device comprising a plurality of interrupt request input lines and at least one output line connectable to a processing device.

Abstract: Certain example embodiments address issues associated with erroneous events produced in Complex Event Processing (CEP) applications. An error handler is controlled to at least: receive, via an event bus, events from external input event sources; receive, via the event bus, error events from an application configured to process events received from the event bus, and to provide to the event bus results obtained from processing received events, and error events corresponding to errors detected at its input and/or processing layer(s); generate, for a given error, an error analysis event and an error impact event by executing a CEP query on at least a corresponding received error event; and provide to the event bus generated error analysis events and generated error impact events. Error analysis events describe for administrators detailed information analyzing corresponding errors. Error impact events describe for business users impacts corresponding errors have for their business user applications.

Abstract: A method includes dividing a data object into data partitions. The method further includes, for each data partition: dividing the data partition into data segments; dispersed storage error encoding the data segments to produce sets of encoded data slices; storing the sets of encoded data slices in a first set of storage units; and generating a segment allocation table regarding storage information of the sets of encoded data slices. The method further includes generating a directory of segment allocation tables. The method further includes receiving an access request regarding at least a portion of the data object. The method further includes accessing the directory to identify one or more segment allocation tables containing storage information for the at least a portion of the data object. The method further includes accessing encoded data slices of the at least the portion of the data object based on the storage information.

Abstract: Aspects of the subject matter described herein relate to file system technology. In aspects, a mechanism is described that allows a file system to handle corrupted file system metadata in a way that provides high availability. When corrupted metadata is detected, the corrupted metadata may be deleted while the file system remains online and available to service file input/output operations that involve non-corrupted metadata.

Abstract: Systems and method provide for the writing of a data block and corresponding metadata block to a storage location. Metadata and data block are encoded separately. The metadata and data block may be moved to a different location due to garbage collection, defragmentation, or some other prompt. The metadata is decoded, modified, re-encoded and written to the different location whereas the data block can be written to the new location without re-encoding.

Abstract: A memory system includes an encoding processing circuit configured to perform redundant encoding process on target data for generating data and a memory for writing the generated data by the encoding processing circuit, where a number of bits having a predetermined value are half or less than a total number of bits of the generated data.

Abstract: A system and method for maintaining operation of a storage array with one or more failed storage devices and for quickly recovering when failing devices are replaced are provided. In some embodiments, the method includes receiving a data transaction directed to a volume and determining that a storage device associated with the volume is inoperable. In response to determining that the storage device is inoperable, a data extent is recorded in a change log in a storage controller cache. The data extent is associated with the data transaction and allocated to the storage device that is inoperable. The data transaction is performed using at least one other storage device associated with the volume, and data allocated to the storage device is subsequently reconstructed using the recorded data extent.

Abstract: Various systems to achieve data resiliency in a shared memory pool are presented. Multiple memory modules are associated with multiple data interfaces, one or multiple erasure-coding interfaces are communicatively connected with the multiple data interfaces, and multiple compute elements are communicatively connected with one or multiple erasure-coding interfaces. Data sets are erasure-coded, and the resulting fragments are stored in random access memory modules distributed throughout the system. Storage in RAM allows real-time fetching of fragments using random-access read cycles and streaming of fragments using random-access write cycles, in which read operations include reconstruction of data sets from fetched data fragments, and write operations allow conversion of data sets into fragments which are then streamed and distributively stored.

Abstract: A mass storage memory device is disclosed. The device includes a plurality of blades where two blades are used to store parity data corresponding to data stored in the other blades. The device also includes a controller configured to write data to the blades along stripes extending from the other blades to the two blades, where the parity data within a stripe is based on the data written to the other blades in the stripe, and wherein the parity data includes two or more types of parity data.

Abstract: Tracking changes amongst unit portions (e.g., blocks or files) of a storage system. A logical time identifier is associated with each unit portion and is included within a logical time identifier structure. When writing to a particular write portion, the mechanism updates the appropriate logical time identifiers, calculates redundancy data of a group of one or more logical time identifiers associated with the unit portion(s) of the write portion. Furthermore, the write portion of the storage system is written. In addition, the corresponding redundancy data for that write portion is written to the logical time identifier structure. Later, for a given write portion, the redundancy data is verified to be consistent or inconsistent with the group of one or more logical time identifiers associated with the write portion. If the redundancy data is not consistent, then a current logical time identifier is assigned to each of the logical time identifiers.

Abstract: Methods and systems associated with re-transferring data that was unsuccessfully transmitted to a host are described. According to one embodiment a method includes transferring data from a buffer to a host; receiving an unsuccessful status from the host indicating a transmission error; identifying a block of data being transferred when the transmission error occurred; and re-transferring data in the identified block from the buffer to the host without re-transferring successfully transferred blocks.

Abstract: A peripheral bus error containment and recovery system enables a bus device to experience a fatal bus error and recover without stopping execution of an operating system. When a fatal bus error is detected at the bus device, a bus controller may deactivate a data link layer for a downstream port populated by the bus device, causing an operating system device driver to be uninstalled for the bus device. Then, the operating system device driver may be reinstalled without physically removing the bus device.

Abstract: A computer recovery circuit for a computer includes a detection circuit and a recovery control circuit. The detection circuit includes a first control terminal and a first output terminal. The recovery control circuit includes a second control terminal and a second output terminal. The detection circuit is configured to detect a working status of the computer. The first control terminal is configured to receive the first voltage signal of a first voltage level when the computer malfunctions. The first output terminal is configured to output a control signal of a first voltage level to the second output terminal. The second output terminal outputs a recovery signal having a first voltage level to the south bridge chip, thereby causing the computer to restart.

Abstract: Systems and methods are disclosed for state consistent replication of client data set on a client computer by generating a snapshot of the client data set on a local volume; synchronizing with a remote server volume corresponding to the local volume to create a copy of the client data set on the remote server; performing a master to slave replication of the data set; and taking a snapshot of the server data set to create a mirror of the snapshot of the client data set on the server.

Abstract: A system and method for generating and storing at least one snapshot update. The system and method comprising determining a first set of blocks including blocks that have changed since a time of a previous snapshot, determining a second set of blocks based at least in part on a predetermined amount, generating at least one snapshot update of a volume based at least in part on a combination of the first set of blocks and the second set of blocks, and storing the at least one snapshot update.