Google Inc.

Microsoft Technology Licensing, LLC

Stephen Robert Adams

Craig D Chambers

Ashish Raniwala

Frances J Perry

Robert R Henry

Robert Bradshaw

Nathan Weizenbaum

Thomas Dee McGuire

Manuvir Das

Jordan Tigani

Nurit Dor

A data parallel pipeline may specify multiple parallel data objects that contain multiple elements and multiple parallel operations that operate on the parallel data objects. Based on the data parallel pipeline, a dataflow graph of deferred parallel data objects and deferred parallel operations corresponding to the data parallel pipeline may be generated and one or more graph transformations may be applied to the dataflow graph to generate a revised dataflow graph that includes one or more of the deferred parallel data objects and deferred, combined parallel data operations. The deferred, combined parallel operations may be executed to produce materialized parallel data objects corresponding to the deferred parallel data objects.

Parallel processing of data

A system and method are provided to (a) convert an older or base version of software into an alternate representation of the base version; (b) convert a newer or updated version of software into an alternate representation of the updated version; (c) compare the alternate updated version with the alternate base version (d) modify portions of the alternate updated version based on the comparison and (e) create a patch, where the patch represents the differences between the alternate updated version and the alternate base version.

System and method of updating programs and data

A data compression method and system replaces pairs of symbols in a string of symbols by a single new symbol. A method for selecting the pairs of symbols to be replaced employs a modified greedy algorithm. The method selects a next best pair of symbols for replacement by considering pairs that have a potential for usurping a current best candidate pair of symbols, due to their frequency of occurrence. A minimum savings threshold is evaluated to further avoid exhaustive searches of all possible pairs of symbols.

Method and system for selecting grammar symbols for variable length data compressors

Described is a method and system for performing path-sensitive value flow analysis on a software program. Concrete state and value alias information is tracked along each statement and each relevant path in an abstract program and is stored as a symbolic state in a symbolic store. The value alias information includes a first set of aliases that identify aliases for a designated value that is being analyzed and a second set of aliases that identify possible aliases for the designated value. The value alias information is obtained using imprecise memory alias analysis. Along each relevant path for each statement, transforms are applied to the sets of aliases to update the first and second sets of aliases. The transforms are applied based on the type of statement being processed. Symbolic states existing at the same location are merged if the value alias information is identical within the symbolic states.

System and method for performing path-sensitive value flow analysis on a program

Growing community of inventors

Seattle, WA, United States of America

Stephen Robert Adams