Patents by Inventor Razvan Cheveresan
Razvan Cheveresan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10241709Abstract: An elastic filesystem for temporary data provides storage space for virtual machines (VMs) in a distributed computing system. The filesystem redirects accesses to virtual disks in VMs to a common pool file. The system provides performance and storage efficiency at least on par with local, direct attached virtual disks, while providing a single pool of shared storage that is provisioned and managed independently of the VMs. The system provides storage isolation between VMs storing temporary data in that shared pool. Also, storage space for temporary data may be allocated on demand and reclaimed when no longer needed, thereby supporting a wide variety of temporary space requirements for different Hadoop jobs.Type: GrantFiled: October 17, 2014Date of Patent: March 26, 2019Assignee: VMware, Inc.Inventors: Daniel J. Scales, Tariq Magdon-Ismail, Razvan Cheveresan, Michael Nelson, Richard McDougall
-
Patent number: 10216758Abstract: A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Production, test, and development deployments of a Hadoop application may be executed using multiple compute clusters and a shared instance of a distributed filesystem, or in other cases, multiple instances of the distributed filesystem. Data nodes executing as virtual machines (VMs) for test and development deployments can be linked clones of data nodes executing as VMs for a production deployment to reduce duplicated data and provide a shared storage space.Type: GrantFiled: October 24, 2013Date of Patent: February 26, 2019Assignee: VMWARE, INC.Inventors: Jayanth Gummaraju, Yunshan Lu, Razvan Cheveresan
-
Patent number: 10193963Abstract: A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Data and compute nodes are separated into different virtual machines (VM). Compute VMs are used to launch containers from different tenants. Compute VMs are organized in pools of hot spare VMs that are immediately available for launching a container and executing a task, and pools of cold spare VMs. Each compute VM may include a mounted network filesystem provided by a node manager to share intermediate outputs across VMs executing on the same host.Type: GrantFiled: October 24, 2013Date of Patent: January 29, 2019Assignee: VMware, Inc.Inventors: Jayanth Gummaraju, Richard McDougall, Michael Nelson, Rean Griffith, Tariq Magdon-Ismail, Razvan Cheveresan, Junping Du
-
Patent number: 9621654Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores using performance monitoring are described. In one embodiment, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. During the copying of the data between a source datastore and the one or more destination datastores, a performance value of each of the datastores involved in the copying process is compared to a threshold. In response to determining that the performance value of a given source or destination datastore involved in the copying exceeds the threshold, the copying of the data to the corresponding destination datastore is suspended. An updated shortest path tree is determined to locate a more efficient path for copying data to the suspended destination datastore. Copying is resumed to the suspended destination datastore using the updated shortest path tree.Type: GrantFiled: December 21, 2015Date of Patent: April 11, 2017Assignee: VMware, Inc.Inventors: Tariq Magdon-Ismail, Razvan Cheveresan
-
Publication number: 20160191625Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores using performance monitoring are described. In one embodiment, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. During the copying of the data between a source datastore and the one or more destination datastores, a performance value of each of the datastores involved in the copying process is compared to a threshold. In response to determining that the performance value of a given source or destination datastore involved in the copying exceeds the threshold, the copying of the data to the corresponding destination datastore is suspended. An updated shortest path tree is determined to locate a more efficient path for copying data to the suspended destination datastore. Copying is resumed to the suspended destination datastore using the updated shortest path tree.Type: ApplicationFiled: December 21, 2015Publication date: June 30, 2016Inventors: Tariq Magdon-Ismail, Razvan Cheveresan
-
Patent number: 9268836Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores are described. In one embodiment, a distance value of a path between each datastore is determined. Based on the distance values, a graph cluster analysis creates clusters of the datastores within close proximity to one another. Also, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. The source datastore is designated as the root of the shortest path tree, and the one or more destination datastores are designated as the vertices of the tree. After each child vertex of the source datastore is ordered in descending order according to a number of unique clusters to which descendants of the child vertex belong, the data is copied from the source datastore to the one or more destination datastores in the descending order.Type: GrantFiled: November 14, 2013Date of Patent: February 23, 2016Assignee: VMware, Inc.Inventors: Tariq Magdon-Ismail, Razvan Cheveresan
-
Patent number: 9230001Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores using performance monitoring are described. In one embodiment, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. During the copying of the data between a source datastore and the one or more destination datastores, a performance value of each of the datastores involved in the copying process is compared to a threshold. In response to determining that the performance value of a given source or destination datastore involved in the copying exceeds the threshold, the copying of the data to the corresponding destination datastore is suspended. An updated shortest path tree is determined to locate a more efficient path for copying data to the suspended destination datastore. Copying is resumed to the suspended destination datastore using the updated shortest path tree.Type: GrantFiled: November 14, 2013Date of Patent: January 5, 2016Assignee: VMware, Inc.Inventors: Tariq Magdon-Ismail, Razvan Cheveresan
-
Publication number: 20150160884Abstract: An elastic filesystem for temporary data provides storage space for virtual machines (VMs) in a distributed computing system. The filesystem redirects accesses to virtual disks in VMs to a common pool file. The system provides performance and storage efficiency at least on par with local, direct attached virtual disks, while providing a single pool of shared storage that is provisioned and managed independently of the VMs. The system provides storage isolation between VMs storing temporary data in that shared pool. Also, storage space for temporary data may be allocated on demand and reclaimed when no longer needed, thereby supporting a wide variety of temporary space requirements for different Hadoop jobs.Type: ApplicationFiled: October 17, 2014Publication date: June 11, 2015Inventors: Daniel J. SCALES, Tariq MAGDON-ISMAIL, Razvan CHEVERESAN, Michael NELSON, Richard MCDOUGALL
-
Publication number: 20150134606Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores are described. In one embodiment, a distance value of a path between each datastore is determined. Based on the distance values, a graph cluster analysis creates clusters of the datastores within close proximity to one another. Also, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. The source datastore is designated as the root of the shortest path tree, and the one or more destination datastores are designated as the vertices of the tree. After each child vertex of the source datastore is ordered in descending order according to a number of unique clusters to which descendants of the child vertex belong, the data is copied from the source datastore to the one or more destination datastores in the descending order.Type: ApplicationFiled: November 14, 2013Publication date: May 14, 2015Applicant: VMware, Inc.Inventors: Tariq MAGDON-ISMAIL, Razvan CHEVERESAN
-
Publication number: 20150134607Abstract: Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores using performance monitoring are described. In one embodiment, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. During the copying of the data between a source datastore and the one or more destination datastores, a performance value of each of the datastores involved in the copying process is compared to a threshold. In response to determining that the performance value of a given source or destination datastore involved in the copying exceeds the threshold, the copying of the data to the corresponding destination datastore is suspended. An updated shortest path tree is determined to locate a more efficient path for copying data to the suspended destination datastore. Copying is resumed to the suspended destination datastore using the updated shortest path tree.Type: ApplicationFiled: November 14, 2013Publication date: May 14, 2015Applicant: VMware, Inc.Inventors: Tariq MAGDON-ISMAIL, Razvan CHEVERESAN
-
Publication number: 20150120928Abstract: A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Data and compute nodes are separated into different virtual machines (VM). Compute VMs are used to launch containers from different tenants. Compute VMs are organized in pools of hot spare VMs that are immediately available for launching a container and executing a task, and pools of cold spare VMs. Each compute VM may include a mounted network filesystem provided by a node manager to share intermediate outputs across VMs executing on the same host.Type: ApplicationFiled: October 24, 2013Publication date: April 30, 2015Applicant: VMWARE, INC.Inventors: Jayanth GUMMARAJU, Richard MCDOUGALL, Michael NELSON, Rean GRIFFITH, Tariq MAGDON-ISMAIL, Razvan CHEVERESAN, Junping DU
-
Publication number: 20150120791Abstract: A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Production, test, and development deployments of a Hadoop application may be executed using multiple compute clusters and a shared instance of a distributed filesystem, or in other cases, multiple instances of the distributed filesystem. Data nodes executing as virtual machines (VMs) for test and development deployments can be linked clones of data nodes executing as VMs for a production deployment to reduce duplicated data and provide a shared storage space.Type: ApplicationFiled: October 24, 2013Publication date: April 30, 2015Applicant: VMWARE, INC.Inventors: Jayanth GUMMARAJU, Yunshan LU, Razvan CHEVERESAN
-
Patent number: 8229726Abstract: An object-oriented software analysis framework is provided for enabling software engineers and hardware engineers to gain insight into the behavior of software applications on emerging hardware platforms even before the hardware is fabricated. In this analysis framework, simulation data containing instruction, address and/or hardware register information is sent to interchangeable and parameterizable analyzer and profiler modules that decode the data and perform analysis of the data according to each module's respective analysis function. This detailed analysis is performed by constructing a tree of such modules through which the data travels and is classified and analyzed or filtered at each level of the tree.Type: GrantFiled: October 5, 2006Date of Patent: July 24, 2012Assignee: Oracle America, Inc.Inventors: Tariq Magdon-Ismail, Razvan Cheveresan, Matthew D. Ramsay