Patents by Inventor Cameron Purdy
Cameron Purdy 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: 10795865Abstract: A system and method supports key management in a distributed computing environment such as a distributed data grid. A binary radix tree is used to intern a plurality of binary keys. The binary radix tree is serialized to a byte buffer and a view of the binary is created. A byte sequence interface to the nodes of the serialized binary radix tree allows use of references which refer to positions in the serialized binary radix tree instead of requiring byte array copes of the interned keys. Use of references into the byte array in place of a byte array copies of interned keys reduces the memory overhead associated with referrers such as reverse indices which make reference to values associated with the plurality of binary keys. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid.Type: GrantFiled: February 5, 2018Date of Patent: October 6, 2020Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Harvey Raja, Cameron Purdy, Gene Gleyzer
-
Patent number: 10521282Abstract: A system and method for providing a message bus component or version thereof (referred to herein as an implementation), and a messaging application program interface, for use in an enterprise data center, middleware machine system, or similar environment that includes a plurality of processor nodes together with a high-performance communication fabric (or communication mechanism) such as InfiniBand. In accordance with an embodiment, the messaging application program interface enables features such as asynchronous messaging, low latency, and high data throughput, and supports the use of in-memory data grid, application server, and other middleware components.Type: GrantFiled: September 30, 2016Date of Patent: December 31, 2019Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Mark Falco, Patrik Torstensson, Gene Gleyzer, Cameron Purdy
-
Patent number: 10122595Abstract: A system and method is described for use with a data grid cluster, for supporting service level quorum in the data grid cluster. The data grid cluster includes a plurality of cluster nodes that support performing at least one service action. A quorum policy, defined in a cache configuration file associated with the data grid cluster, can specify a minimum number of service members that are required in the data grid cluster for performing the service action. The data grid cluster uses the quorum policy to determine whether the service action is allowed to be performed, based on a present state of the plurality of cluster nodes in the data grid cluster.Type: GrantFiled: December 30, 2015Date of Patent: November 6, 2018Assignee: Orcale International CorporationInventors: Robert H. Lee, Mark Falco, Gene Glezyer, Cameron Purdy
-
Patent number: 10089317Abstract: A system and method can support metadata compression in a distributed data grid. The system can store a plurality of keys in compact data structure (such as a radix tree) in a heap, wherein each said key is associated with an entry in a journal off-heap. Furthermore, the system can look up the tree for a key, wherein the key is associated with a journal ticket that represents a virtual address of an entry in the journal. Then, the system can use the journal ticket to manage the entry in the journal that is associated with said key.Type: GrantFiled: May 31, 2017Date of Patent: October 2, 2018Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Robert H. Lee, Harold Cameron Purdy, Gene Gleyzer, Harvey Raja
-
Publication number: 20180181590Abstract: A system and method supports key management in a distributed computing environment such as a distributed data grid. A binary radix tree is used to intern a plurality of binary keys. The binary radix tree is serialized to a byte buffer and a view of the binary is created. A byte sequence interface to the nodes of the serialized binary radix tree allows use of references which refer to positions in the serialized binary radix tree instead of requiring byte array copes of the interned keys. Use of references into the byte array in place of a byte array copies of interned keys reduces the memory overhead associated with referrers such as reverse indices which make reference to values associated with the plurality of binary keys. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid.Type: ApplicationFiled: February 5, 2018Publication date: June 28, 2018Inventors: HARVEY RAJA, CAMERON PURDY, GENE GLEYZER
-
Patent number: 9934246Abstract: A system and method support a reference store in a distributed computing environment such as a distributed data grid. The system associates a ticket with the reference store, wherein the reference store contains a plurality of references. Furthermore, the system uses the ticket to expose the reference store to one or more consumers in the distributed computing environment. The reference store type is selected in response to the number of references required to be stored and access overhead. Each reference store can be inflated or deflated according to the number of references it contains. Selection of different reference store types allows for reduced memory overhead while still providing acceptable reference retrieval times. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid.Type: GrantFiled: September 25, 2015Date of Patent: April 3, 2018Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Harvey Raja, Cameron Purdy, Gene Gleyzer
-
Patent number: 9886450Abstract: A system and method supports key management in a distributed computing environment such as a distributed data grid. A binary radix tree is used to intern a plurality of binary keys. The binary radix tree is serialized to a byte buffer and a view of the binary is created. A byte sequence interface to the nodes of the serialized binary radix tree allows use of references which refer to positions in the serialized binary radix tree instead of requiring byte array copes of the interned keys. Use of references into the byte array in place of a byte array copies of interned keys reduces the memory overhead associated with referrers such as reverse indices which make reference to values associated with the plurality of binary keys. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid.Type: GrantFiled: September 25, 2015Date of Patent: February 6, 2018Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Harvey Raja, Cameron Purdy, Gene Gleyzer
-
Publication number: 20170262464Abstract: A system and method can support metadata compression in a distributed data grid. The system can store a plurality of keys in compact data structure (such as a radix tree) in a heap, wherein each said key is associated with an entry in a journal off-heap. Furthermore, the system can look up the tree for a key, wherein the key is associated with a journal ticket that represents a virtual address of an entry in the journal. Then, the system can use the journal ticket to manage the entry in the journal that is associated with said key.Type: ApplicationFiled: May 31, 2017Publication date: September 14, 2017Inventors: ROBERT H. LEE, HAROLD CAMERON PURDY, GENE GLEYZER, HARVEY RAJA
-
Patent number: 9703610Abstract: A centralized resource distribution is described where the decision portion of partitioning data among cluster nodes is made centralized while the actual mechanics to implement the partitioning remain a distributed algorithm. A central distribution coordinator is used to create an extensible central strategy that controls how the data will be partitioned across the cluster. The work to implement this strategy is performed by all of the members individually and asynchronously, in accordance with a distributed algorithm. The central strategy can be communicated to all cluster members and each member can perform the partitioning as it relates to itself. For example, in accordance with the distributed algorithm, one node may decide that it needs to obtain a particular partition in light of the central strategy and carry out the necessary steps to obtain that data, while other nodes may be asynchronously performing other individual partition transfers relevant to those particular nodes.Type: GrantFiled: September 21, 2011Date of Patent: July 11, 2017Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Robert Lee, Gene Gleyzer, Mark Falco, Cameron Purdy
-
Patent number: 9697220Abstract: A system and method can support metadata compression in a distributed data grid. The system can store a plurality of keys in compact data structure (such as a radix tree) in a heap, wherein each said key is associated with an entry in a journal off-heap. Furthermore, the system can look up the tree for a key, wherein the key is associated with a journal ticket that represents a virtual address of an entry in the journal. Then, the system can use the journal ticket to manage the entry in the journal that is associated with said key.Type: GrantFiled: July 2, 2014Date of Patent: July 4, 2017Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Robert H. Lee, Harold Cameron Purdy, Gene Gleyzer, Harvey Raja
-
Publication number: 20170017532Abstract: A system and method for providing a message bus component or version thereof (referred to herein as an implementation), and a messaging application program interface, for use in an enterprise data center, middleware machine system, or similar environment that includes a plurality of processor nodes together with a high-performance communication fabric (or communication mechanism) such as InfiniBand. In accordance with an embodiment, the messaging application program interface enables features such as asynchronous messaging, low latency, and high data throughput, and supports the use of in-memory data grid, application server, and other middleware components.Type: ApplicationFiled: September 30, 2016Publication date: January 19, 2017Inventors: Mark Falco, Patrik Torstensson, Gene Gleyzer, Cameron Purdy
-
Patent number: 9477536Abstract: A system and method for providing a message bus component or version thereof (referred to herein as an implementation), and a messaging application program interface, for use in an enterprise data center, middleware machine system, or similar environment that includes a plurality of processor nodes together with a high-performance communication fabric (or communication mechanism) such as InfiniBand. In accordance with an embodiment, the messaging application program interface enables features such as asynchronous messaging, low latency, and high data throughput, and supports the use of in-memory data grid, application server, and other middleware components.Type: GrantFiled: May 16, 2012Date of Patent: October 25, 2016Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Mark Falco, Patrik Torstensson, Gene Gleyzer, Cameron Purdy
-
Publication number: 20160119197Abstract: A system and method is described for use with a data grid cluster, for supporting service level quorum in the data grid cluster. The data grid cluster includes a plurality of cluster nodes that support performing at least one service action. A quorum policy, defined in a cache configuration file associated with the data grid cluster, can specify a minimum number of service members that are required in the data grid cluster for performing the service action. The data grid cluster uses the quorum policy to determine whether the service action is allowed to be performed, based on a present state of the plurality of cluster nodes in the data grid cluster.Type: ApplicationFiled: December 30, 2015Publication date: April 28, 2016Inventors: Robert H. Lee, Mark Falco, Gene Glezyer, Cameron Purdy
-
Publication number: 20160092466Abstract: A system and method supports key management in a distributed computing environment such as a distributed data grid. A binary radix tree is used to intern a plurality of binary keys. The binary radix tree is serialized to a byte buffer and a view of the binary is created. A byte sequence interface to the nodes of the serialized binary radix tree allows use of references which refer to positions in the serialized binary radix tree instead of requiring byte array copes of the interned keys. Use of references into the byte array in place of a byte array copies of interned keys reduces the memory overhead associated with referrers such as reverse indices which make reference to values associated with the plurality of binary keys. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid.Type: ApplicationFiled: September 25, 2015Publication date: March 31, 2016Inventors: HARVEY RAJA, CAMERON PURDY, GENE GLEYZER
-
Publication number: 20160092483Abstract: A system and method support a reference store in a distributed computing environment such as a distributed data grid. The system associates a ticket with the reference store, wherein the reference store contains a plurality of references. Furthermore, the system uses the ticket to expose the reference store to one or more consumers in the distributed computing environment. The reference store type is selected in response to the number of references required to be stored and access overhead. Each reference store can be inflated or deflated according to the number of references it contains. Selection of different reference store types allows for reduced memory overhead while still providing acceptable reference retrieval times. The reduction in memory overhead enhances performance and capabilities of a distributed computing environment such as a distributed data grid.Type: ApplicationFiled: September 25, 2015Publication date: March 31, 2016Inventors: HARVEY RAJA, CAMERON PURDY, GENE GLEYZER
-
Patent number: 9262229Abstract: A system and method is described for use with a data grid cluster, for supporting service level quorum in the data grid cluster. The data grid cluster includes a plurality of cluster nodes that support performing at least one service action. A quorum policy, defined in a cache configuration file associated with the data grid cluster, can specify a minimum number of service members that are required in the data grid cluster for performing the service action. The data grid cluster uses the quorum policy to determine whether the service action is allowed to be performed, based on a present state of the plurality of cluster nodes in the data grid cluster.Type: GrantFiled: January 17, 2012Date of Patent: February 16, 2016Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Robert H. Lee, Mark Falco, Gene Gleyzer, Cameron Purdy
-
Patent number: 9063787Abstract: A system and method is described for use with a data grid cluster, which uses cluster quorum to prevent split brain scenario. The data grid cluster includes a plurality of cluster nodes, each of which runs a cluster service. Each cluster service collects and maintains statistics regarding communication flow between its cluster node and the other cluster nodes in the data grid cluster. The statistics are used to determine a status associated with other cluster nodes in the data grid cluster whenever a disconnect event happens. The data grid cluster is associated with a quorum policy, which is defined in a cache configuration file, and which specifies a time period that a cluster node will wait before making a decision on whether or not to evict one or more cluster nodes from the data grid cluster.Type: GrantFiled: January 17, 2012Date of Patent: June 23, 2015Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Robert H. Lee, Mark Falco, Gene Gleyzer, Cameron Purdy
-
Patent number: 9063852Abstract: A system and method is described for use with a data grid cluster to support death detection. A network ring is formed by connecting a plurality of process nodes in the data grid, wherein each node in the network ring watches another node. A death of a first process node in the network ring can be detected by a second process node, when the second process node notices that its connection to the first process node has closed. The first process node then informs other process cluster nodes in the network ring that the first node is dead. In accordance with an embodiment, machine level death detection can also be supported in the data grid cluster by using an Internet Protocol (IP) monitor.Type: GrantFiled: January 17, 2012Date of Patent: June 23, 2015Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Mark Falco, Robert H. Lee, Harvey Eneman, Gene Gleyzer, Cameron Purdy, Alex Gleyzer
-
Publication number: 20150169610Abstract: A system and method can support metadata compression in a distributed data grid. The system can store a plurality of keys in compact data structure (such as a radix tree) in a heap, wherein each said key is associated with an entry in a journal off-heap. Furthermore, the system can look up the tree for a key, wherein the key is associated with a journal ticket that represents a virtual address of an entry in the journal. Then, the system can use the journal ticket to manage the entry in the journal that is associated with said key.Type: ApplicationFiled: July 2, 2014Publication date: June 18, 2015Inventors: Robert H. Lee, Harold Cameron Purdy, Gene Gleyzer
-
Patent number: 8983876Abstract: A system and method is described for use with a data grid cluster, which uses cluster quorum to prevent split brain scenario. The data grid cluster includes a plurality of cluster nodes, each of which runs a cluster service. Each cluster service collects and maintains statistics regarding communication flow between its cluster node and the other cluster nodes in the data grid cluster. The statistics are used to determine a status associated with other cluster nodes in the data grid cluster whenever a disconnect event happens. The data grid cluster is associated with a quorum policy, which is defined in a cache configuration file, and which specifies a time period that a cluster node will wait before making a decision on whether or not to evict one or more cluster nodes from the data grid cluster.Type: GrantFiled: January 17, 2012Date of Patent: March 17, 2015Assignee: Oracle International CorporationInventors: Robert H. Lee, Mark Falco, Gene Gleyzer, Cameron Purdy