About
Distinguished Engineer & CISO for Agents & Business Apps at Microsoft. Make…
Activity
2K followers
Experience
Education
-
Ivanovo State Power University
4.96/5.0
-
Patents
-
Precondition exclusivity mapping of tasks to computational locations
Issued US US 14/950,397
Computational tasks are mapped with computational locations in a distributed system such as a cloud computing environment. Mapping does not rely on workload estimates. Instead, tasks whose prerequisite tasks or other preconditions are determined to be mutually exclusive are co-located, while other tasks are mapped to different locations than one another. Locations are servers, processor cores, virtual machines, applications, or computational processes, for example. Mutual exclusivity may be…
Computational tasks are mapped with computational locations in a distributed system such as a cloud computing environment. Mapping does not rely on workload estimates. Instead, tasks whose prerequisite tasks or other preconditions are determined to be mutually exclusive are co-located, while other tasks are mapped to different locations than one another. Locations are servers, processor cores, virtual machines, applications, or computational processes, for example. Mutual exclusivity may be determined by detecting that preconditions require different values of a shared variable in order to be satisfied, for example, or determining that preconditions correspond to different branches of a conditional programming statement. A satisfiability engine may also provide a satisfiability determination. Co-located tasks may also be batched, for improved execution performance. Co-location based on mutual exclusivity may result in fewer operations to save and restore task state, fewer cache misses, greater co-allocation of computational resources by the tasks, and easier debugging.
Other inventorsSee patent -
Guaranteed delivery of replication message
Issued US US 14/638,202
Aspects of the present invention relate to guaranteeing delivery of replication messages in distributed storage systems. A request to perform an operation may be received. A first replication message corresponding to the request may be created, where the first replication message comprises instructions to replicate the result of the operation to one or more target storages. The replication message may be inserted in a message queue with a delayed visibility. The operation may be performed…
Aspects of the present invention relate to guaranteeing delivery of replication messages in distributed storage systems. A request to perform an operation may be received. A first replication message corresponding to the request may be created, where the first replication message comprises instructions to replicate the result of the operation to one or more target storages. The replication message may be inserted in a message queue with a delayed visibility. The operation may be performed, where a result of the operation is persisted in a source storage in a data store. Upon determining that the result was successfully persisted in the source storage, a second replication message may be created, where the second replication message comprises instructions to replicate the result of the operation to the one or more target storages. The second replication message may be inserted in the message queue with an immediate visibility.
Other inventorsSee patent -
Flow for multi-master replication in distributed storage
Issued US US 14/638,357
Embodiments are directed to replicating data in distributed storage. A replication message may be retrieved from a message queue associated with a source table. The replication message may include a row identifier. One or more target storages within a same replication group as the source table may be identified. A row from each of the one or more target storages may be obtained corresponding to the row identifier. A winning row may be determined from the obtained rows based on a latest…
Embodiments are directed to replicating data in distributed storage. A replication message may be retrieved from a message queue associated with a source table. The replication message may include a row identifier. One or more target storages within a same replication group as the source table may be identified. A row from each of the one or more target storages may be obtained corresponding to the row identifier. A winning row may be determined from the obtained rows based on a latest timestamp of the row. A replication operation may be created based on the winning row. The replication operation may be performed on the obtained rows from each of the target storages.
Other inventorsSee patent -
Predictive load scaling for services
Issued US US 14/307,759
Embodiments are directed to determining an optimal number of concurrently running cloud resource instances and to providing an interactive interface that shows projected operational metric measurements. In one scenario, a computer system accesses metric information which identifies operational metric measurements, and further accesses a second portion of metric information that identifies operational metric measurements for the cloud resource instances over a second period of time. The computer…
Embodiments are directed to determining an optimal number of concurrently running cloud resource instances and to providing an interactive interface that shows projected operational metric measurements. In one scenario, a computer system accesses metric information which identifies operational metric measurements, and further accesses a second portion of metric information that identifies operational metric measurements for the cloud resource instances over a second period of time. The computer system then calculates projected operational metric measurements based on the identified operational metric measurements over the first period of time (e.g. for reactive tuning) and further based on the identified operational metric measurements over the second period of time (e.g. for predictive tuning) The computer system then determines, based on the projected operational metric measurements, a number of cloud resource instances that are to be concurrently running at a specified future point in time.
Other inventorsSee patent -
Dynamically identifying target capacity when scaling cloud resources
Issued US US 14/307,745
Embodiments are directed to preventing flapping when auto-scaling cloud resources. The computer system calculates a scaling factor based on the target operational metric and the current measured value, where the scaling factor represents an amount of variance between the target operational metric and the current measured value. The computer system also calculates a delta value representing a modified quantity of cloud resources modified by the calculated scaling factor and determines whether a…
Embodiments are directed to preventing flapping when auto-scaling cloud resources. The computer system calculates a scaling factor based on the target operational metric and the current measured value, where the scaling factor represents an amount of variance between the target operational metric and the current measured value. The computer system also calculates a delta value representing a modified quantity of cloud resources modified by the calculated scaling factor and determines whether a scaling action is to occur based on the calculated delta value.
Other inventorsSee patent
Projects
-
libcubwt - ultra fast SA and BWT construction library for Nvidia GPUs
See projectlibcubwt is a library for ultra fast suffix array and Burrows-Wheeler transform construction on NVIDIA GPUs with typical performance above 500 MB/s (on Silesia corpus) on modern hardware (4070 Ti).
-
bsc-m03 - experimental context aware block sorting compressor
The bsc-m03 is experimental block sorting compressor based on M03 context aware compression algorithm invented by Michael Maniscalco. At the time of writing compressor has highest compression ratio among BWT compressors.
Other creatorsSee project -
libsais - fast SA and BWT construction library
See projectlibsais is a library for fast linear time suffix array and Burrows-Wheeler transform construction. On modern hardware libsais typically outperform previous state of the art SACA libraries by 60%-100% (MB/s).
-
libbsc - high performance block-sorting data compression library
- Present
See projectlibbsc is a high performance file compressor based on lossless, block-sorting data compression algorithm. Typically, bsc outperform modern compression programs like gzip and bzip2 by speed and/or compression. By independent benchmarking on http://compressionratings.com website it is currently ranked as #1 in Image1, Medical1, Medical2, Qualifying2 and Source1 tests.
-
Advanced algorithms class in University of Washington
-
Advanced algorithms class for talented students to compete in the upcoming ACM ICPC semifinals. Prepared and presented 10 lectures about advanced algorithms. Each lecture also includes small 5-6 problems as online contest for homework. Organized two onsite contests for midterm and finals. Overall students rated this class as one of the most intense classes in the semester.
Other creators
Languages
-
English
Full professional proficiency
-
Russian
Native or bilingual proficiency
Other similar profiles
Explore top content on LinkedIn
Find curated posts and insights for relevant topics all in one place.
View top content