Patents by Inventor Michael B. Jones
Michael B. Jones has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7672309Abstract: A system and method to adjust dynamically network speed or bandwidth allocation. A network connection is established at some initial speed. The bandwidth usage through the connection is monitored, and when the connection speed becomes congested with data, the connection is dropped and a higher-speed connection is established.Type: GrantFiled: September 1, 2005Date of Patent: March 2, 2010Assignee: AT&T Intellectual Property II, L.P.Inventor: Michael B. Jones
-
Publication number: 20100020694Abstract: A system and method to adjust dynamically network speed or bandwidth allocation. A network connection is established at some initial speed. The bandwidth usage through the connection is monitored, and when the connection speed becomes congested with data, the connection is dropped and a higher-speed connection is established.Type: ApplicationFiled: September 28, 2009Publication date: January 28, 2010Inventor: Michael B. Jones
-
Patent number: 7640253Abstract: A method and system for managing data records on a computer network is described, in which copies of data records are distributed among various servers in a hierarchical tree structure, and in which servers that experience an excessive number of requests for a particular data record transmit replicas of that data record to other servers to distribute the load.Type: GrantFiled: February 22, 2005Date of Patent: December 29, 2009Inventors: Marvin M. Theimer, Michael B. Jones
-
Patent number: 7620730Abstract: A method for multicasting a message in a computer network is described, in which at least some nodes of a multicast group transmit fault recovery information to other nodes of the group in addition to, or as part of, the message itself. The fault recovery information allows nodes to determine what dissemination responsibility should be assigned to successor nodes in the event that one or more nodes of the multicast group fail.Type: GrantFiled: July 17, 2006Date of Patent: November 17, 2009Inventors: Marvin M. Theimer, Michael B. Jones, Krishna P. Gummadi
-
System and method for creating improved overlay network with an efficient distributed data structure
Patent number: 7613796Abstract: A system and method for using skip nets to build and maintain overlay networks for peer-to-peer systems. A skip net is a distributed data structure that can be used to avoid some of the disadvantages of distributed hash tables by organizing data by key ordering. Skip nets can use logarithmic state per node and probabilistically support searches, insertions and deletions in logarithmic time.Type: GrantFiled: February 3, 2003Date of Patent: November 3, 2009Assignee: Microsoft CorporationInventors: Nicholas J. Harvey, Michael B. Jones, Stefan Saroiu, Marvin M. Theimer, Alastair Wolman, Atul Adya -
Patent number: 7571438Abstract: A resource management mechanism is provided to ensure that real-time application programs running on a single machine or set of machines exhibit predictable behavior. The resource management mechanism employs the abstraction of an activity which serves as the basis for granting resource reservations and for accounting. An activity submits a request for resources in specified amounts to a resource planner. The activity is resource self-aware so that it is aware of its resource requirements. The activity may query resource providers to obtain resource requirements for particular operations. The resource planner determines whether the activity should be granted the requested reservation by employing an internal policy. Policy is separated by mechanism so that the resource planner may implement any of a number of policies. The resource planner may choose to grant the reservation to an activity or deny the request by an activity.Type: GrantFiled: July 18, 2001Date of Patent: August 4, 2009Assignee: Microsoft CorporationInventors: Michael B. Jones, Paul J. Leach, Richard P. Draves, Jr., Joseph S. Barrera, III
-
Patent number: 7551552Abstract: A guaranteed distributed failure notification method is described, wherein a failure notification (FN) facility allows applications using the facility to create FN groups to which the application associates an application state. The application registers failure handlers with the FN facility on nodes in the FN group; each failure handler is associated with a specific FN group. When, on a given node, the FN facility learns of a failure in the FN group, the facility executes the associated failure handler on that node. System failures detected by the application are signaled to other FN group members using the facility. The facility detects system failures that occur in an overlay network on which the facility is implemented, and signals a failure notification to the other FN group members.Type: GrantFiled: October 17, 2003Date of Patent: June 23, 2009Assignee: Microsoft CorporationInventors: John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostić, Marvin M. Theimer, Alastair Wolman
-
Publication number: 20090145980Abstract: A hand-held paint spray gun apparatus having a paint reservoir on the gun and reciprocating piston driven by a motor in the hand-held paint spray gun, the gun having a multiple orifice spray tip with a pair of apertures emitting generally fan or cone shaped overlapping spray patterns. A locking nut retains the cylinder to a motor frame and a frame carries the spray tip, with one of the nut and frame having a corrugated surface and the other of the locking nut and the spray tip frame having a plurality of protrusions engaging the corrugated surface. The protrusions are spaced apart circumferentially from each other and with respect to the spacing of a plurality of troughs and crests in the corrugated surface such that only one protrusion at a time is nested in a trough of the corrugated surface.Type: ApplicationFiled: December 4, 2008Publication date: June 11, 2009Applicant: WAGNER SPRAY TECH CORPORATIONInventor: Michael B. Jones
-
Patent number: 7451450Abstract: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers, e.g., using a priority-based policy. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity. Each resource consumer can specify one or more configurations, which may be ranked, for each activity. This allows the resource consumers to be dynamically changed from one configuration to another as operating conditions change.Type: GrantFiled: August 31, 2004Date of Patent: November 11, 2008Assignee: Microsoft CorporationInventors: Mukund Sankaranarayan, Forrest C. Foltz, George Shaw, Dale A. Sather, Andy R. Raffman, Jai Srinivasan, Terje K. Backman, William G. Parry, David S. Bakin, Michael B. Jones, Sean C. McDowell, Jayachandran Raja, Robin Speed
-
Patent number: 7409689Abstract: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors.Type: GrantFiled: October 31, 2005Date of Patent: August 5, 2008Assignee: Microsoft CorporationInventors: Michael B. Jones, John Regehr
-
Patent number: 7377452Abstract: Apparatus and method for cleaning a paint cup, spray tip, and wetted parts from a hand held paint spray gun wherein the gun is disassembled after use and internal wetted parts needing cleaning are inserted into the paint cup, a cleaning cap is attached to the paint cup, and a garden hose is used to flush paint from the interior of the paint cup and the parts contained therein. In another aspect, the cleaning cap is attached to and used to flush an extended suction set having an elongated double lumen hose and adapter. The cleaning cap has a fitting adapted to receive a conventional garden hose and further has a passageway to allow water to exit from the cap after flushing the interior of the paint cup.Type: GrantFiled: January 14, 2004Date of Patent: May 27, 2008Assignee: Wagner Spray Tech CorporationInventors: Michael B. Jones, Wayne Robens
-
Patent number: 7337446Abstract: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity.Type: GrantFiled: August 31, 2004Date of Patent: February 26, 2008Assignee: Microsoft CorporationInventors: Mukund Sankaranarayan, Forrest C. Foltz, George Shaw, Dale A. Sather, Andy R. Raffman, Jai Srinivasan, Terje K. Backman, William G. Parry, David S. Bakin, Michael B. Jones, Sean C. McDowell, Jayachandran Raja, Robin Speed
-
Publication number: 20070278787Abstract: Apparatus and method for quickly disconnecting a wetted parts subassembly from a paint spray gun wherein the wetted parts subassembly includes a spray tip, pump cylinder and piston and paint cup components including a pump housing cylinder support carrying the pump cylinder and having a pair of protrusions formed on a pump housing cylinder support, a frame having a pair of slots aligned to receive the protrusions when the pump housing cylinder support is received in the frame, a locking lever pivotably attached to the frame adjacent at least one of the slots and movable between a latched position wherein the pump housing cylinder support is retained to the frame, and an unlatched position wherein the pump housing cylinder support is removable from the frame.Type: ApplicationFiled: May 31, 2006Publication date: December 6, 2007Applicant: WAGNER SPRAY TECH CORPORATIONInventors: Michael B. Jones, Richard Paul Anderson, Allen Arden Caldwell, Brian David Denker, Charles Thomas Graves, Christopher John Herman, Robert Ernest Miller, Lance Talbot Molby
-
Patent number: 7284244Abstract: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity.Type: GrantFiled: May 2, 2000Date of Patent: October 16, 2007Assignee: Microsoft CorporationInventors: Mukund Sankaranarayan, Jai Srinivasan, Dale A. Sather, Andy R. Raffman, Michael B. Jones, Sean C. McDowell
-
Patent number: 7171669Abstract: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors.Type: GrantFiled: May 7, 2004Date of Patent: January 30, 2007Assignee: Microsoft CorporationInventors: Michael B. Jones, John Regehr
-
Patent number: 7162720Abstract: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors.Type: GrantFiled: May 10, 2004Date of Patent: January 9, 2007Assignee: Microsoft CorporationInventors: Michael B. Jones, John Regehr
-
Patent number: 7155724Abstract: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors.Type: GrantFiled: May 17, 2004Date of Patent: December 26, 2006Assignee: Microsoft CorporationInventors: Michael B. Jones, John Regehr
-
Patent number: 7137119Abstract: Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity.Type: GrantFiled: May 2, 2000Date of Patent: November 14, 2006Assignee: Microsoft CorporationInventors: Mukund Sankaranarayan, Michael B. Jones, Terje K. Backman
-
Patent number: 7107593Abstract: The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors.Type: GrantFiled: May 13, 2004Date of Patent: September 12, 2006Assignee: Microsoft CorporationInventors: Michael B. Jones, John Regehr
-
Patent number: 7096228Abstract: A method and system for managing data records on a computer network is described, in which copies of data records are distributed among various servers in a hierarchical tree structure, and in which servers that experience an excessive number of requests for a particular data record transmit replicas of that data record to other servers to distribute the load.Type: GrantFiled: March 27, 2002Date of Patent: August 22, 2006Assignee: Microsoft CorporationInventors: Marvin M. Theimer, Michael B. Jones