Richard A Lethin

6463582, Oct 8, 2002

Oct 21, 1998

09/176112

Richard A. Lethin - New York NY
Charles D. Garrett - Seattle WA
Mikayo Wada - Kawasaki, JP
Mitsuo Sakurai - Kawasaki, JP

Fujitsu Limited - Kawasaki

G06F 945

717158, 717138, 717139

An optimizing object code translation system and method perform dynamic compilation and translation of a target object code on a source operating system while performing optimization. Compilation and optimization of the target code is dynamically executed in real time. A compiler performs analysis and optimizations that improve emulation relative to template-based translation and interpretation such that a host processor which processes larger order instructions, such as 32-bit instructions, may emulate a target processor which processes smaller order instructions, such as 16-bit and 8-bit instructions. The optimizing object code translator does not require knowledge of a static program flow graph or memory locations of target instructions prior to run time. In addition, the optimizing object code translator does not require knowledge of the location of all join points into the target object code prior to execution. During program execution, a translator records branch operations.

8572590, Oct 29, 2013

Sep 16, 2009

12/561152

Richard A. Lethin - New York NY, US
Allen K. Leung - New York NY, US
Benoit J. Meister - New York NY, US
Nicolas T. Vasilache - New York NY, US

Reservoir Labs, Inc. - New York NY

G06F 9/45

717143, 717151

Methods, apparatus and computer software product for source code optimization are provided. In an exemplary embodiment, a first custom computing apparatus is used to optimize the execution of source code on a second computing apparatus. In this embodiment, the first custom computing apparatus contains a memory, a storage medium and at least one processor with at least one multi-stage execution unit. The second computing apparatus contains at least two multi-stage execution units that avow for parallel execution of tasks. The first custom computing apparatus optimizes the code for both parallelism and locality of operations on the second computing apparatus. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

8572595, Oct 29, 2013

Aug 5, 2011

13/204517

Richard A. Lethin - New York NY, US
Allen K. Leung - New York NY, US
Benoit J. Meister - New York NY, US
Nicolas T. Vasilache - New York NY, US

Reservoir Labs, Inc. - New York NY

G06F 9/45

717155, 717127, 717131, 717141, 717147

Computer-executed transformation of source code enables optimization of the code for one or more of parallelism, locality, and memory footprint of operations represented in the source code on a computing apparatus. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules that allow a reader to quickly ascertain the subject matter of the disclosure contained herein. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

20080071783, Mar 20, 2008

Jun 21, 2007

11/766704

Benjamin Langmead - Silver Spring MD, US
Kenneth M. Mackenzie - Atlanta GA, US
Steven K. Reinhardt - Vancouver WA, US
Richard A. Lethin - New York NY, US

G06F 17/30

707 6, 707E17014

A computer software product, methods and apparatus for target report generation are provided. In one embodiment, a trigger pattern is derived from at least one target pattern. Locations within a data set containing the trigger pattern are identified and a target report is generated. In another embodiment, a computing apparatus is provided that produces reports by deriving a trigger pattern, identifying locations within a dataset where the trigger patterns exist and generating a report. In a further embodiment, a computer software product is provided that configures an apparatus to generate a target report. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules that allow a reader to quickly ascertain the subject matter of the disclosure contained herein. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

20100192138, Jul 29, 2010

Feb 4, 2009

12/365780

Allen K. Leung - New York NY, US
Benoit J. Meister - New York NY, US
David E. Wohlford - Portland OR, US
Nicolas T. Vasilache - New York NY, US
Richard A. Lethin - New York NY, US

G06F 9/45
G06F 12/00
G06F 12/02

717150, 711171, 717151, 711E12002

Methods, apparatus and computer software product for local memory compaction are provided. In an exemplary embodiment, a processor in connection with a memory compaction module identifies inefficiencies in array references contained within in received source code, allocates a local array and maps the data from the inefficient array reference to the local array in a manner which improves the memory size requirements for storing and accessing the data. In another embodiment, a computer software product implementing a local memory compaction module is provided. In a further embodiment a computing apparatus is provided. The computing apparatus is configured to improve the efficiency of data storage in array references. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

20100218196, Aug 26, 2010

Apr 16, 2010

12/762281

Allen K. Leung - New York NY, US
Benoit Meister - New York NY, US
Nicolas T. Vasilache - New York NY, US
David E. Wohlford - Portland OR, US
Cedric Bastoul - Voisins-le-Bretonneux, FR
Peter Szilagyi - Medina NY, US
Richard A. Lethin - New York NY, US

G06F 9/44
G06F 9/46

718107, 717160

Methods, apparatus and computer software product for source code optimization are provided. In an exemplary embodiment, a first custom computing apparatus is used to optimize the execution of source code on a second computing apparatus. In this embodiment, the first custom computing apparatus contains a memory, a storage medium and at least one processor with at least one multi-stage execution unit. The second computing apparatus contains at least two multi-stage execution units that allow for parallel execution of tasks. The first custom computing apparatus optimizes the code for parallelism, locality of operations and contiguity of memory accesses on the second computing apparatus. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

20100281160, Nov 4, 2010

Apr 29, 2010

12/770649

Jordi Ros-Giralt - Newport Beach CA, US
Peter Szilagyi - Medina NY, US
James Ezick - Canonsburg PA, US
David E. Wohlford - Portland OR, US
Richard A. Lethin - New York NY, US

G06F 15/16
G06F 15/18

709224, 706 12

Systems, apparatus and methods for the implementation of high-speed network analyzers are provided. A set of high-level specifications is used to define the behavior of the network analyzer emitted by a compiler. An optimized inline workflow to process regular expressions is presented without sacrificing the semantic capabilities of the processing engine. An optimized packet dispatcher implements a subset of the functions implemented by the network analyzer, providing a fast and slow path workflow used to accelerate specific processing units. Such dispatcher facility can also be used as a cache of policies, wherein if a policy is found, then packet manipulations associated with the policy can be quickly performed. An optimized method of generating DFA specifications for network signatures is also presented. The method accepts several optimization criteria, such as min-max allocations or optimal allocations based on the probability of occurrence of each signature input bit.

51801329, Jan 19, 1993

Nov 22, 1991

7/796338

Scott A. Pearson - Cambridge MA
Jin Oh - Cambridge MA
Richard A. Lethin - Cambridge MA
Eric F. Howlett - Groton CT

A45D 4214

248362

A suction device has a flexible cup member whose lower surface defines a flat central zone surrounded by an annular zone sloping inwardly and upwardly at an angle of 2. degree. to 10. degree. with the central zone. An article holder, such as a beverage can receptacle, has a rigid circular base centrally secured to the upper surface of the cup member, opposite the central zone thereof. Any tilting or lifting of the article holder attendantly tilts or pulls the central zone of the cup member upwardly, thereby establishing a retentive suction in a self-setting manner.