Search

David Y Vengerov

from San Jose, CA
Age ~48
Get Report
Also known as:
David A Vengerov, David Veng Erov, Vengerov David
Phone and address:
529 Winterberry Way, San Jose, CA 95129
Related to:
David M Shugart, 63Raymond Avilez, 69Nicola D Santino, 41Dela VegaChristopher Taylor, 46Derrick Taylor, 42
Connected to:
Galina Vengerov, 59Simon S Vengersammy, 51Baskaran R Vengesanam, 56Matthew J Vengilio, 41Steven M Venglarcik, 72Carol C Vengoechea, 80Daniel Vengoechea, 32Esperanza Vengoechea, 68Luis F Vengoechea, 41Vitolis E Vengris, 81

David Vengerov Phones & Addresses

  • 529 Winterberry Way, San Jose, CA 95129
  • Winterberry Way, San Jose, CA 95101
  • Sunnyvale, CA
  • Blackfield Ct, Santa Clara, CA 95051
  • Roseville, CA
  • 125 Near Ct, Walnut Creek, CA 94596
  • Mountain View, CA
  • Brooklyn, NY
  • Palo Alto, CA
  • Tarrytown, NY
  • Cupertino, CA

Work

Company: Oracle Jan 2010 to Aug 2018 Position: Architect

Education

Degree: Doctorates, Doctor of Philosophy School / High School: Stanford University 1998 to 2004

Skills

Algorithms • Machine Learning • Optimization • Oracle • Solaris • Cloud Computing • Scalability • Software Development • Data Center • Optimizations • Reinforcement Learning • Software Engineering • Unix • Distributed Systems

Languages

English • Russian

Industries

Computer Software

Resumes

Resumes

David Vengerov Photo 1

Senior Machine Learning Engineer

View page
Location:
San Francisco, CA
Industry:
Computer Software
Work:
Oracle Jan 2010 - Aug 2018
Architect
Box Jan 2010 - Aug 2018
Senior Staff Ml Engineer
Sun Microsystems 2003 - Jan 2010
Staff Engineer
Intelligent Inference Systems 1998 - 2003
Research Scientist
1998 - 2003
Senior Machine Learning Engineer
Education:
Stanford University 1998 - 2004
Doctorates, Doctor of Philosophy Massachusetts Institute of Technology 1993 - 1998
Master of Science, Masters, Bachelors, Bachelor of Science, Mathematics, Electrical Engineering Brooklyn Technical High School
Leland Stanford Junior University
Master of Science, Doctorates, Masters, Doctor of Philosophy, Engineering, Management Science
Skills:
Algorithms
Machine Learning
Optimization
Oracle
Solaris
Cloud Computing
Scalability
Software Development
Data Center
Optimizations
Reinforcement Learning
Software Engineering
Unix
Distributed Systems
Languages:
English
Russian

Publications

Us Patents

Selecting Basis Functions To Form A Regression Model For Cache Performance

View page
US Patent:
7346736, Mar 18, 2008
Filed:
Oct 3, 2005
Appl. No.:
11/243353
Inventors:
Ilya Gluhovsky - Mountain View CA, US
David Vengerov - Sunnyvale CA, US
John R. Busch - Cupertino CA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 12/00
US Classification:
711118, 711133, 711134, 714701, 714702, 714704, 714718, 702108, 702119, 702120
Abstract:
One embodiment of the present invention provides a system that selects bases to form a regression model for cache performance. During operation, the system receives empirical data for a cache rate. The system also receives derivative constraints for the cache rate. Next, the system obtains candidate bases that satisfy the derivative constraints. For each of these candidate bases, the system: (1) computes an aggregate error E incurred using the candidate basis over the empirical data; (2) computes an instability measure I of an extrapolation fit for using the candidate basis over an extrapolation region; and then (3) computes a selection criterion F for the candidate basis, wherein F is a function of E and I. Finally, the system minimizes the selection criterion F across the candidate bases to select the basis used for the regression model.

Method For Scheduling Jobs Using Distributed Utility-Based Preemption Policies

View page
US Patent:
7444316, Oct 28, 2008
Filed:
Jan 28, 2005
Appl. No.:
11/045561
Inventors:
David Vengerov - Sunnyvale CA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06N 7/02
US Classification:
706 52, 718104, 718105
Abstract:
One embodiment of the present invention provides a system that assigns jobs to a system containing a number of central processing units (CPUs). During operation, the system captures a current state of the system, which describes available resources on the system, characteristics of jobs currently being processed, and characteristics of jobs waiting to be assigned. The system then uses the current system state to estimate a long-term benefit to the system of not preempting any jobs currently being processed. If the benefit from preempting one or more jobs exceeds the benefit from not preempting any jobs, the system preempts one or more jobs currently being processed on the system with a new job.

Dynamic Data Migration In A Multi-Tier Storage System

