Search

Hao H Feng

from Bellevue, WA
Age ~52

Hao Feng Phones & Addresses

  • 205 106Th Ave SE, Bellevue, WA 98004
  • 14203 6Th St, Bellevue, WA 98007 (425) 562-8738
  • 3010 172Nd Ave, Redmond, WA 98052 (425) 881-2360
  • 1166 Schulte Hill Dr, Maryland Heights, MO 63043 (314) 368-5389
  • Saint Louis, MO
  • Kiona, WA
  • 205 106Th Ave SE, Bellevue, WA 98004 (425) 301-1247

Work

Company: Amazon.com inc - Seattle, WA Jun 2013 Position: Software development engineer intern

Education

School / High School: Hunan University Jun 2007 Specialities: M. Sc. in Computational Mathematics

Skills

Distributed Systems • C++ • Software Development • Software Engineering • Agile Methodologies • Software Design • C# • Object Oriented Design • .Net • Cloud Computing • Team Leadership • Algorithms • Scalability • Visual Studio • Web Services • Scrum • Wcf • Xml • Java • Windows Azure • Win32 Api

Industries

Computer Software

Professional Records

Medicine Doctors

Hao Feng Photo 1

Hao Feng

View page
Specialties:
Internal Medicine
Work:
NYU Langone Graduate Medical Program
550 1 Ave, New York, NY 10016
(212) 263-5506 (phone), (212) 263-7002 (fax)
Education:
Medical School
Yale University School of Medicine
Graduated: 2014
Languages:
English
Description:
Dr. Feng graduated from the Yale University School of Medicine in 2014. He works in New York, NY and specializes in Internal Medicine.

Resumes

Resumes

Hao Feng Photo 2

Chief Architect, Cloud Storage

View page
Location:
205 106Th Ave, Bellevue, WA 98004
Industry:
Computer Software
Work:
Microsoft
Senior Software Design Engineer
Education:
Northwestern Polytechnic University (CN)
Bachelor of Engineering (B.E.), Computer Science and Engineering
University of Missouri-Rolla
Master of Science (MS), Computer Science
Skills:
Distributed Systems
C++
Software Development
Software Engineering
Agile Methodologies
Software Design
C#
Object Oriented Design
.Net
Cloud Computing
Team Leadership
Algorithms
Scalability
Visual Studio
Web Services
Scrum
Wcf
Xml
Java
Windows Azure
Win32 Api
Hao Feng Photo 3

Hao Feng Newark, DE

View page
Work:
Amazon.com Inc
Seattle, WA
Jun 2013 to Sep 2013
Software Development Engineer Intern

Broadcom Corp
Sunnyvale, CA
Jun 2012 to Sep 2012
System Engineer Intern

Hunan University

Jul 2006 to Aug 2006
Part-time Software Development Engineer

Education:
Hunan University
Jun 2007
M. Sc. in Computational Mathematics

Hunan University
Jun 2004
B. Sc in Applied Mathematics

University of Delaware
Newark, DE
Ph. D. in Electrical and Computer Engineering

Business Records

Name / Title
Company / Classification
Phones & Addresses
Hao Feng
Morning Pioneer, LLC
Wholesale General Merchandise
3010 172 Ct NE, Redmond, WA 98052
(425) 301-1247

Publications

Us Patents

Modified Tripod And “Multi-Pod” For Cameras And Other Equipment

