Patents by Inventor Lawrence A. Harris
Lawrence A. Harris 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).
-
Publication number: 20190349277Abstract: Systems and methods for managing nodes in mesh networks are provided. An information element may be provided to indicate a status of a backhaul connection. A critical node may use the information element to determine the status of the backhaul connection prior to joining a PAN. A critical path may be created and maintained that includes the critical node and any intervening nodes between the critical node and the root. A critical node may switch PANs when a backhaul connection becomes unavailable. The switch may be facilitated by a node on the critical path other than the critical node. The loss of backhaul connection may be determined by examining the information element. A node may switch PANs and coordinate the switch with its child nodes.Type: ApplicationFiled: May 8, 2018Publication date: November 14, 2019Inventors: Christopher Scott Hett, Lawrence Harris, Vivek Bhatt, Craig Cornwall, James Patrick Hanley
-
Publication number: 20190349245Abstract: Systems and methods for managing nodes in mesh networks are provided. A critical node may determine a status of a backhaul connection prior to joining a PAN. A critical path may be created and maintained that includes the critical node and any intervening nodes between the critical node and the root. A critical node may switch PANs when a backhaul connection becomes unavailable. The switch may be facilitated by a node on the critical path other than the critical node. A node may switch PANs and coordinate the switch with its child nodes.Type: ApplicationFiled: May 8, 2018Publication date: November 14, 2019Inventors: James Patrick Hanley, Lawrence Harris, Christopher Scott Hett
-
Publication number: 20190349786Abstract: Systems and methods for managing nodes in mesh networks are provided. A parent node may switch PANs and coordinate the switch with its child nodes. The parent node and its child nodes may maintain timing synchronization information for a current PAN and a new PAN. The parent node and its child nodes may switch to the new PAN using the same switching time.Type: ApplicationFiled: May 8, 2018Publication date: November 14, 2019Inventors: Christopher Scott Hett, Lawrence Harris, Darrell Jefferson, James Patrick Hanley
-
Patent number: 10284338Abstract: Disclosed are various embodiments for optimizing broadcast messaging for a node. The node receives data for a message from the network. While the data for the message is being received and upon completion of an initial portion of the message, the node determines identification information for the message specified in the initial portion. When (i) the identification information specifies that the message is a broadcast message and (ii) an identifier in the message matches a stored identifier of a previously received broadcast message, the node terminates receiving the data for the remainder of the message. Alternatively, when (i) the identification information specifies that the message is a broadcast message and (ii) the identifier in the message does not match any stored identifier of a previously received broadcast message, the node continues receiving data for the subsequent portion of the message and stores the identifier for the broadcast message.Type: GrantFiled: August 30, 2017Date of Patent: May 7, 2019Assignee: Landis+Gyr Innovations, Inc.Inventor: Lawrence Harris
-
Publication number: 20190068330Abstract: Disclosed are various embodiments for optimizing broadcast messaging for a node. The node receives data for a message from the network. While the data for the message is being received and upon completion of an initial portion of the message, the node determines identification information for the message specified in the initial portion. When (i) the identification information specifies that the message is a broadcast message and (ii) an identifier in the message matches a stored identifier of a previously received broadcast message, the node terminates receiving the data for the remainder of the message. Alternatively, when (i) the identification information specifies that the message is a broadcast message and (ii) the identifier in the message does not match any stored identifier of a previously received broadcast message, the node continues receiving data for the subsequent portion of the message and stores the identifier for the broadcast message.Type: ApplicationFiled: August 30, 2017Publication date: February 28, 2019Inventor: Lawrence Harris
-
Patent number: 8806495Abstract: Described is a technology by which alternative use for transactional memory is provided, namely implementing atomic work items that are run asynchronously from their creation in a thread. Described are mechanisms by which threads control the work items that they have created. Atomic work items are scheduled on worker threads managed by the language's runtime system. Atomic work items can use retry to express condition synchronization, providing a general mechanism for controlling when and in what order they are executed. Work items may be grouped, with coordination managed among the grouped work items. Also described by way of example is a highly-parallel implementation of a Chaff satisfiability solver, comprising an example of an important group of applications, including theorem provers and constraint optimization systems.Type: GrantFiled: June 29, 2007Date of Patent: August 12, 2014Assignee: Microsoft Corp.Inventors: James R. Larus, Timothy Lawrence Harris, Virendra Jayant Marathe
-
Patent number: 8799882Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: August 5, 2014Assignee: Microsoft CorporationInventors: David Read Tarditi, Jr., Timothy Lawrence Harris, Mark Ronald Plesko, Avraham E. Shinnar
-
Patent number: 8266609Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: September 11, 2012Assignee: Microsoft CorporationInventor: Timothy Lawrence Harris
-
Patent number: 8266604Abstract: Transactional memory compatibility type attributes are associated with intermediate language code to specify, for example, that intermediate language code must be run within a transaction, or must not be run within a transaction, or may be run within a transaction. Attributes are automatically produced while generating intermediate language code from annotated source code. Default rules also generate attributes. Tools use attributes to statically or dynamically check for incompatibility between intermediate language code and a transactional memory implementation.Type: GrantFiled: January 26, 2009Date of Patent: September 11, 2012Assignee: Microsoft CorporationInventors: Dana Groff, Yosseff Levanoni, Stephen Toub, Michael McKenzie Magruder, Weirong Zhu, Timothy Lawrence Harris, Christopher William Dern, John Joseph Duffy, David Detlefs, Martin Abadi, Sukhdeep Singh Sodhi, Lingli Zhang, Alexander Dadiomov, Vinod Grover
-
Patent number: 8099726Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: January 17, 2012Assignee: Microsoft CorporationInventor: Timothy Lawrence Harris
-
Patent number: 7908255Abstract: Various technologies and techniques are disclosed that support buffered writes and enforced serialization order in a software transactional memory system. A buffered write process is provided that performs writes to shadow copies of objects and writes content back to the objects after validating a respective transaction during commit. When a write lock is first obtained for a particular transaction, a shadow copy is made of a particular object. Writes are performed to and reads from the shadow copy. After validating the particular transaction during commit, content is written from the shadow copy to the particular object. A transaction ordering process is provided that ensures that an order in which the transactions are committed matches an abstract serialization order of the transactions. Transactions are not allowed to commit until their ticket number matches a global number that tracks the next transaction that should commit.Type: GrantFiled: April 11, 2007Date of Patent: March 15, 2011Assignee: Microsoft CorporationInventors: David Detlefs, John Joseph Duffy, Michael M Magruder, Goetz Graefe, Vinod K Grover, Timothy Lawrence Harris
-
Patent number: 7810085Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: October 5, 2010Assignee: Microsoft CorporationInventors: Avraham E. Shinnar, Timothy Lawrence Harris, David Read Tarditi, Jr., Mark Ronald Plesko
-
Publication number: 20100191930Abstract: Transactional memory compatibility type attributes are associated with intermediate language code to specify, for example, that intermediate language code must be run within a transaction, or must not be run within a transaction, or may be run within a transaction. Attributes are automatically produced while generating intermediate language code from annotated source code. Default rules also generate attributes. Tools use attributes to statically or dynamically check for incompatibility between intermediate language code and a transactional memory implementation.Type: ApplicationFiled: January 26, 2009Publication date: July 29, 2010Applicant: MICROSOFT CORPORATIONInventors: Dana Groff, Yosseff Levanoni, Stephen Toub, Michael McKenzie Magruder, Weirong Zhu, Timothy Lawrence Harris, Christopher William Dern, John Joseph Duffy, David Detlefs, Martin Abadi, Sukhdeep Singh Sodhi, Lingli Zhang, Alexander Dadiomov, Vinod Grover
-
Patent number: 7747565Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: June 29, 2010Assignee: Microsoft CorporationInventors: Timothy Lawrence Harris, David Luke Detlefs
-
Patent number: 7590806Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: September 15, 2009Assignee: Microsoft CorporationInventors: Timothy Lawrence Harris, Mark Ronald Plesko
-
Patent number: 7555619Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.Type: GrantFiled: March 23, 2006Date of Patent: June 30, 2009Assignee: Microsoft CorporationInventor: Timothy Lawrence Harris
-
Publication number: 20080256073Abstract: Various technologies and techniques are disclosed that support buffered writes and enforced serialization order in a software transactional memory system. A buffered write process is provided that performs writes to shadow copies of objects and writes content back to the objects after validating a respective transaction during commit. When a write lock is first obtained for a particular transaction, a shadow copy is made of a particular object. Writes are performed to and reads from the shadow copy. After validating the particular transaction during commit, content is written from the shadow copy to the particular object. A transaction ordering process is provided that ensures that an order in which the transactions are committed matches an abstract serialization order of the transactions. Transactions are not allowed to commit until their ticket number matches a global number that tracks the next transaction that should commit.Type: ApplicationFiled: April 11, 2007Publication date: October 16, 2008Applicant: Microsoft CorporationInventors: David Detlefs, John Joseph Duffy, Michael M. Magruder, Goetz Graefe, Vinod K. Grover, Timothy Lawrence Harris
-
Publication number: 20080120455Abstract: Described is a technology by which alternative use for transactional memory is provided, namely implementing atomic work items that are run asynchronously from their creation in a thread. Described are mechanisms by which threads control the work items that they have created. Atomic work items are scheduled on worker threads managed by the language's runtime system. Atomic work items can use retry to express condition synchronization, providing a general mechanism for controlling when and in what order they are executed. Work items may be grouped, with coordination managed among the grouped work items. Also described by way of example is a highly-parallel implementation of a Chaff satisfiability solver, comprising an example of an important group of applications, including theorem provers and constraint optimization systems.Type: ApplicationFiled: June 29, 2007Publication date: May 22, 2008Applicant: Microsoft CorporationInventors: James R. Larus, Timothy Lawrence Harris, Virendra Jayant Marathe
-
Publication number: 20020144815Abstract: The present invention provides a down-hole tool guide apparatus 6 suitable for use in controlling movement of a down-hole apparatus 1 provided with a pressurised working fluid supply in a borehole P. The apparatus comprises: a body 7 having a chamber 13 in which is slidably mounted a piston 14. A high pressure end 13a of the chamber 13 is connected 36 to the pressurised working fluid supply 10 for supplying pressurised working fluid to a high pressure side 32 of said piston 14. A low pressure end 13b of the chamber 13 is connected with the outside of the guide apparatus 6 and is provided with a spring 16 for applying a biasing force to the low pressure side 17 of the piston 14 corresponding to a predetermined threshold pressure of the pressurised fluid supply at the high pressure side of the piston 14. The body 7 mounts at least one shoe 25 having an engagement face 26.Type: ApplicationFiled: March 4, 2002Publication date: October 10, 2002Inventors: Hector F.A. Van Drentham-Susman, Gary Lawrence Harris, Kenneth Roderick Stewart
-
Patent number: D558607Type: GrantFiled: March 28, 2007Date of Patent: January 1, 2008Inventor: Ronald Lawrence Harris