View page
US Patent:
7539709, May 26, 2009
Filed:
Jun 15, 2005
Appl. No.:
11/153058
Inventors:
David Vengerov - Sunnyvale CA, US
Harriet G. Coverston - New Brighton MN, US
Anton B. Rang - Houlton WI, US
Andrew B. Hastings - Eagan MN, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 17/30
US Classification:
707204, 707203, 707205
Abstract:
A method and apparatus for managing data is described which includes determining the current state of a storage tier of a plurality of storage tiers within a storage system. Further, a prediction is made, using a prediction architecture comprising at least one predetermined variable, of the utilities of future expected states for at least two of a plurality of storage tiers involved with a data operation, wherein a future expected state of a corresponding storage tier is based on conditions expected to occur following the completion of the data operation. Finally, the data operation is performed if the predicted utility of the future expected state associated with the at least two of a plurality of storage tiers is more beneficial than the utility of the current state.

Dynamic Routing Of I/O Requests In A Multi-Tier Storage Environment

View page
US Patent:
7606934, Oct 20, 2009
Filed:
Mar 10, 2005
Appl. No.:
11/077472
Inventors:
David Vengerov - Sunnyvale CA, US
Harriet G. Coverston - New Brighton MN, US
Anton B. Rang - Houlton WI, US
Andrew B. Hastings - Eagan MN, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 15/173
G06E 1/00
US Classification:
709238, 706 21
Abstract:
A method for routing an incoming service request is described wherein the service request is routed to a selected storage tier based on that selected storage tier having a predicted value indicating a state having greater utility as compared with the predicted value of the state associated with at least one other storage tier within the storage system. A computer system comprising a multi-tier storage system is described, the multi-tier storage system having a routing algorithm configured to adaptively tune functions which map variables describing the state of each storage tier of the storage system into the average latency experienced by incoming service requests associated with the storage tier.

Facilitating Distributed Thread Migration Within An Array Of Computing Nodes

View page
US Patent:
7665089, Feb 16, 2010
Filed:
Nov 2, 2004
Appl. No.:
10/980422
Inventors:
David Vengerov - Sunnyvale CA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 9/46
US Classification:
718102, 711151
Abstract:
One embodiment of the present invention provides a system that performs thread migration within an array of computing nodes, wherein computing nodes in the array contain central processing units (CPUs) and/or memories. During operation, the system identifies CPUs within the array of computing nodes that are available to accept a given thread. For each available CPU, the system computes an average communication distance between the CPU and memories which are accessed by the given thread. Next, the system determines whether to move the given thread to an available CPU based on the average communication distance for the available CPU.

Method And Apparatus For Distributed State-Based Load Balancing Between Task Queues

View page
US Patent:
7665092, Feb 16, 2010
Filed:
Dec 15, 2004
Appl. No.:
11/013498
Inventors:
David Vengerov - Sunnyvale CA, US
Assignee:
Sun Microsystems, Inc. - Santa Clara CA
International Classification:
G06F 9/46
US Classification:
718105
Abstract:
One embodiment of the present invention provides a system that performs load balancing between task queues in a multiprocessor system. During operation, the system conditionally requests load information from a number of neighboring CPUs in a neighborhood of a requesting CPU. In response to the request, the system receives load information from one or more neighboring CPUs. Next, the system conditionally requests one or more neighboring CPUs to transfer tasks to the requesting CPU based on the received load information, thereby balancing load between the CPUs in the neighborhood.

Method And System For Scheduling A Thread In A Multiprocessor System

View page
US Patent:
8032888, Oct 4, 2011
Filed:
Oct 17, 2006
Appl. No.:
11/581917
Inventors:
David Vengerov - Sunnyvale CA, US
Savvas Gitzenis - Athens, GR
Declan J. Murphy - San Francisco CA, US
Assignee:
Oracle America, Inc. - Redwood City CA
International Classification:
G06F 9/46
US Classification:
718102, 718100
Abstract:
A method for scheduling a thread on a plurality of processors that includes obtaining a first state of a first processor in the plurality of processors and a second state of a second processor in the plurality of processors, wherein the thread is last executed on the first processor, and wherein the first state of the first processor includes the state of a cache of the first processor, obtaining a first estimated instruction rate to execute the thread on the first processor using an estimated instruction rate function and the first state, obtaining a first estimated global throughput for executing the thread on the first processor using the first estimated instruction rate and the second state, obtaining a second estimated global throughput for executing the thread on the second processor using the second state, comparing the first estimated global throughput with the second estimated global throughput to obtain a comparison result, and executing the thread, based on the comparison result, on one selected from a group consisting of the first processor and the second processor, wherein the thread performs an operation on one of the plurality of processors.

Adaptive Triggering Of Garbage Collection

View page
US Patent:
8166269, Apr 24, 2012
Filed:
Nov 5, 2009
Appl. No.:
12/612777
Inventors:
David Vengerov - Santa Clara CA, US
Assignee:
Oracle America, Inc. - Redwood Shores CA
International Classification:
G06F 12/02
US Classification:
711170, 711173
Abstract:
Methods and apparatus are provided for adaptively triggering garbage collection. During relatively steady or decreasing rates of allocation of free memory, a threshold for triggering garbage collection is dynamically and adaptively determined on the basis of memory drops (i. e. , decreases in free memory) during garbage collection. If a significant increase in the rate of allocation of memory is observed (e. g. , two consecutive measurements that exceed a mean rate plus two standard deviations), the threshold is modified based on a memory drop previously observed in conjunction with the current memory allocation rate, or a memory drop estimated to be possible for the current allocation rate.
Control profile
David Y Vengerov from San Jose, CA, age ~48 Get Report