View page
US Patent:
7780126, Aug 24, 2010
Filed:
Apr 5, 2007
Appl. No.:
11/696740
Inventors:
David Law - Seattle WA, US
Ryan Mongan - Sammamish WA, US
Andrew Grant - Callander, GB
Graeme Esarey - Seattle WA, US
Martin Aaron Leugers - San Francisco CA, US
Josh Druker - San Francisco CA, US
Hao Yu Feng - Mountain View CA, US
Tark Abed - Palo Alto CA, US
Assignee:
Daymen Photo Marketing LP - Markham CA
International Classification:
F16M 11/38
US Classification:
248168, 396428
Abstract:
As one of the examples, one of the main features is that the setup is small enough that it can live with the camera full-time, and carried around by the user. The legs fold into a very compact size that fit within the footprint of the camera, used for any type camera, e. g. compact point-and-shoot camera, camera phone, or SLR camera. The tripod can then live unnoticed on the bottom of the camera, until a shot requiring a tripod is needed. Then, the legs can be deployed to act as a firm stand. Another one of the main features of this tripod is that all the legs do not share a common end-point or pivot-point. This allows the legs to form a very wide stable platform, even when they are short. In general, for N legs, some legs may have common end-points or pivot-points, but not for all N legs. (N is a positive integer, greater or equal to 3. ) This invention can be applied to any camera (e. g.

Synchronizing Data Between Business Applications

View page
US Patent:
7925625, Apr 12, 2011
Filed:
Sep 20, 2007
Appl. No.:
11/858332
Inventors:
Ashvin J Mathew - Kirkland WA, US
Nicolae Surpatanu - London, GB
Hao Feng - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707610
Abstract:
Architecture for synchronizing data between business applications according to a multi-master arrangement. Changes to business entities can be snapshot changes, delta changes, and long-running process changes, the latter which can be derived from the first two. The architecture includes automatic error retry logic, such that when synchronization errors occur, the logic can be replayed to resolve the errors, when conditions have changed where the errors can be resolved. This also applies to when one error causes a cascading set of errors. By replaying one error, the other errors will be resolved. Backup and restore of a participating application is also provided such that a new data change in a non-backup-restored application will automatically be synchronized to the recently-restored system.

Asynchronous Execution Of Software Tasks

View page
US Patent:
20090083740, Mar 26, 2009
Filed:
Sep 20, 2007
Appl. No.:
11/858331
Inventors:
Ashvin J. Mathew - Kirkland WA, US
Nicolae Surpatanu - London, GB
Hao Feng - Redmond WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/46
US Classification:
718102
Abstract:
A service broker for asynchronous execution of software. The broker functions include dynamically loading working modules from a specified directory, publishing the working module commands, receiving service requests from clients, and upon successful authentication and authorization, dispatching the requests to module command queues for scheduling and execution. The modules are invoked in separate domains so that management functions can control the modules independently. A management application facilitates interactive user scheduling of the actions being invoked. This can also be accomplished automatically according to business rules, for example. The management application also facilitates checking the progress on an action that is occurring, displaying errors that occur during the command execution, results of an action can also be displayed, and scheduling of requests.

Staging Anchor Trees For Improved Concurrency And Performance In Page Range Index Management

View page
US Patent:
20220405262, Dec 22, 2022
Filed:
Aug 24, 2022
Appl. No.:
17/894925
Inventors:
- Redmond WA, US
Jegan DEVARAJU - Redmond WA, US
Shane MAINALI - Duvall WA, US
Quan ZHANG - Kenmore WA, US
Sridhar SRINIVASAN - Shanghai, CN
Bin TONG - Bellevue WA, US
He SU - Shanghai, CN
Ju WANG - Cupertino CA, US
Manish CHABLANI - Redmond WA, US
Hao FENG - Bellevue WA, US
International Classification:
G06F 16/22
G06F 16/215
G06F 7/14
Abstract:
Anchor tree cross-merge within a distributed storage system. A computer system identifies a data structure that includes (i) a root anchor tree and (ii) an ordered set of anchor trees that are ordered based on their creation, such that a last anchor tree of the ordered set of anchor trees is most-recently created. The data structure stores index data for a set of objects stored in a non-volatile storage. The computer system creates a new anchor tree in the ordered set of anchor trees. The computer system identifies, from a set of delta tables, index data representing one or more objects that are stored on the non-volatile storage. The computer system merges the index data representing the one or more objects into the new anchor tree.

Online Schema Change Of Range-Partitioned Index In A Distributed Storage System

View page
US Patent:
20200142868, May 7, 2020
Filed:
Jun 30, 2017
Appl. No.:
16/617443
Inventors:
- Redmond WA, US
Jianwu GAO - Shanghai, CN
Jegan DEVARAJU - Redmond WA, US
Shane MAINALI - Duvall WA, US
Zichen SUN - Sammamish WA, US
Quan ZHANG - Kenmore WA, US
Venkates Paramasivam BALAKRISHNAN - Redmond WA, US
Shaoyu ZHANG - Shanghai, CN
Kaifeng ZHU - Nanjing, CN
Ju WANG - Cupertino CA, US
Manish CHABLANI - Redmond WA, US
Hao FENG - Bellevue WA, US
Assignee:
Microsoft Technology Licensing, LLC - Redmond WA
International Classification:
G06F 16/21
G06F 16/22
G06F 16/23
G06F 16/27
Abstract:
A distributed storage system includes table controllers collectively storing partitions of a logical table having multiple rows. For each of the partitions, a corresponding table controller stores a subset of the rows of the logical table across individual pages. A management controller updates a schema of the logical table from a first to a second schema definition by, for each of the partitions, sending an update command indicating the second schema definition to the corresponding table controller. The first table controller corresponds to a first partition that includes a first subset of the rows. The first table controller, prior to receiving the update command, includes an identifier of the first schema definition within each page of data for the first subset. Subsequent to receiving the update command, the first table controller, when writing each new page of data for the first subset, includes an identifier of the second schema definition.

Staging Anchor Trees For Improved Concurrency And Performance In Page Range Index Management

View page
US Patent:
20200142878, May 7, 2020
Filed:
Jun 30, 2017
Appl. No.:
16/617432
Inventors:
- Redmond WA, US
Jegan DEVARAJU - Redmond WA, US
Shane MAINALI - Duvall WA, US
Quan ZHANG - Kenmore WA, US
Sridhar SRINIVASAN - Shanghai, CN
Bin TONG - Bellevue WA, US
He SU - Shanghai, CN
Ju WANG - Cupertino CA, US
Manish CHABLANI - Redmond WA, US
Hao FENG - Bellevue WA, US
Assignee:
Microsoft Technology Licensing, LLC - Redmond WA
International Classification:
G06F 16/22
G06F 7/14
G06F 16/215
Abstract:
A distributed storage system includes non-volatile storage storing portions of a first object. The first object encompasses data having a first range of addresses and each portion includes data for a respective range of addresses that is a proper subset of the first range. A first data structure stores, for each portion, data indicating the respective range of addresses and a pointer to where the portion is stored. The first data structure includes a root tree and a set of trees ordered by creation data such that a last tree is most-recently created. The non-volatile storage stores received write data and a write buffer stores index data pointing to storage locations of the received write data. An index management system stores the index data from the write buffer into the last tree and, if the ordered set is empty, creates a tree in the ordered set before the storing.

File Table Index Aggregate Statistics

View page
US Patent:
20180300350, Oct 18, 2018
Filed:
Apr 18, 2017
Appl. No.:
15/490741
Inventors:
- Redmond WA, US
Krishnan VARADARAJAN - Redmond WA, US
Quan ZHANG - Kenmore WA, US
Jegan DEVARAJU - Redmond WA, US
Zichen SUN - Sammamish WA, US
Hao FENG - Redmond WA, US
Ju WANG - Santa Clara WA, US
Manish CHABLANI - Redmond WA, US
International Classification:
G06F 17/30
Abstract:
Embodiments provide a method to collect aggregate information or usage data quickly and efficiently with minimal lag. Additionally, the system can use this aggregate information internally for improved load balancing, better data placement, optimization, and enhanced debugging. The system can quickly look at aggregate information across a huge amount of data and drill down cheaply because the aggregate information is generated using existing processes. Aggregated statistics storage and collection may be built on top of an LSM tree used to store a persistent index for a cloud storage system. The statistics may also represent the result of an operation (e.g., max, min, sum, average) on selected parameter(s) or attribute(s) of stored data. Aggregate statistics values may be efficiently maintained during index merge and garbage collection processes or any other index management. As delta LSM trees are merged into a base LSM tree, the aggregates are updated in delta fashion.
Hao H Feng from Bellevue, WA, age ~52 Get Report