Microsoft Technology Licensing, LLC

Kony, Inc.

Perraju Bendapudi

Rajesh Jalan

Jagan M Peri

Siddharth Rana

Hari Krishnan S

Harish Mohanan

Matthew B Trevathan

Sri Ramanathan

Matthew Adam Terry

Jithendra K Veeramachaneni

Jatin Kakkar

Bjorn Hildahl

Gopi Krishna Mudumbai

Kiran Akella Venkata

Amit Kumar Yadav

Phani Kishore Talluri

Rajasekhar Khandrika

Deepak Chanderasakar

Krishna Padmasola

Amit Kumar Ghosh

Rohini Krishnan Rajaraman

Ramarathnam R Venkatesan

Dharma Kiritkumar Shukla

Narayanan Ganapathy

Vladimir A Levin

Vijayendra Gopalrao Vasu

Anu Engineer

Archishmat Sharad Gore

Abishek Kumarasubramanian

Shankara M C Shastry

Hari Krishnan Srinivasan

SriSatya Aravind Akella

Suryanarayana Harsha

Vijay Kota

A multi-tenant, elastically scalable cache as a service is disclosed. Embodiments of the cache service eliminate the need for applications to manage their own cache tier. The multi-tenant cache service is implemented by maintaining/creating multiple named caches in a cache cluster and mapping each tenant's cache to a named cache in the cluster. Strict quotas are enforced on cache sizes This allows caches with different replication attributes to co-exist on the same cache server, allows migration of a cache from one cluster to another for load balancing purposes, and allows a cache to inflate/deflate to meet business needs. A network load balancer is used to route cache items to servers.

High-density multi-tenant distributed cache as a service

Systems and processes of advanced identity management over multiple identity providers deployable through mobile applications are provided. The process, e.g., method, includes requesting a backend service from multiple backend services by a requesting device. The method further includes exposing the requested backend service though a call in by a gateway service using a token mapped to the requested backend service, without exposing any of the backend services directly to the requesting device.

Identity management over multiple identity providers

The diverse objects comprising a computing environment may be represented together as a deployable object hierarchy, which may facilitate the deployment, as well as the consistency, of a computing environment rendered by a plurality of devices. The processes within the computing environment often operate on the objects of the object hierarchy in a variety of ways, including simple operations (creation, reading, updating, and deleting) and more sophisticated operations (synchronizing, paginating, and caching), as well as with the object hierarchy in general. A platform may be devised to facilitate the various operations of the processes on the object hierarchy. The platform may be embodied, such as in an application runtime, and deployed to a variety of platforms to facilitate an equivalent execution of the processes on any type of device and consistent interactions with the object hierarchy.

Deployable, consistent, and extensible computing environment platform

An apparatus and method provide for profile optimizations at a binary level. Thread specific data may be used to lay out a procedure in a binary. In one example, a hot thread may be identified and a layout may be generated based on the identified hot thread. Also, threads of an application may be ranked according to frequency of execution of the corresponding threads. The layout may be created based on the different threads of differing frequency of execution and conflicts between a hottest thread and each of the other threads of the application. In another example, different threads of the application may conflict. For example, two threads may contain operations that overlap temporally to create a race condition. A layout of the application threads may be created based on conflicting threads.

Multi core optimizations on a binary using static and run time analysis

A method and system for generating a normalized string and performing a phonetic search are provided. To normalize a string, a native string is obtained. Upon obtaining a native string, native-character sets within the native string are identified. Each native-character set is associated with a phonetically corresponding normalized character-set. A normalized string is generated based on the phonetically corresponding normalized character-sets. After normalizing a query string and one or more search content strings, the normalized strings may be utilized to perform a phonetic search. As such, the query string may be compared to the one or more search content strings to ascertain relevant search results. Relevant search results may be indexed and obtained at a later instant.

Phonetic search using normalized string

Events captured at an application are compared to event correlation instances, wherein an event correlation instance represents a relationship between events of components of the application. The event of a plurality of events that is a potential root cause event of the plurality of events is determined. The potential root cause event and component associated with the potential root cause event are outputted.

Automated event correlation

Which target functions in a target binary have target function basic blocks that match the source function basic blocks in a source function in a source binary is determined. For the target functions having matching target function basic blocks, a target function control flow graph is determined that has the greatest control flow matching strength to a source function control flow graph, wherein a node in the source function control graph represents a source function basic block, wherein a node in a target function control graph represents a target function basic block in a corresponding target function.

Function matching in binaries

A facility for debugging in an operating system with native and non-native subsystems is described. The facility employs a debugger designed for use with the native subsystem. The debugger receives an indication to debug the application program of the non-native subsystem, attaches to the application program of the non-native subsystem, and when it receives an indication that the application program has started a new process, attaches to an executable component operating in the new process. When the debugger is appropriately configured, the facility attaches to an application program operating on the non-native subsystem rather than a terminal component operating on the native subsystem. When the debugger is appropriately configured, the facility redirects exceptions the debugger receives to the non-native subsystem.

Debugging in an operating system with multiple subsystems

Technologies for estimating deviations in the performance characteristics of a newer version of software relative to an older version. Such performance characteristics include cache misses, pages faults, and the like. Estimations are typically made by instrumenting and profiling an older version binary, determining differences in code blocks between the older and a newer version, propagating profile data from the older version to the newer version based on a simulation heuristic, and estimating performance deviations based on the older version, the profile data, configuration parameters, and the changes in the newer version without actually executing the newer version of the binary.

Static performance analysis of software

A binary is received at a binary verification service from a binary verification client agent. The binary verification service performs binary verification of the binary, wherein binary verification includes determining whether the binary is complicit with a set of usage rules. The binary verification service sends a binary verification result to the binary verification client agent.

Binary verification service

Application setting virtualization for a user. Application settings from a source computer are copied to a user-specific location on a destination computer and layered under corresponding application settings associated with one or more applications installed on the destination computer. In response to receiving a request from an application for an application setting, the requested application setting is retrieved from the layered application settings such that the layers are searched in order for the requested application setting and the first application setting found is retrieved and returned to the requesting application.

Application settings migration using virtualization

A high level intermediate representation of a binary is generated. Circuit nodes from the high level intermediate representation are built, wherein a circuit node represents an operation in the high level intermediate representation. The circuit nodes are connecting using a flow analysis of the binary to build a circuit that represents the binary.

Representing binary code as a circuit

Spyware programs are detected even if their binary code is modified by normalizing the available code and comparing to known spyware patterns. Upon normalizing the known spyware code patterns, a signature of the normalized code is generated. Similar normalization techniques are employed to reduce the executable binary code as well. A match between the normalized spyware signature and the patterns in the normalized executable code is analyzed to determine whether the executable code includes a known spyware. For pattern matching, Deterministic Finite Automata (DFA) is constructed for basic blocks and simulated on the basic blocks of target executable, hash codes are generated for instructions in target code and known spyware code and compared, register usages are replaced with common variables and compared, and finally Direct Acyclic Graphs (DAGs) of all blocks are constructed and compared to catch reordering of mutually independent instructions and renamed variables.

Growing community of inventors

Hyderabad Telangana, India

Perraju Bendapudi