Microsoft Technology Licensing, LLC

Microsoft Corporation

Roman Snytsar

Sashi Raghupathy

Richard Jennings Duncan

Zoltan C Szilagyi

Herry Sutanto

Timothy H Kannapel

Jamie N Wakeam

Jerome J Turner

Haiyong Wang

Todd M Landstad

David Earl Heckerman

Bodin Dresevic

Eric S Chung

Gavin M Gear

Subha Bhattacharyay

Daniel Lo

Ravindra Pandya

Kalin Ovtcharov

Sebastian Poulose

Benoit Jules Jurion

Terri L Chudzik

Lidia Schwarz

Amber P Race

Jerome Turner

Jamie Wakeam

Richard Duncan

Todd Landstad

Zolton Szilagyi

Solutions for improving parallelization of computer programs interleave machine instruction placement in memory. A compiler decomposes a software loop in stages to interleave instructions such that, for contiguous sets of instructions having some minimum length (e.g., each set has at least two to four instructions), instructions within a set have no dependency on prior instructions within that set. This enables the compiled program to be more fully parallelized—for example, either by a superscalar processor executing the compiled program, or by the compiler turning each set of instructions into a very long instruction word (VLIW)—to automatically benefit from the disclosed interleaving of instructions that eliminates dependencies.

Interleaved machine instruction placement in memory

Comparisons between two nucleotide sequences can be performed by customized integrated circuitry that can implement a Smith Waterman analysis in a reduced memory footprint, storing and referencing only individual portions, or subsections, of a two-dimensional matrix that is representative of the comparison between the two nucleotide sequences. As the backtracking proceeds, backtracking metadata corresponding to a cell from a subsection that is not currently retained in memory can be required. Such a subsection can be regenerated from previously generated scores associated with checkpoint cells of the two-dimensional matrix that comprise two edges of the subsection being regenerated. Moreover, to further reduce memory consumption, the backtracking metadata stored for each cell can comprise four binary digits: two indicative of a directional assignment, one indicative of whether the corresponding cell is part of a deletion stretching across multiple contiguous cells, and one analogously indicative of insertions stretching across multiple contiguous cells.

Reduced memory nucleotide sequence comparison

A system and method for assisting with analysis and recognition of ink is described. Analysis hints may be associated with a field. The field may receive electronic ink. Based on the identity of the field and the analysis hint associated with it, at least one of analysis and recognition of ink may be assisted.

Analysis hints

An application programming interface instantiates an ink analyzer object that receives document data for a document containing electronic ink content from a software application hosting the document and running on a first processing thread. The ink analyzer object then employs the first thread to make a copy of the document data, provides the copy of the document data to an electronic ink analysis process, and returns control of the first processing thread to the analysis process. After the analysis process has analyzed the electronic ink, the ink analyzer object reconciles the results of the analysis process with current document data for the document.

Electronic ink processing

Growing community of inventors

Redmond, WA, United States of America

Roman Snytsar