Search

Bimal K Mehta

from Sammamish, WA
Age ~57

Bimal Mehta Phones & Addresses

  • 21501 3Rd St, Sammamish, WA 98074 (425) 837-1840
  • 530 237Th Ave, Sammamish, WA 98074 (425) 837-1840
  • 560 237Th Ave, Sammamish, WA 98074 (425) 837-1840
  • Redmond, WA
  • Kiona, WA
  • Ridgewood, NJ
  • Edison, NJ
  • Piscataway, NJ
  • 21501 SE 3Rd Pl, Sammamish, WA 98074 (425) 837-1840

Work

Position: Professional/Technical

Education

Degree: High school graduate or higher

Resumes

Resumes

Bimal Mehta Photo 1

Vp, Engineering

View page
Location:
Sammamish, WA
Industry:
Computer Software
Work:
Microsoft
Vp, Engineering

Maidenform Feb 1993 - Jan 1998
Director of Engineering

Stepping Stone Computer Systems Dec 1989 - Jan 1993
Lead Software Engineer

Stepping Stone Computer Systems Aug 1987 - Nov 1989
Software Engineer
Education:
University of Washington 1998 - 1999
Masters, Master of Technology, Computer Science
Indian Institute of Technology, Delhi 1983 - 1987
Bachelors, Bachelor of Technology
Indian Institute of Technology
Skills:
Lync
Cloud Computing
Distributed Systems
Enterprise Software
Windows Azure
Saas
Scalability
Software Engineering
Unified Communications
Big Data
Microsoft Technologies
Engineering Management
C#
Software Design
Online Services
System Architecture
Voip
Agile Project Management
Software Project Management
Win32 Api
Mobile Applications
Mobile Devices
Solution Architecture
Web Services
Enterprise Architecture
Office 365
.Net
Technical Leadership
Messaging
Mapreduce
Paas
Large Scale Systems
Telecommunications
Computer Vision
Image Processing
Telephony
Video Conferencing
C++
Unified Messaging
Remote Development
Multi Site Team Management
Public Switched Telephone Network
Skype
Private Branch Exchange
Programming Languages
Database Systems
Java
Sql
Workflow Engines
Unix
Bimal Mehta Photo 2

Bimal Mehta

View page
Bimal Mehta Photo 3

Bimal Mehta

View page
Bimal Mehta Photo 4

Bimal Mehta

View page
Bimal Mehta Photo 5

Bimal Mehta

View page
Bimal Mehta Photo 6

Bimal Mehta

View page

Publications

Us Patents

Compensation Framework For Long Running Transactions

View page
US Patent:
6918053, Jul 12, 2005
Filed:
Feb 28, 2002
Appl. No.:
10/086032
Inventors:
Satish Ramchandra Thatte - Redmond WA, US
Lucius Gregory Meredith - Seattle WA, US
Marc Levy - Woodinville WA, US
Bimal Kumar Mehta - Sammamish WA, US
Johannes Klein - Sammamish WA, US
Anthony Dean Andrews - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F011/00
US Classification:
714 16
Abstract:
An error-handling framework is provided for business process transactions. The error-handling framework facilitates coordination of the invocation of exception and compensation handlers in response to errors. The error-handling framework includes support for custom ordering of compensation actions, data flow into and out of compensation actions, and management of the process state visible to compensation actions.

Scalable Storage And Processing Of Hierarchical Documents

View page
US Patent:
7113942, Sep 26, 2006
Filed:
Jun 27, 2003
Appl. No.:
10/609283
Inventors:
Yossi Levanoni - Redmond WA, US
Wei-Lun Lo - Sammamish WA, US
Sanjib Saha - Bellevue WA, US
Paul Maybee - Seattle WA, US
Bimal Mehta - Sammamish WA, US
Lee Graber - Kirkland WA, US
Anandhi Somasekaran - Redmond WA, US
Akash Sagar - Redmond WA, US
Balinder Malhi - Redmond WA, US
Allen Zhang - Sammamish WA, US
Siunie Sutjahjo - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
US Classification:
707 3, 707100
Abstract:
Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.

Data Flow Analysis Of Transactional Processes

View page
US Patent:
7210135, Apr 24, 2007
Filed:
Aug 26, 2003
Appl. No.:
10/648461
Inventors:
Donald James McCrady - Redmond WA, US
Paul F. Ringseth - Redmond WA, US
Bimal Mehta - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/45
US Classification:
717140, 717142, 717144, 717154, 717155, 717156
Abstract:
A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

