Search

Sandeep Sandeep Lingam

from Redmond, WA
Age ~42
Get Report
Related to:
Mithuna Lingam
Connected to:
Siva R Lingam, 80Veena Lingam, 42Vinayak R Lingam, 53Jessica M Lingan, 37John L Lingan, 64Ramesh Lingan, 52Usha F Lingappa, 33Adam N Lingard, 50Andrew Lingard, 38Anthony A Lingard, 67

Sandeep Lingam Phones & Addresses

  • 12221 168Th Pl NE, Redmond, WA 98052
  • Bellevue, WA
  • Omaha, NE
  • Lincoln, NE

Work

Company: Microsoft Jul 2008 Position: Principal software engineer

Skills

Software Engineering • Software Development • Agile Methodologies • Testing • Leadership • Distributed Systems • Analysis • C# • Software Design • C++ • Test Automation • Sdlc • Xml • Product Management • Scrum • Sql • Software Project Management • Requirements Analysis • .Net

Industries

Computer Software

Resumes

Resumes

Sandeep Lingam Photo 1

Principal Software Engineer

View page
Location:
Redmond, WA
Industry:
Computer Software
Work:
Microsoft
Principal Software Engineer
Aci Worldwide Jun 2006 - Jul 2008
Software Engineer
Skills:
Software Engineering
Software Development
Agile Methodologies
Testing
Leadership
Distributed Systems
Analysis
C#
Software Design
C++
Test Automation
Sdlc
Xml
Product Management
Scrum
Sql
Software Project Management
Requirements Analysis
.Net

Publications

Us Patents

Reactive Load Balancing For Distributed Systems

View page
US Patent:
20120109852, May 3, 2012
Filed:
Jan 25, 2011
Appl. No.:
13/013746
Inventors:
Sandeep Lingam - Bellevue WA, US
Kanmin Zhang - Redmond WA, US
Mark Benvenuto - Seattle WA, US
David Lo - Saratoga CA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 15/16
G06F 17/00
US Classification:
705400, 709226
Abstract:
The subject disclosure relates to load balancing systems and methods. In one embodiment, a reactive load balancer can receive feedback from a first database node, and allocate resources to the first database node based, at least, on the feedback. The feedback is dynamic and comprises information indicative of a load level at the first database node. In some embodiments, the feedback includes information indicative of a load level at a second, under loaded, database node. In other embodiments, load balancing is performed by an overloaded node polling a set of devices (e.g., cell phone, personal computer, PDA) at which resources may be available. Specifically, the method includes polling devices for resource availability at the devices, and receiving price information for resources provided by at least one device. The overloaded node utilizes the resource in response to providing payment of the price. Auction models or offer/counteroffer approaches can be employed.

Cluster Restore And Rebuild

View page
US Patent:
20110184915, Jul 28, 2011
Filed:
Jan 28, 2010
Appl. No.:
12/695166
Inventors:
Zhongwei Wu - Sammamish WA, US
Oliver N. Seeliger - Sammamish WA, US
Santeri Olavi Voutilainen - Seattle WA, US
Ajay Kalhan - Redmond WA, US
Sandeep Lingam - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707674, 707E17007, 707E17005
Abstract:
Architecture that facilitates the restoration of a cluster database in a scalable way using backups (e.g., SQL database backups) and a partition rebuild mechanism to achieve a high level of partition level data consistency, even when restore fails on individual machines and/or machine failure occurs. The architecture restores replicas of the partitions in consideration that the backups may be created at different points and at different times. Optimized parallelism is achieved in restoring each database machine using local backups, which eliminates cross-machine network traffic. Thus, fast recovery of the distributed database can be accomplished on the order of hours over thousands of machines and terabytes of data.

Snapshot-Based Data Corruption Detection

View page
US Patent:
20220342778, Oct 27, 2022
Filed:
Oct 27, 2021
Appl. No.:
17/512337
Inventors:
- Redmond WA, US
Cristian DIACONU - Kirkland WA, US
Sandeep LINGAM - Redmond WA, US
Alejandro Hernandez SAENZ - Kirkland WA, US
Naveen PRAKASH - Sammamish WA, US
Krystyna Ewa REISTETER - Kirkland WA, US
Rogerio RAMOS - Redmond WA, US
Huanhui HU - Redmond WA, US
Peter BYRNE - Charlotte Hall MD, US
International Classification:
G06F 11/14
G06F 11/00
Abstract:
Embodiments described herein detect data corruption in a distributed data set system. For example, a system comprises node(s) for processing queries with respect to a distributed data set comprising a plurality of storage segments. A write transaction resulting from a query with respect to a particular storage segment is logged in a log record that describes a modification to the storage segment. A log service provides the log record to a data server managing a portion of the distributed data set in which the storage segment is included, which performs the write transaction with respect to the storage segment. For redundancy purposes, the data server has replica(s) that manage respective replicas of the portion of the distributed data set managed thereby. For backup purposes, snapshots of the replica(s) are periodically generated. To determine a data corruption, a snapshot of one replica is cross-validated with a snapshot of another replica.

Rowgroup Consolidation With Global Delta Accumulation And Versioning In Distributed Systems

