Yuan Yu Phones & Addresses
-
Greenbelt, MD
-
Redwood City, CA
Business Records
Name / Title
Company / Classification
Phones & Addresses
President
ANTAEUS RESOURCES INC
Whol Service Establishment Equipment
Whol Service Establishment Equipment
38000 Camden St #26, Fremont, CA 94536
(510) 739-3566
(510) 739-3566
Publications
Isbn (Books And Publications)
Software Configuration Management Using Vesta
View page
Author
Yuan Yu
ISBN #
0387002294
Us Patents
Adaptive Granularity Refinement In Detecting Potential Data Races
View pageUS Patent:
7231498, Jun 12, 2007
Filed:
Mar 2, 2005
Appl. No.:
11/070766
Inventors:
Thomas L. Rodeheffer - Mountain View CA, US
Yuan Yu - Cupertino CA, US
Yuan Yu - Cupertino CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 12/02
US Classification:
711150
Abstract:
A method and apparatus are provided for detecting data races that overcome the limitations of the prior art. In some embodiments, this is accomplished by detecting a first access to an object, determining whether the first access is associated with a suspicious pattern, automatically refining a pattern detection granularity from the object to a memory location within the object if a determination is made that the first access is associated with the suspicious pattern, and reporting the data race if a second access associated with the suspicious pattern occurs at the memory location after the pattern detection granularity is refined.
Quantified Boolean Formula (Qbf) Solver
View pageUS Patent:
7249333, Jul 24, 2007
Filed:
Jan 18, 2005
Appl. No.:
11/038958
Inventors:
Yuan Yu - Cupertino CA, US
Lintao Zhang - Sunnyvale CA, US
Lintao Zhang - Sunnyvale CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/50
G06F 17/10
G06F 17/10
US Classification:
716 5, 703 2
Abstract:
Quantified Boolean formula (QBF) techniques are used in determining QBF satisfiability. A QBF is broken into component parts that are analyzable by a satisfiability (SAT) solver. Each component is then independently, and perhaps in parallel, analyzed for satisfiability. If a component is unsatisfiable, then it is determined that the QBF is unsatisfiable, and the analysis is stopped. If a component is satisfiable, then an assignment corresponding to the satisfiable component is noted. If a component is satisfiable, then it is appended to another untested component to provide a combination component, and the satisfiability of the combination component is analyzed. Such appending and analysis is repeated until the QBF is completed and determined to be satisfiable or determined to be unsatisfiable.
Method And System For Detecting Potential Races In Multithreaded Programs
View pageUS Patent:
7549150, Jun 16, 2009
Filed:
Mar 24, 2004
Appl. No.:
10/808110
Inventors:
Yuan Yu - Cupertino CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/46
US Classification:
718108
Abstract:
A dynamic race detection system and method overcomes drawbacks of previous lockset approaches, which may produce many false positives, particularly in the context of thread fork/join and asynchronous calls. For each shared memory location, a set of locks that are protecting the location and a set of concurrent thread segments that are accessing the location are maintained. To maintain these sets, each thread maintains a set of locks it is currently holding and a set of thread segments ordered before its current thread segment. Each thread also maintains a virtual clock that is incremented when it forks a second thread. A thread segment is a pair comprising a thread identifier and a virtual clock value. A data race is reported when the lockset for a particular shared memory location is empty and the cardinality of the set of concurrent threads for that memory location is greater than one.
Systems And Methods Of Reporting Multiple Threads Involved In A Potential Data Race
View pageUS Patent:
7620852, Nov 17, 2009
Filed:
Mar 2, 2005
Appl. No.:
11/070693
Inventors:
Thomas L. Rodeheffer - Mountain View CA, US
Yuan Yu - Cupertino CA, US
Yuan Yu - Cupertino CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 11/00
US Classification:
714 42
Abstract:
Criteria are defined for determining when additional stack dumps would be saved and presented (e. g. , to the developer). This provides more information for the developer to use for debugging, and yet does not overburden the developer with irrelevant information. Suspicious activity worthy of an additional stack dumps may be defined as a thread accessing an already suspicious location that is different than the original thread, a write access being made and no write access having yet been made to the target location, or if the lockset being held by the thread accessing the location is omitted from the intersection of all locksets involved in stack dumps for the location.
Adaptive Granularity Refinement In Detecting Potential Data Races
View pageUS Patent:
7689780, Mar 30, 2010
Filed:
Apr 5, 2007
Appl. No.:
11/696809
Inventors:
Thomas L. Rodeheffer - Mountain View CA, US
Yuan Yu - Cupertino CA, US
Yuan Yu - Cupertino CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 13/00
US Classification:
711150, 711154
Abstract:
A method and apparatus are provided for detecting data races that overcome the limitations of the prior art. In some embodiments, this is accomplished by detecting a first access to an object, determining whether the first access is associated with a suspicious pattern, automatically refining a pattern detection granularity from the object to a memory location within the object if a determination is made that the first access is associated with the suspicious pattern, and reporting the data race if a second access associated with the suspicious pattern occurs at the memory location after the pattern detection granularity is refined.
Description Language For Structured Graphs
View pageUS Patent:
8201142, Jun 12, 2012
Filed:
Sep 29, 2006
Appl. No.:
11/537529
Inventors:
Michael A. Isard - San Francisco CA, US
Andrew D. Birrell - Los Altos CA, US
Yuan Yu - Cupertino CA, US
Andrew D. Birrell - Los Altos CA, US
Yuan Yu - Cupertino CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
US Classification:
717106, 717107, 717108, 717109
Abstract:
A general purpose high-performance distributed execution engine can be used by developers to deploy large-scale distributed applications. To allow developers to easily make use of the distributed execution engine, a graph building language is proposed that enables developers to efficiently create graphs (e. g. , direct acyclic graphs) that describe the subprograms to be executed and the flow of data between them. A job manager (or other appropriate entity) reads the description of the graph created with the graph building language, builds the graph based on that description, and intelligently distributes the subprograms according to the graph so that system resources are used efficiently. In one embodiment, the graph building language (and, thus, the description of the graph) includes syntax for replication, pointwise connect, cross connect and merge.
General Distributed Reduction For Data Parallel Computing
View pageUS Patent:
8239847, Aug 7, 2012
Filed:
Mar 18, 2009
Appl. No.:
12/406842
Inventors:
Yuan Yu - Cupertino CA, US
Pradeep Kumar Gunda - Mountain View CA, US
Michael A Isard - San Francisco CA, US
Pradeep Kumar Gunda - Mountain View CA, US
Michael A Isard - San Francisco CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/45
US Classification:
717149, 717146, 717155, 712 22, 712200, 712203, 712236, 712244, 718102, 718106
Abstract:
General-purpose distributed data-parallel computing using high-level computing languages is described. Data parallel portions of a sequential program written in a high-level language are automatically translated into a distributed execution plan. Map and reduction computations are automatically added to the plan. Patterns in the sequential program can be automatically identified to trigger map and reduction processing. Direct invocation of map and reduction processing is also provided. One or more portions of the reduce computation are pushed to the map stage and dynamic aggregation is inserted when possible. The system automatically identifies opportunities for partial reductions and aggregation, but also provides a set of extensions in a high-level computing language for the generation and optimization of the distributed execution plan. The extensions include annotations to declare functions suitable for these optimizations.
Management Of Data And Computation In Data Centers
View pageUS Patent:
8392403, Mar 5, 2013
Filed:
Sep 18, 2009
Appl. No.:
12/562156
Inventors:
Yuan Yu - Cupertino CA, US
Pradeep Kumar Gunda - Mountian View CA, US
Li Zhuang - Los Altos CA, US
Pradeep Kumar Gunda - Mountian View CA, US
Li Zhuang - Los Altos CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
G06F 17/30
G06F 17/30
US Classification:
707718, 707719, 707759
Abstract:
Data and computation may be unified (i. e. , integrated) in a data center using a single query interface. Users may interact with the data center via a query interface to provide a query (i. e. , a computation) to the data center. The results of the query may be referred to as derived datasets and may be managed by a cache server. In an implementation, a derived dataset is uniquely referenced by the query that computes it. Shared common computations are computed only once and may be reused by other computations. The result of a query may be computed (if not previously cached) and returned to the user. Infrequently used derived datasets may be garbage collected (e. g. , deleted or otherwise removed from storage) by a garbage collector. This integration of data and computation provides efficient resource management for data center.