Hewlett-packard Development Company, L.P.

Hewlett Packard Enterprise Development LP

Qualcomm Incorporated

Terence Patrick Kelly

Ira Cohen

Dirk Manfred Beyer

Moises Goldszmidt

Christopher H Stewart

Alex Xin Zhang

Alan Hersh Karp

Robert S Schreiber

Dhruva Ranjan Chakrabarti

Janet Lynn Wiener

Wojciech Golab

Julie Anna Symons

Parthasarathy Ranganathan

Goetz Graefe

Naveen Muralimanohar

Sharad Singhal

Harumi Kuno

Matthew D Pickett

Jichuan Chang

Robert E Tarjan

Xiaoyun Zhu

Kimberly Keeton

Zhikui Wang

Xue Liu

Eric T Anderson

Alan Lynn Davis

Doe Hyun Yoon

Kemal Guler

Cipriano A Santos

Yunhong Zhou

Andrew Robert Byde

Steve Y Zhang

According to an example, versioned memory implementation may include comparing a global memory version to a block memory version. The global memory version may correspond to a plurality of memory blocks, and the block memory version may correspond to one of the plurality of memory blocks. A subblock-bit-vector (SBV) corresponding to a plurality of subblocks of the one of the plurality of memory blocks may be evaluated. Based on the comparison and the evaluation, a determination may be made as to which level in a cell of one of the plurality of subblocks of the one of the plurality of memory blocks checkpoint data is stored.

Versioned memory Implementation

A shiftable memory supporting in-memory data structures employs built-in data shifting capability. The shiftable memory includes a memory having built-in shifting capability to shift a contiguous subset of data from a first location to a second location within the memory. The shiftable memory further includes a data structure defined on the memory to contain data comprising the contiguous subset. The built-in shifting capability of the memory to facilitate one or more of movement of the data, insertion of the data and deletion of the data within the data structure.

Shiftable memory supporting in-memory data structures

A system includes an initiator and processing nodes. The initiator distributes portions of a transaction among the processing nodes. Each processing node has at least one downstream neighbor to which the processing node sends commit messages. The commit messages include a commit status of the processing node. The downstream neighbor is also a processing node.

Distributed transaction processing through commit messages sent to a downstream neighbor

A shiftable memory is employed in a system and a method to shift a contiguous subset of stored data within the shiftable memory. The shiftable memory includes a memory having built-in shifting capability to shift a contiguous subset of data stored by the memory from a first location to a second location within the memory. The contiguous subset has a size that is smaller than a total size of the memory. The system further includes a processor to provide an address and the length of the contiguous subset. The method includes selecting the contiguous subset of data and shifting the selected contiguous subset.

Shiftable memory

In one example, a method for implementing recovery segments includes sending an application message from a parent process executed by a first computing device to a child process executed by a second computing device and identifying a dependency created by the application message. This identified dependency is included in a dependence set of the child process and saved. A checkpoint is generated by the parent process and a checkpoint message that includes dependency information is sent from the parent process to the child process. The child process modifies the dependence set according to the dependency information and generates a second checkpoint that is saved in nonvolatile memory of the second computing device. Upon occurrence of a failure of the parent process, the child process reverts to a most recent checkpoint generated by the child process that does not include the effects of processing an orphan message.

Recovery segments

Example embodiments disclosed herein relate to the determination of maximal independent sets (MISs) of mobile devices. Example embodiments include participating with other mobile devices of a plurality of mobile devices in concurrent distributed determinations of a plurality of MISs of the mobile devices and selecting one of the plurality of MISs.

Determination of maximal independent sets of mobile devices

A technique includes monitoring a first cumulative number of transactions arriving into a processing station and monitoring the second cumulative number of transactions completed by the station. The technique includes based on the first and second cumulative numbers, determining at least one of a transaction waiting time of the station and a predicted reduction in the transaction waiting time due to processor expansion.

Application performance analysis for a multiple processor queuing station

