Search

Yuri V Bagashev

from San Jose, CA
Age ~53
Get Report
Also known as:
Iouri V Bagachev, Yuri Cartwright, Yuri Finklea
Phone and address:
1187 Cherryview Ln, San Jose, CA 95118
Related to:
Timothy Y Bagachev, 26
Connected to:
Moussa Bagate, 68Carrie J Bagatell, 70Zoe I Bagatsing, 32Jessica L Bagayas, 57Aissata Bagayoko, 44Lamine Bagayoko, 47Allen G Bagby, 61Barbara A Bagby, 72Danny W Bagby, 67Edward A Bagby, 52

Yuri Bagashev Phones & Addresses

  • 1187 Cherryview Ln, San Jose, CA 95118
  • 10190 Imperial Ave, Cupertino, CA 95014
  • Sunnyvale, CA
  • Partridge, KY
  • Fort Lauderdale, FL
  • Harlingen, TX
  • Fremont, CA
  • Santa Clara, CA
  • 10190 Imperial Ave, Cupertino, CA 95014 (408) 203-5389

Work

Company: Western digital Nov 2012 to Sep 2015 Position: Software technologist

Skills

Performance Tuning • Storage • Architectures • Performance

Emails

y***[email protected]

Industries

Computer Software

Resumes

Resumes

Yuri Bagashev Photo 1

Owner

View page
Location:
San Francisco, CA
Industry:
Computer Software
Work:
Western Digital Nov 2012 - Sep 2015
Software Technologist
Oracle 2011 - 2012
Consultant
Diamond Software Consulting 2011 - 2012
Owner
Flashsoft May 2010 - Feb 2011
Software Architect
Pillar Data Systems Jun 2002 - Apr 2010
Senior Firmware Engineer
Skills:
Performance Tuning
Storage
Architectures
Performance

Business Records

Name / Title
Company / Classification
Phones & Addresses
Yuri Bagashev
Managing
Diamond Software Consulting LLC
to Provide Software/Firmware Development
10190 Imperial Ave, Cupertino, CA 95014

Publications

Us Patents

Management Of I/O Operations In Data Storage Systems

View page
US Patent:
7222223, May 22, 2007
Filed:
Oct 29, 2004
Appl. No.:
10/976430
Inventors:
Wayne Eugene Miller - Livermore CA, US
Yuri Vladimirovich Bagashev - Cupertino CA, US
David Alan Burton - Vail AZ, US
Noel Simen Otterness - Lafayette CO, US
Paul Michael Remley - Livermore CA, US
Assignee:
Pillar Data Systems, Inc. - San Jose CA
International Classification:
G06F 13/00
US Classification:
711158, 711 4, 711111, 711112, 711114, 711151, 710 40, 710244
Abstract:
The invention relates to management of I/O in data storage systems. In an embodiment, the invention provides a data storage subsystem processing I/O requests each having a priority, comprising a processor, a memory coupled to the processor, a disk array, an array controller coupled to the processor and the disk array, a network interface, coupled to the processor, to receive an I/O request with a priority, and a program in the memory for managing the I/O request based on the priority, a clip level of the priority, the total workload in the data storage subsystem, and processing I/O requests based on priority, workload clip levels, and fairness levels. The invention also contemplates the use of static and dynamic adjusted clip levels. The invention also relates to a method of managing I/O requests, comprising receiving an I/O request, determining the priority of the I/O request, comparing the total workload to the clip level for the priority, and processing the I/O request if the total workload is below the clip level or the priority workload is below a fairness level.

Methods And Systems Of Managing I/O Operations In Data Storage Systems

View page
US Patent:
7287134, Oct 23, 2007
Filed:
May 15, 2007
Appl. No.:
11/803916
Inventors:
Wayne Eugene Miller - Livermore CA, US
Yuri Vladimirovich Bagashev - Cupertino CA, US
David Alan Burton - Vail AZ, US
Noel Simen Otterness - Lafayette CO, US
Paul Michael Remley - Livermore CA, US
Assignee:
Pillar Data Systems, Inc. - San Jose CA
International Classification:
G06F 13/00
US Classification:
711158, 711 4, 711111, 711112, 711114, 711151, 710 40, 710244
Abstract:
The invention relates to management of I/O in data storage systems. In an embodiment, the invention provides a data storage subsystem processing I/O requests each having a priority, comprising a processor, a memory coupled to the processor, a disk array, an array controller coupled to the processor and the disk array, a network interface, coupled to the processor, to receive an I/O request with a priority, and a program in the memory for managing the I/O request based on the priority, a clip level of the priority, the total workload in the data storage subsystem, and processing I/O requests based on priority, workload clip levels, and fairness levels. The invention also contemplates the use of static and dynamic adjusted clip levels. The invention also relates to a method of managing I/O requests, comprising receiving an I/O request, determining the priority of the I/O request, comparing the total workload to the clip level for the priority, and processing the I/O request if the total workload is below the clip level or the priority workload is below a fairness level.

Method And Apparatus For Detection And Management Of Data Streams

View page
US Patent:
6986019, Jan 10, 2006
Filed:
Apr 21, 2003
Appl. No.:
10/419402
Inventors:
Yuri Bagashev - Sunnyvale CA, US
Jean-Pierre Ruster - Mountain View CA, US
Maurice Schlumberger - Menlo Park CA, US
Assignee:
Maxtor Corporation - Longmont CO
International Classification:
G06F 12/06
US Classification:
711217
Abstract:
A system for the detection and support of data streams is disclosed. The system determines whether new commands comprise a data stream. If a new data stream is detected, the system next determines whether adequate resources are available to launch the new data stream. If the system determines that the data stream can be launched, system resources, particularly cache memory space, are assigned to the data stream to provide the data stream with the necessary amount of data throughput needed to support the data stream efficiently. The data stream's throughput is the amount of data that the stream requires per unit time. The system monitors all supported data streams to determine when a particular data stream has terminated, at which time resources dedicated to the data stream are released and become available to support other data streams. The cache for each supported data stream is maintained at as full a level as possible, with the cache for the “least full” data stream given priority for refresh. Allocating resources by throughput allows for more efficient resource utilization.
Control profile
Yuri V Bagashev from San Jose, CA, age ~53 Get Report