University of Washington Seattle, WA 2015 to 2015 Certificate in Database ManagementNorth Carolina Agricutural &Technical State University Greensboro, NC 2013 to 2015 MS in Computational Science and EngineeringUniversity of North Carolina At Greensboro Greensboro, NC 2011 to 2013 BA in Mathematics,minor economicsChina Agricultural University 2005 to 2009 BA in Business Administration
Skills:
Programming Language: Python, sql, Matlab, Java, C++, Mathematica; Statistical Software: R, SAS; Database: Microsoft SQL server
- Redmond WA, US Rushi Srinivas SURLA - Kenmore WA, US Peter BODIK - Kirkland WA, US Ishai MENACHE - Redmond WA, US Yang LU - Redmond WA, US
International Classification:
G06F 12/02 G06F 3/06
Abstract:
In an embodiment, a partition cost of one or more of the plurality of partitions and a data block cost for one or more data blocks that may be subjected to a garbage collection operation are determined. The partition cost and the data block cost are combined into an overall reclaim cost by specifying both the partition cost and the data block cost in terms of a computing system latency. A byte constant multiplier that is configured to modify the overall reclaim cost to account for the amount of data objects that may be rewritten during the garbage collection operation may be applied. The one or more partitions and/or one or more data blocks that have the lowest overall reclaim cost while reclaiming an acceptable amount of data block space may be determined and be included in a garbage collection schedule.
Cost-Based Garbage Collection Scheduling In A Distributed Storage Environment
- Redmond WA, US Rushi Srinivas SURLA - Kenmore WA, US Peter BODIK - Kirkland WA, US Ishai MENACHE - Redmond WA, US Yang LU - Redmond WA, US
International Classification:
G06F 12/02
Abstract:
In an embodiment, a partition cost of one or more of the plurality of partitions and a data block cost for one or more data blocks that may be subjected to a garbage collection operation are determined. The partition cost and the data block cost are combined into an overall reclaim cost by specifying both the partition cost and the data block cost in terms of a computing system latency. A byte constant multiplier that is configured to modify the overall reclaim cost to account for the amount of data objects that may be rewritten during the garbage collection operation may be applied. The one or more partitions and/or one or more data blocks that have the lowest overall reclaim cost while reclaiming an acceptable amount of data block space may be determined and be included in a garbage collection schedule.