William Wai Yuen Wu

7039750, May 2, 2006

Jul 24, 2001

09/912231

Jack Regula - San Jose CA, US
Jhy-Ping Shaw - San Jose CA, US
Ronald A. Simmons - Bountiful UT, US
Curtis Winward - Lehi UT, US
Ralph Woodard - Mountain View CA, US
William Wu - Cupertino CA, US

PLX Technology, Inc. - Sunnyvale CA

G06F 13/00

710317, 710242

A system for communication on a chip. The system includes an on-chip communication bus including plural tracks, and a plurality of stations that couple a plurality of on-chip components to the on-chip communication bus, whereby the plurality of on-chip components use the tracks to communicate. Each station preferably includes an initiator that requests permission to transmit outgoing data over a track to another station and that transmits the outgoing data, an arbiter that evaluates requests from other stations and selects a track on which to receive incoming data, and a target that receives the incoming data. The initiator can be connected to a grant multiplexor for selecting a grant line, with the grant multiplexor further including plural smaller multiplexors distributed across the chip. Likewise, the arbiter can be connected to a track multiplexor for selecting a track, with the track multiplexor further including plural smaller multiplexors distributed across the chip. Each station also can include a source queue for queuing outgoing data and a destination queue for queuing incoming data.

RE40921, Sep 22, 2009

Oct 4, 2001

09/972704

William S. Wu - Cupertino CA, US
Peter D. MacWilliams - Aloha OR, US
Stephen Pawlowski - Beaverton OR, US
Muthurajan Jayakumar - Sunnyvale CA, US

Intel Corporation - Santa Clara CA

G06F 13/00

710107, 711140, 711146, 711169, 711100, 710100

A bus agent defers an ordered transaction if the transaction cannot be completed in order. When an ordered transaction is deferred, its visibility for the next ordered transaction is asserted if it can guarantee a sequential order of the ordered transaction and the next ordered transaction. This visibility indication allows the bus agent to proceed with the next ordered transaction without waiting for the completion status of the deferred transaction. The visibility indication provides fast processing of ordered transactions.

8094500, Jan 10, 2012

Jan 5, 2009

12/348891

Alexander Paley - Kfar-Saba, IL
Sergey Anatolievich Gorobets - Edinburgh, GB
Eugene Zilberman - Richmond Hill, CA
Alan David Bennett - Edinburgh, GB
Shai Traister - San Jose CA, US
Andrew Tomlin - San Jose CA, US
William S. Wu - Cupertino CA, US
Bum Suck So - San Jose CA, US

Sandisk Technologies Inc. - Plano TX

G11C 16/04

36518512, 36518511, 36518518

A portion of a nonvolatile memory is partitioned from a main multi-level memory array to operate as a cache. The cache memory is configured to store at less capacity per memory cell and finer granularity of write units compared to the main memory. In a block-oriented memory architecture, the cache has multiple functions, not merely to improve access speed, but is an integral part of a sequential update block system. Decisions to write data to the cache memory or directly to the main memory depend on the attributes and characteristics of the data to be written, the state of the blocks in the main memory portion and the state of the blocks in the cache portion.

8175938, May 8, 2012

Jun 21, 2004

10/873704

Hugo Olliphant - San Francisco CA, US
Franck Chastagnol - Redwood City CA, US
Yi-Ling Su - Los Altos CA, US
William Wu - San Francisco CA, US
Chris Brown - Berkeley CA, US
Thach Dang - Burlingame CA, US
Thomas Veino - San Jose CA, US
Carol Gunby - San Jose CA, US
Peter Chu - Mountain View CA, US
Steve Chen - San Jose CA, US

eBay Inc. - San Jose CA

G06Q 40/00

705 35, 705 39

A method and system for facilitating merchant-initiated online payments are disclosed. According to one aspect of the present invention, a payment service provider's server receives a user's request, via a merchant's server, to establish a merchant-initiated payment relationship or agreement. Accordingly, the payment service provider presents the user with options to customize the terms of the merchant-initiated payment agreement. After the agreement has been established and the terms customized, the merchant server communicates a merchant-initiated payment request to the pavement service provider for a transaction entered into with the user. The payment service provider's server processes the payment request after verifying that processing the payment does not exceed the user-customized terms of the agreement.

8244960, Aug 14, 2012

Jan 5, 2009

12/348899

Alexander Paley - Kfar-Saba, IL
Sergey Anatolievich Gorobets - Edinburgh, GB
Eugene Zilberman - Richmond Hill, CA
Alan David Bennett - Edinburgh, GB
Shai Traister - San Jose CA, US
Andrew Tomlin - San Jose CA, US
William S. Wu - Cupertino CA, US
Bum Suck So - San Jose CA, US

SanDisk Technologies Inc. - Plano TX

G06F 12/00

711103, 711156, 711E12008

A portion of a nonvolatile memory is partitioned from a main multi-level memory array to operate as a cache. The cache memory is configured to store at less capacity per memory cell and finer granularity of write units compared to the main memory. In a block-oriented memory architecture, the cache has multiple functions, not merely to improve access speed, but is an integral part of a sequential update block system. The cache memory has a capacity dynamically increased by allocation of blocks from the main memory in response to a demand to increase the capacity. Preferably, a block with an endurance count higher than average is allocated. The logical addresses of data are partitioned into zones to limit the size of the indices for the cache.

8626986, Jan 7, 2014

Jun 30, 2010

12/828241

William Wu - Cupertino CA, US
Shai Traister - Sunnyvale CA, US
Jianmin Huang - Sunnyvale CA, US
Neil David Hutchison - Campbell CA, US
Steven Sprouse - San Jose CA, US

SanDisk Technologies Inc. - Plano TX

G06F 13/00

711103, 711165, 711170

A method and system pre-emptively perform garbage collection operations of a forced amount on update blocks in a memory device. The amount of garbage collection needed by a certain data write is monitored and adjusted to match the forced amount if necessary. Update blocks may be selected on the basis of their recent usage or the amount of garbage collection required. Another method and system may store control information about update blocks in a temporary storage area so that a greater number of update blocks are utilized. The sequential write performance measured by the Speed Class test may be optimized by using this method and system.

20020059255, May 16, 2002

Oct 12, 2001

09/976449

William Wu - Fremont CA, US

G06F007/00

707/010000

An information deposit and retrieval system based on a resource-property data modeling. An exemplary usage of this system is to describe the properties of documents, pictures, web pages, etc. including their locations in the information deposit and retrieval system. Each document is modeled as a resource. Each resource can be associated with unlimited number of properties. A user can create a resource in the information deposit and retrieval system when he creates a document or comes across a web page by describing the properties of the resource. Later, when the user wants to locate the document, the user issues a query with specifying properties and values to the system. A typical query is to get the “location” property and other property of a resource by giving the values of name, author, and keyword properties. After the matching process, the system returns the matching resources and their location properties.

20020078041, Jun 20, 2002

Oct 12, 2001

09/976439

William Wu - Fremont CA, US

G06F007/00

707/004000

A system and method for translating a universal query language UQL into a relational query language such as SQL. The method first determines whether there are any UQL rule properties. If so, the rule is substituted for the rule property. Next, for each resource and resource property, a relational table is assigned and given an ID. Assigned tables are placed into a table list. Following this step, for each resource property, implied conditions are generated and placed into a condition list and, if needed, additional tables are generated and assigned ids. Then, for each UQL primitive property, a table and column is identified according to a table.column format and placed into a column list. Finally, any predicates are resolved into explicit conditions and the conditions are placed into the condition list. From the column list, the table list and the condition list an SQL statement is formed for querying the relational database.