Yi Zhou

US Patent:

7028089, Apr 11, 2006

Filed:

Sep 21, 2001

Appl. No.:

09/960448

Inventors:

Rajesh Agarwalla - Pittsburgh PA, US
Thirumale Niranjan - Pittsburgh PA, US
Srikanth Ramamurthy - Pittsburgh PA, US
Yi Zhou - Pittsburgh PA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/16

US Classification:

709229, 709203, 709219

Abstract:

A method, apparatus, and computer implemented instructions for managing data in a network data processing system. A packet containing data associated with content is received. A determination is made as to whether the packet is enabled for content distribution by examining the data packet. Responsive to the packet being enabled for content distribution, the content is distributed in response to a request for the content without requiring a validity check. If the packet is not enabled for content distribution, a validity check is performed on the content using control information contained within the header of the data packet.

US Patent:

7991753, Aug 2, 2011

Filed:

May 21, 2004

Appl. No.:

10/851812

Inventors:

Sudhir G. Rao - Portland OR, US
Myung M. Bae - Pleasant Valley NY, US
Thomas K. Clark - Gresham OR, US
Douglas Griffith - Apex NC, US
Roger L. Haskin - Morgan Hill CA, US
Shah Mohammad Rezaul Islam - Tucson AZ, US
Felipe Knop - Lagrangeville NY, US
Soumitra Sarkar - Cary NC, US
Frank B. Schmuck - Campbell CA, US
Theodore B. Vojnovich - Cary NC, US
Yi Zhou - Pittsburgh PA, US
Robert Curran - West Harley NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00

US Classification:

707704, 709226

Abstract:

The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

US Patent:

20110089415, Apr 21, 2011

Filed:

Oct 15, 2010

Appl. No.:

12/905675

Inventors:

Wei Han - Riverside CA, US
Yi Zhou - Pasadena CA, US
Roland K. Kawakami - Riverside CA, US

Assignee:

THE REGENTS OF THE UNIVERSITY OF CALIFORNIA - Oakland CA

International Classification:

H01L 29/38
H01L 21/20

US Classification:

257 43, 438 3, 257E21132, 257E29105

Abstract:

The embodiments disclosed herein relate to growth of magnesium-oxide on a single crystalline substrate of germanium. The embodiments further describes a method of manufacturing and crystalline structure of a FM/MgO/Ge(001) heterostructure. The embodiments further related to method of manufacturing and a crystalline structure for a high-k dielectric//MgO [100](001)//Ge[110](001) heterostructure.

US Patent:

20110258306, Oct 20, 2011

Filed:

Jun 25, 2011

Appl. No.:

13/168952

Inventors:

Sudhir G. Rao - Beaverton OR, US
Myung M. Bae - Pleasant Valley NY, US
Thomas K. Clark - Gresham OR, US
Douglas Griffith - Apex NC, US
Roger L. Haskin - Morgan Hill CA, US
Shah Mohammad Rezaul Islam - Cary NC, US
Felipe Knop - Lagrangeville NY, US
Soumitra Sarkar - Cary NC, US
Frank B. Schmuck - Campbell CA, US
Theodore B. Vojnovich - Cary NC, US
Yi Zhou - Pittsburgh PA, US
Robert Curran - West Hurley NY, US

International Classification:

G06F 15/173

US Classification:

709223

Abstract:

The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.