Search

Dingshan He

from Sammamish, WA
Age ~46
Get Report
Also known as:
He Dingshan
Phone and address:
27405 SE 8Th Pl, Redmond, WA 98075
(425) 281-2109
Related to:
Li Xu, 44Lihsueh Sun Cheng, 64Huan Li, 40Jennifer Sheng, 54Li Shen, 50
Connected to:
Baokun He, 48Bo He, 48Bryan D He, 30Camille A He, 45Chenxu He, 46Congzhou He, 52Dajiang He, 71Denis He, 34Diana He, 30Dong M He, 66

Dingshan He Phones & Addresses

  • 27405 SE 8Th Pl, Sammamish, WA 98075 (425) 281-2109
  • Bellevue, WA
  • Highland Park, NJ
  • 1011 29Th St, Minneapolis, MN 55414 (612) 379-4669
  • 600 University Ave, Minneapolis, MN 55414 (612) 379-4669
  • 200 Union St SE, Minneapolis, MN 55455
  • Kiona, WA
  • 27405 SE 8Th Pl, Sammamish, WA 98075 (612) 379-4669

Work

Company: Google Mar 2011 Position: Software engineer

Education

Degree: PhD School / High School: University of Minnesota-Twin Cities 2000 to 2006 Specialities: Computer Sciences

Industries

Computer Software

Resumes

Resumes

Dingshan He Photo 1

Software Engineer

View page
Location:
1011 29Th Ave southeast, Minneapolis, MN 55414
Industry:
Computer Software
Work:
Google since Mar 2011
Software Engineer
Microsoft Corporation Nov 2009 - Mar 2011
Senior Software Development Engineer
Microsoft Corporation Aug 2006 - Oct 2009
Software Development Engineer 2
University of Minnesota Sep 2000 - Jul 2006
Graduate Assistant
IBM Jun 2005 - Aug 2005
Summer Intern
Education:
University of Minnesota-Twin Cities 2000 - 2006
PhD, Computer Sciences Peking University 1996 - 2000
BS, Computer Sciences

Publications

Us Patents

System, Method, And Service For Providing A Generic Raid Engine And Optimizer

View page
US Patent:
8032782, Oct 4, 2011
Filed:
Jun 4, 2008
Appl. No.:
12/133224
Inventors:
Dingshan He - Bellevue WA, US
Deepak R. Kenchammana Hosekote - San Jose CA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 11/00
US Classification:
714 61, 711114
Abstract:
A generic RAID engine system accepts an access request, accepts a metadata input comprising a layout description and, optionally, a plurality of resource optimization objectives, accepts a dynamic input comprising a dynamic state of an I/O stack comprising the generic RAID engine and a fault configuration of a plurality of storage devices in the I/O stack, and accepts RAID code input comprising information about the RAID code used by the I/O stack. The metadata input, the dynamic input, and the RAID code input are utilized to transform the access request into individual device reads and individual device writes such that RAID code relationships for the storage devices are maintained at all times. An optional optimizer module selects strategies that meet the resource optimization objectives.

System, Method, And Service For Providing A Generic Raid Engine And Optimizer

View page
US Patent:
20080183963, Jul 31, 2008
Filed:
Jan 31, 2007
Appl. No.:
11/669464
Inventors:
Dingshan HE - Bellevue WA, US
Deepak R. KENCHAMMANA HOSEKOTE - San Jose CA, US
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:
G06F 12/00
US Classification:
711114, 711E12001
Abstract:
A generic RAID engine system accepts an access request, accepts a metadata input comprising a layout description and, optionally, a plurality of resource optimization objectives, accepts a dynamic input comprising a dynamic state of an I/O stack comprising the generic RAID engine and a fault configuration of a plurality of storage devices in the I/O stack, and accepts RAID code input comprising information about the RAID code used by the I/O stack. The metadata input, the dynamic input, and the RAID code input are utilized to transform the access request into individual device reads and individual device writes such that RAID code relationships for the storage devices are maintained at all times. An optional optimizer module selects strategies that meet the resource optimization objectives.

Cache Arrangement For Improving Raid I/O Operations

View page
US Patent:
20080270704, Oct 30, 2008
Filed:
Apr 30, 2007
Appl. No.:
11/741826
Inventors:
Dingshan He - Bellevue WA, US
International Classification:
G06F 12/02
G06F 15/16
US Classification:
711129, 709203
Abstract:
The embodiments of the invention provide a method, apparatus, etc. for a cache arrangement for improving RAID I/O operations. More specifically, a method begins by partitioning a data object into a plurality of data blocks and creating one or more parity data blocks from the data object. Next, the data blocks and the parity data blocks are stored within storage nodes. Following this, the method caches data blocks within a partitioned cache, wherein the partitioned cache includes a plurality of cache partitions. The cache partitions are located within the storage nodes, wherein each cache partition is smaller than the data object. Moreover, the caching within the partitioned cache only caches data blocks in parity storage nodes, wherein the parity storage nodes comprise a parity storage field. Thus, caching within the partitioned cache avoids caching data blocks within storage nodes lacking the parity storage field.

Cache Arrangement For Improving Raid I/O Operations

View page
US Patent:
20080270878, Oct 30, 2008
Filed:
Mar 31, 2008
Appl. No.:
12/059067
Inventors:
Dingshan He - Bellevue WA, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
H03M 13/05
G06F 11/10
US Classification:
714805, 714E11032
Abstract:
The embodiments of the invention provide a method, apparatus, etc. for a cache arrangement for improving RAID I/O operations. More specifically, a method begins by partitioning a data object into a plurality of data blocks and creating one or more parity data blocks from the data object. Next, the data blocks and the parity data blocks are stored within storage nodes. Following this, the method caches data blocks within a partitioned cache, wherein the partitioned cache includes a plurality of cache partitions. The cache partitions are located within the storage nodes, wherein each cache partition is smaller than the data object. Moreover, the caching within the partitioned cache only caches data blocks in parity storage nodes, wherein the parity storage nodes comprise a parity storage field. Thus, caching within the partitioned cache avoids caching data blocks within storage nodes lacking the parity storage field.
Control profile
Dingshan He from Sammamish, WA, age ~46 Get Report