Microsoft Technology Licensing, LLC

Chad R Shurtz

Robert D Donner

Karvell Li

Sanjay Garg

Gregory Akselrod

Tianyu Xie

Gordon Hardy

Scott Kurtzeborn

Scott Kurtzebom

Amit Wadhwa

Danny R Amirault

Donald Gordon Hardy

Robert Jervis

Xavier L Bocken

Technology is disclosed herein for licensing applications using a preferred authorization process dynamically identified based on conditions associated with an initiation of an application. Authorization is then attempted using the preferred authorization process. In some examples, the preferred authorization process is selected from at least a keyless authorization process and a key-based authorization process.

Dynamic selection of authorization processes

Systems, methods, and software are disclosed herein for licensing applications using a preferred authorization process dynamically identified based on conditions associated with an initiation of an application. Authorization is then attempted using the preferred authorization process. In some examples, the preferred authorization process is selected from at least a keyless authorization process and a key-based authorization process.

A method, system, and computer-readable storage media for providing user based licensing of an application are provided herein. The method includes receiving user log-in information from a computing device at a licensing service in response to an input by a user and providing a license for an application to the computing device, wherein the license includes device specific information associated with the user. The method also includes activating the application on the computing device using the device specific information.

User based licensing for applications

In a distributed computing environment, a queue of jobs is maintained on a job database, along with parameters for each of the computing devices available to process the jobs. A task model defining the job is provided for generating a plurality of tasks comprising each job. The tasks are maintained in a tuple database, along with the status of each task, indicating when each task is ready for processing. As a computing device becomes available to process a task, its capabilities are matched with those required to complete tasks that are ready for processing and the highest priority task meeting those requirements is assigned to the computing device to be processed. These steps are repeated until all the tasks required for the job have been processed, or the job is otherwise terminated.

Distributed computing of a job corresponding to a plurality of predefined tasks

Growing community of inventors

Everett, WA, United States of America

Chad R Shurtz