Clusterhq 2015 - Dec 2016
Software Engineer
Teleion Consulting 2015 - Dec 2016
Software Architect
Pi-Coral, Inc. Sep 2013 - Oct 2015
Storage Software Architect
Violin Memory Sep 2011 - Sep 2013
Senior Software Engineer
Netapp Mar 2006 - Sep 2011
Nfs Software Engineer
Education:
University of California, Berkeley 1994 - 1999
Bachelors, Bachelor of Science, Computer Science
Skills:
C C++ Storage Distributed Systems Object Oriented Design Perl Nfs Shell Scripting Openstack File Systems Git Cloud Computing Go Perl Automation Algorithms Software Quality Assurance Encryption Data Ontap Perforce Linux Software Development Server Side Programming
Peter Corbett - Lexington MA, US Saadia Shaheen Khan - Milpitas CA, US Vadim Finkelstein - Hayward CA, US Mukesh Kacker - Sunnyvale CA, US
Assignee:
Network Appliance, Inc. - Sunnyvale CA
International Classification:
G06F 17/30
US Classification:
707781, 707786, 707787
Abstract:
A storage server maintains a number of datasets (e. g. , exported file systems or other resources). For each dataset, certain clients are allowed to have access (e. g. , read access, write access, root access, etc. ) and certain other clients are not allowed to have access. Access permission information is maintained to specify which clients are allowed to have access and what kind of access. A method and system are introduced to use a radix tree to store access permission information in a cache, therefore allowing the storage server to quickly retrieve access information relevant to a particular client. One advantage of using radix tree to maintain access permission information is that radix tree is very efficient at storing hierarchical information, such as IP addresses. Radix tree is also very efficient at representing subnets in particular.
Enhanced Migration Of Clusters Based On Data Accessibility
- Houston TX, US Xiongbing Ou - San Jose CA, US Vadim Finkelstein - San Francisco CA, US Kartik Mathur - Foster City CA, US
International Classification:
G06F 9/455 G06F 9/48
Abstract:
Described herein are systems, methods, and software to migrate virtual nodes of a data processing cluster. In one implementation, a management system monitors an executing data processing cluster on one or more first hosts to determine when the data processing cluster satisfies migration criteria. Once satisfied, the management system selects one or more second hosts to support the data processing cluster based on accommodation data associated with the hosts. After selection, the management system may initiate operations to migrate the data processing cluster from the one or more first hosts to the one or more second hosts.
Enhanced Data Storage Of Virtual Nodes In A Data Processing Environment
- Houston TX, US Xiongbing Ou - San Jose CA, US Vadim Finkelstein - San Francisco CA, US Kartik Mathur - Foster City CA, US
International Classification:
G06F 9/455 G06F 8/65 G06F 13/20
Abstract:
Described herein are systems, methods, and software to enhance the management of virtual nodes in a computing environment. In one example, a method includes identifying a transition event for a first version of a virtual node executing on a first host, identifying a second host to support a second version of the virtual node, and initiating execution of the second version of the virtual node on the second host. In some implementations, the virtual node comprises a non-persistent portion on the executing host and a persistent portion on a second storage element.
Enhanced Data Storage And Versioning Of Virtual Nodes In A Data Processing Environment
- Houston TX, US Xiongbing Ou - San Jose CA, US Vadim Finkelstein - San Francisco CA, US Kartik Mathur - Foster City CA, US
International Classification:
G06F 9/455 G06F 13/20 G06F 8/65
Abstract:
Described herein are systems, methods, and software to enhance the management of virtual nodes in a computing environment. In one example, a method includes identifying a transition event for a first version of a virtual node executing on a first host, identifying a second host to support a second version of the virtual node, and initiating execution of the second version of the virtual node on the second host. In some implementations, the virtual node comprises a non-persistent portion on the executing host and a persistent portion on a second storage element.
Flickr
Youtube
Did Vadim Finkelstein Steal from Fedor? - Mon...
Vadim Finkelstein Fedor Did Vadim Finkelstein Steal from Fedor? That i...
Duration:
1m 45s
Vadim Finkelstein: "I am sure that this arena...
On November 12, the press center of TASS in St. Petersburg held a pres...
Duration:
7m 13s
President of M-1 Global Vadim Finkelstein abo...
On November 12, the press center of TASS in St. Petersburg held a pres...
Duration:
7m 11s
Oleg Taktarov on Vadim Finkelstein "You Didn'...
The "Russian Bear" Oleg Taktarov stated he is seven or eight year olde...
Dana White has said the closest the UFC ever came to signing Emelianenko occurred in 2009, when it was looking to set up a fight between Emelianenko and WWE star-turned UFC champion Brock Lesnar. Emelianenko and his partner, Vadim Finkelstein, declined the deal and went on to sign with Strikeforce.
Following the bout, M-1 co-founder Vadim Finkelstein suggested that Emelianenko's next fight could come against Japanese fighter Satoshi Ishii, a 2008 Olympic champion in judo. Ishii has a 4-1-1 professional record, but he has never beaten a highly ranked MMA fighter; his last bout was a draw with t
"We consulted with Fedor and it was decided that he should not leave the sport in this way," said Vadim Finkelstein, M-1 Global president. "His friends and past opponents support Fedor in continuing his career and he agreed."
Date: Aug 08, 2011
Category: Sports
Source: Google
Strikeforce: Fedor vs. Henderson - On Fedor Emelianenko and Retirement
But M-1 Global and Vadim Finkelstein were quick to dispel that notion. After a few weeks back home in Mother Russia, Emelianenko's tune started to change as well. He admitted to "speaking too soon" and allowing the emotion of the moment to play a part in his thoughts that night.