View page
US Patent:
20220318223, Oct 6, 2022
Filed:
Jun 25, 2021
Appl. No.:
17/358886
Inventors:
- Redmond WA, US
Tianhui SHI - Issaquah WA, US
Srikumar RANGARAJAN - Sammamish WA, US
Steven John LINDELL - Bellevue WA, US
Sandeep LINGAM - Redmond WA, US
International Classification:
G06F 16/22
G06F 16/23
G06F 16/2455
Abstract:
Methods for rowgroup consolidation with delta accumulation and versioning in distributed systems are performed. The systems provide performant methods of row storage that enable versioned modifications of data while keeping and allowing access to older versions of the data for point-in-time transactions. The accumulation of valid rows, deletes, and modifications is maintained in blobs for rowgroups until a size threshold is reached, at which point the rows are moved into a columnar compressed form. Changes to data and associated metadata are stored locally and globally via appends, maintaining logical consistency. Metadata is stored in footers of files allowing faster access to the metadata and its associated data for transactions and instant rollback via metadata version flipping for aborted transactions, as well as lock-free reads of data.

Data Visibility For Nested Transactions In Distributed Systems

View page
US Patent:
20220318263, Oct 6, 2022
Filed:
Mar 31, 2021
Appl. No.:
17/219007
Inventors:
- Redmond WA, US
Alan Dale HALVERSON - Verona WI, US
Sandeep LINGAM - Redmond WA, US
Srikumar RANGARAJAN - Sammamish WA, US
International Classification:
G06F 16/27
G06F 9/46
G06F 16/901
Abstract:
Methods for data visibility in nested transactions in distributed systems are performed by systems and devices. Distributed executions of queries are performed in processing systems according to isolation level protocols with unique nested transaction identifiers for data management and versioning across one or more data sets, one or more compute pools, etc., within a logical server via a single transaction manager that oversees the isolation semantics and data versioning. A distributed query processor of the systems and devices performs nested transaction versioning for distributed tasks by generating nested transaction identifiers, encoded in data rows, which are used to enforce correct data visibility. Data visibility is restricted to previously committed data from distributed transactions and tasks, and is blocked for distributed transactions and tasks that run concurrently. Local commits for completed transactions and tasks are used to minimize transaction manager interactions, and instant rollbacks are enabled for aborted transactions and tasks.

Snapshot Isolation Query Transactions In Distributed Systems

View page
US Patent:
20220300483, Sep 22, 2022
Filed:
Mar 19, 2021
Appl. No.:
17/207219
Inventors:
- Redmond WA, US
Hari Krishna SUNDER - Redmond WA, US
Srikumar RANGARAJAN - Sammamish WA, US
Steven John LINDELL - Bellevue WA, US
Sandeep LINGAM - Redmond WA, US
International Classification:
G06F 16/23
G06F 16/27
G06F 16/2458
Abstract:
Methods for snapshot isolation query transactions in distributed systems are performed by systems and devices. Distributed executions of queries are performed in a processing system according to an isolation level protocol for data management and data versioning across one or more data sets, one or more compute pools, etc., within a logical server via a single transaction manager that oversees the isolation semantics and data versioning. Read transactions of queries are performed lock-free via the isolation semantics, and instant rollbacks, point-in-time queries, single-phase commits in the distributed systems are also provided. Abort and cleanup operations are performed based on a distributed abort protocol and a determined oldest active transaction for the system in which the single transaction manager does not track read-only transactions, and client nodes do not maintain commit tables for transactions.

Snapshot Isolation Query Transactions In Distributed Systems

View page
US Patent:
20220300484, Sep 22, 2022
Filed:
Mar 19, 2021
Appl. No.:
17/207282
Inventors:
- Redmond CA, US
Xianfei DENG - Redmond WA, US
Hari Krishna SUNDER - Redmond WA, US
Sandeep LINGAM - Redmond WA, US
Srikumar RANGARAJAN - Sammamish WA, US
International Classification:
G06F 16/23
G06F 16/27
G06F 16/2455
G06F 16/215
Abstract:
Methods for snapshot isolation query transactions in distributed systems are performed by systems and devices. Distributed executions of queries are performed in a processing system according to an isolation level protocol for data management and data versioning across one or more data sets, one or more compute pools, etc., within a logical server via a single transaction manager that oversees the isolation semantics and data versioning. Read transactions of queries are performed lock-free via the isolation semantics, and instant rollbacks, point-in-time queries, single-phase commits in the distributed systems are also provided. Abort and clean up operations are performed based on a distributed abort protocol and a determined oldest active transaction for the system in which the single transaction manager does not track read-only transactions, and client nodes do not maintain commit tables for transactions.

Application Service-Level Configuration Of Dataloss Failover

View page
US Patent:
20190286536, Sep 19, 2019
Filed:
May 31, 2019
Appl. No.:
16/428164
Inventors:
- Redmond WA, US
Daniel L. Lemmond - Redmond WA, US
Sandeep Lingam - Redmond WA, US
Sameer Arun Verkhedkar - Issaquah WA, US
Tomas Talius - Sammamish WA, US
International Classification:
G06F 11/20
G06F 11/14
Abstract:
Application service configuration of a timeframe for performing dataloss failover (failover that does not attempt full data replication to the secondary data store) from a primary data store to the secondary data store. A data-tier service, such as perhaps a database as a service (or DBaaS), could receive that configuration from the application service and automatically perform the dataloss failover as configured by the application service. This relieves the application service from having to manage the failover workflow while still allowing the application service to appropriately balance the timing of dataloss failover, which will depend on a very application-specific optimal balance between the negative effects of operational latency versus dataloss.
Control profile
Sandeep Sandeep Lingam from Redmond, WA, age ~42 Get Report