Allen M Leung

US Patent:

20100070956, Mar 18, 2010

Filed:

Sep 16, 2009

Appl. No.:

12/561152

Inventors:

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

International Classification:

G06F 9/45

US Classification:

717143, 717161, 717160

Abstract:

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 mufti-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.

US Patent:

20100192138, Jul 29, 2010

Filed:

Feb 4, 2009

Appl. No.:

12/365780

Inventors:

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

International Classification:

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

US Classification:

717150, 711171, 717151, 711E12002

Abstract:

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.

US Patent:

20100218196, Aug 26, 2010

Filed:

Apr 16, 2010

Appl. No.:

12/762281

Inventors:

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

International Classification:

G06F 9/44
G06F 9/46

US Classification:

718107, 717160

Abstract:

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.

US Patent:

20130259027, Oct 3, 2013

Filed:

Mar 30, 2012

Appl. No.:

13/436295

Inventors:

Allen Yuk Leung Yu - San Dimas CA, US
Shuchuan Yao - Irvine CA, US

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

H04L 12/66

US Classification:

370352

Abstract:

In one implementation, voice service discovery may include a voice service discovery protocol (VSDP) and a VSDP device, which receives voice virtual local area network data and generates a packet including root voice service configuration data. The VSDP device may be in an enabled state, a listening state, or a disabled state. Receiving voice service configuration data may initiate the enabled state in the VSDP device, and the packet may be transmitted to a remote device. Voice service discovery may include advertising a voice service to a plurality of voice over internet protocol endpoints according to the root voice service configuration data.

US Patent:

8572595, Oct 29, 2013

Filed:

Aug 5, 2011

Appl. No.:

13/204517

Inventors:

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

Assignee:

Reservoir Labs, Inc. - New York NY

International Classification:

G06F 9/45

US Classification:

717155, 717127, 717131, 717141, 717147

Abstract:

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.

US Patent:

20200278847, Sep 3, 2020

Filed:

May 18, 2020

Appl. No.:

16/876739

Inventors:

- New York NY, US
Allen K. Leung - New York NY, US
Benoit J. Meister - New York NY, US
David E. Wohlford - Portland OR, US

International Classification:

G06F 8/41

Abstract:

Methods, apparatus and computer software product for optimization of data transfer between two memories includes determining access to master data stored in one memory and/or to local data stored in another memory such that either or both of the size of total data transferred and the number of data transfers required to transfer the total data can be minimized. The master and/or local accesses are based on, at least in part, respective structures of the master and local data.

US Patent:

20180307470, Oct 25, 2018

Filed:

Dec 11, 2017

Appl. No.:

15/837551

Inventors:

- New York NY, US
Allen K. Leung - New York NY, US
Benoit J. Meister - New York NY, US
David E. Wohlford - Portland OR, US

International Classification:

G06F 8/41

Abstract:

Methods, apparatus and computer software product for optimization of data transfer between two memories includes determining access to master data stored in one memory and/or to local data stored in another memory such that either or both of the size of total data transferred and the number of data transfers required to transfer the total data can be minimized. The master and/or local accesses are based on, at least in part, respective structures of the master and local data.

US Patent:

20140165047, Jun 12, 2014

Filed:

Feb 14, 2014

Appl. No.:

14/181201

Inventors:

- New York NY, US
Allen K. Leung - New York NY, US
Benoit J. Meister - New York NY, US
David E. Wohlford - Portland OR, US

International Classification:

G06F 9/45

US Classification:

717151

Abstract:

Methods, apparatus and computer software product for optimization of data transfer between two memories includes determining access to master data stored in one memory and/or to local data stored in another memory such that either or both of the size of total data transferred and the number of data transfers required to transfer the total data can be minimized. The master and/or local accesses are based on, at least in part, respective structures of the master and local data.