Data Property Promotion System And Method

View page
US Patent:
7237184, Jun 26, 2007
Filed:
Dec 18, 2003
Appl. No.:
10/739714
Inventors:
John D. Ballard - Woodinville WA, US
Wei-Lun Lo - Issaquah WA, US
Bimal K. Mehta - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/00
US Classification:
715500, 7155011
Abstract:
A method for promoting properties for processing a message in a business automation system includes the steps of receiving a message which has a plurality of parts where each part has associated properties; identifying the associated properties to be promoted; extracting the information of the promoted property; storing the information of the promoted property in a memory; and processing the message by accessing the information of the promoted property from the memory instead of directly from the message. The method may further include correlating a received message with an earlier processed message by using a correlation method utilizing a strong naming convention to generate a correlation identifier.

Declarative State Space Reduction In A Transactional Messaging Language

View page
US Patent:
7343589, Mar 11, 2008
Filed:
Jun 18, 2003
Appl. No.:
10/463940
Inventors:
Paul F. Ringseth - Redmond WA, US
Donald James McCrady - Redmond WA, US
Bimal Mehta - Sammamish WA, US
Paul Maybee - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
G06N 5/00
US Classification:
717126, 717131, 717140, 706 47, 706 57
Abstract:
A XLANG/s compiler recognizes a statement in XLANG/s code to make an assumption as to the success or failure of a specified transaction. The assignment states of variables are tracked and changes to such states are recorded. While processing XLANG/s code, the compiler determines whether the assignment state of a particular correlation, operation or the like is correct for the transaction being performed. If not, the compiler may generate an error message. Moreover, by using declarative assumptions such as if(succeeded(T)) or if(!succeeded(T)), definite-assignment analysis of shared state variables may cross transactional boundaries.

Efficient Processing Of A Convoy Workflow Scenario In A Message Driven Process

View page
US Patent:
7370333, May 6, 2008
Filed:
Jun 2, 2003
Appl. No.:
10/452961
Inventors:
Bimal Mehta - Sammamish WA, US
Johannes Klein - Sammamish WA, US
Lee Graber - Kirkland WA, US
Paul Maybee - Seattle WA, US
Sriram Balasubramanian - Bellevue WA, US
Sanjib Saha - Bellevue WA, US
Satish R. Thatte - Redmond WA, US
Paul F. Ringseth - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
US Classification:
719313, 719315
Abstract:
An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure.

Compensation Framework For Long Running Transactions

View page
US Patent:
7380166, May 27, 2008
Filed:
Mar 30, 2005
Appl. No.:
11/093793
Inventors:
Satish Ramchandra Thatte - Redmond WA, US
Lucius Gregory Meredith - Seattle WA, US
Marc Levy - Woodinville WA, US
Bimal Kumar Mehta - Sammamish WA, US
Johannes Klein - Sammamish WA, US
Anthony Dean Andrews - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 11/00
US Classification:
714 20, 714 16
Abstract:
An error-handling framework is provided for business process transactions. The error-handling framework facilitates coordination of the invocation of exception and compensation handlers in response to errors. The error-handling framework includes support for custom ordering of compensation actions, data flow into and out of compensation actions, and management of the process state visible to compensation actions.

Systems And Methods For Using Metrics To Control Throttling And Swapping In A Message Processing System

View page
US Patent:
7412513, Aug 12, 2008
Filed:
Nov 14, 2003
Appl. No.:
10/714157
Inventors:
Yossi Levanoni - Redmond WA, US
Sanjib Saha - Bellevue WA, US
Bimal Kumar Mehta - Sammamish WA, US
Paul Maybee - Seattle WA, US
Lee Graber - Kirkland WA, US
Balasubramanian Sriram - Sammamish WA, US
Eldar Azerovich Musayev - Sammamish WA, US
Kevin Bowen Smith - Sammamish CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/16
US Classification:
709225, 709217, 709219, 709224, 710200, 710240, 718104, 718105
Abstract:
A system and method of using metrics to control throttling and swapping in a message processing system is provided. A workload status of a message processing system is determined, and the system polls for a new message according to the workload status. The message processing system identifies a blocked instance and calculates an expected idle time for the blocked instance. The system dehydrates the blocked instance if the expected idle time exceeds a predetermined threshold.
Bimal K Mehta from Sammamish, WA, age ~57 Get Report