Embodiments of the present invention pertain to dynamically resizing a virtual machine container. According to one embodiment, an optimal utilization is determined based on a desired performance for a multi-tiered application and transaction mix information that describes a mix of transactions that result from executing the multi-tiered application. Automatic modification of an amount of a physical resource a virtual machine container is entitled to for executing a particular application component associated with the multi-tiered application is enabled where the amount is automatically modified based on the optimal utilization.

Dynamically resizing a virtual machine container

An embodiment of a method of scheduling computer processing begins with a first step of receiving job properties for a plurality of jobs to be processed in a multi-processor computing environment. At least some of the jobs each comprise a plurality of stages, one or more tasks for each stage, and precedence constraints among the stages. The method continues with a second step of determining a schedule for processing at least a subset of the plurality of jobs on processors within the multi-processor computing environment from a solution of a mathematical program that provides a near maximal completion reward. The schedule comprises a sequence of tasks for each processor. In a third step, the computer processing jobs are processed on the processors according to the sequence of tasks for each processor.

Scheduling computer processing jobs that have stages and precedence constraints among the stages

A set of solutions satisfying a constraint for an auction winner-determination problem are computed by generating a graph of paths, wherein each path represents a solution to the auction winner-determination problem that satisfies the constraint.

Constraint satisfaction for solutions to an auction winner-determination problem

An embodiment of a method of dispatching tasks in a multi-processor computing environment begins with a step of a dispatcher within the multi-processor computing environment receiving job properties for a plurality of jobs to be processed in the multi-processor computing environment. Each job comprises at least one task. In a second step, the dispatcher employs an initial dispatching rule to assign an initial subset of tasks to processors within the multi-processor computing environment. The method continues with a third step of the dispatcher monitoring system status of the multi-processor computing environment. In a fourth step, the dispatcher selects a second dispatching rule from a plurality of dispatching rules in response to a change in the system status. In a fifth step, the dispatcher employs the second dispatching rule to assign a second subset of tasks to the processors.

Method of dispatching tasks in multi-processor computing environment with dispatching rules and monitoring of system status

An embodiment of a method of allocating computing resources begins with a first step of identifying applications which comprise candidates for execution on a shared computing system. In a second step, the method identifies at least one subset of the computing resources for each application. Each subset for a particular application comprises sufficient resources to support the particular application. The method continues with a third step of assigning a value to each subset. The method concludes with a fourth step of determining an assignment of the computing resources to the applications which provides a near maximal overall value.

Method of allocating computing resources

A method of computing at least one solution to an auction winner-determination problem includes receiving a plurality of bids in an auction and computing at least one solution to an auction winner-determination problem for the auction using the plurality of bids.

Computing a set of K-best solutions to an auction winner-determination problem

A method for determining performance of an application in a system is described herein. The method includes receiving performance data of the application, the performance data includes a plurality of types of transactions performed by the application, a counted number of transactions for each of the plurality of transaction types as performed by the application, and a total service time by the system of the counted number of transactions of each of the plurality of transaction types; calibrating a performance model of the application in accordance with the received performance data; and calculating an expected performance of the application by the system based on the performance model calibration and the received performance data.

Determining performance of an application based on transactions

An embodiment of a method of dividing past computing instances into predictable and unpredictable sets begins with a first step of a computing entity storing a training data set comprising past computing instances. Each past computing instance comprises attributes and a past computing value. In a second step, the computing entity separates the training data set into a predictable set of past computing instances and an unpredictable set of past computing instances. According to an embodiment, a method of predicting a computing value begins with the first and second steps. The method of predicting the computing value continues with a third step of the computing entity forming a predictor from the predictable set of past computing instances. In a fourth step, the computing entity applies the predictor to a pending computing instance that meets a predictability test to determine a predicted value for the pending computing instance.

Growing community of inventors

Palo Alto, CA, United States of America

Terence Patrick Kelly