Patents Assigned to Appistry, Inc.
-
Patent number: 10355911Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed processing of processing jobs. A request handler can receive service requests for processing jobs, process handlers can identify tasks to be performed in connection with the processing jobs, and task handlers can perform the identified tasks, where the request handler, the process handlers, and the task handlers can be distributed across a plurality of networked computers.Type: GrantFiled: May 14, 2018Date of Patent: July 16, 2019Assignee: APPISTRY, INC.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Patent number: 9049267Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed processing of processing jobs. A request handler can receive service requests for processing jobs, process handlers can identify tasks to be performed in connection with the processing jobs, and task handlers can perform the identified tasks, where the request handler, the process handlers, and the task handlers can be distributed across a plurality of networked computers.Type: GrantFiled: February 10, 2014Date of Patent: June 2, 2015Assignee: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Publication number: 20140156722Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed processing of processing jobs. A request handler can receive service requests for processing jobs, process handlers can identify tasks to be performed in connection with the processing jobs, and task handlers can perform the identified tasks, where the request handler, the process handlers, and the task handlers can be distributed across a plurality of networked computers.Type: ApplicationFiled: February 10, 2014Publication date: June 5, 2014Applicant: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Patent number: 8682959Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed and fault-tolerant processing of processing jobs. A request handler can receive service requests for processing jobs, process handlers can identify tasks to be performed in connection with the processing jobs, and task handlers can perform the identified tasks, where the request handler, the process handlers, and the task handlers can be distributed across a plurality of networked computers.Type: GrantFiled: December 7, 2012Date of Patent: March 25, 2014Assignee: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Publication number: 20130144933Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed and fault-tolerant processing of processing jobs.Type: ApplicationFiled: December 7, 2012Publication date: June 6, 2013Applicant: APPISTRY, INC.Inventor: Appistry, Inc
-
Patent number: 8341209Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed processing of processing jobs, the processing jobs comprising a process flow, each process flow including (1) a plurality of processing tasks to be performed by task handlers and (2) state information associated with the processing tasks.Type: GrantFiled: June 8, 2012Date of Patent: December 25, 2012Assignee: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Publication number: 20120246216Abstract: Systems and methods for processing information via networked computers leverage request handlers, process handlers, and task handlers to provide efficient distributed processing of processing jobs, the processing jobs comprising a process flow, each process flow including (1) a plurality of processing tasks to be performed by task handlers and (2) state information associated with the processing tasks.Type: ApplicationFiled: June 8, 2012Publication date: September 27, 2012Applicant: APPISTRY, INC.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Patent number: 8200746Abstract: A system and method for processing information leverages territory-based processing capabilities to provide efficient distributed processing of processing jobs. For example, hive engines can be organized into territories based on their physical locations to support the distributed processing of processing jobs within particular territories.Type: GrantFiled: November 10, 2011Date of Patent: June 12, 2012Assignee: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Publication number: 20120059870Abstract: A system and method for processing information leverages territory-based processing capabilities to provide efficient distributed processing of processing jobs. For example, hive engines can be organized into territories based on their physical locations to support the distributed processing of processing jobs within particular territories.Type: ApplicationFiled: November 10, 2011Publication date: March 8, 2012Applicant: APPISTRY, INC.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Patent number: 8060552Abstract: A self-organizing hive of computing engines is used to process information. A network communicatively couples multiple of hive engines together. These hive engines are configured to self-organize into a cooperative hive for performing computing of client jobs, with the cooperative hive including a multiple processing regions and a request region. This self-organization includes self-forming the processing regions and the request region by the hive engines such that each of the hive engines belongs to at least one of the processing regions; and wherein each the request region includes multiple of the plurality of hive engines.Type: GrantFiled: May 27, 2008Date of Patent: November 15, 2011Assignee: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Publication number: 20080263131Abstract: A self-organizing hive of computing engines is used to process information. A network communicatively couples multiple of hive engines together. These hive engines are configured to self-organize into a cooperative hive for performing computing of client jobs, with the cooperative hive including a multiple processing regions and a request region. This self-organization includes self-forming the processing regions and the request region by the hive engines such that each of the hive engines belongs to at least one of the processing regions; and wherein each the request region includes multiple of the plurality of hive engines.Type: ApplicationFiled: May 27, 2008Publication date: October 23, 2008Applicant: APPISTRY, INC., A CORPORATION OF DELAWAREInventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Patent number: 7379959Abstract: A hive of computing engines, typically including request handlers and process handlers, is used to process information. One implementation includes a request region including multiple request handlers and multiple processing regions, each typically including multiple process handlers. Each request handler is configured to respond to a client service request of a processing job, and if identified to handle the processing job: to query one or more of the processing regions to identify and assign a particular process handler to service the processing job, and to receive a processing result from the particular process handler. Each of the process handlers is configured to respond to such a query, and if identified as the particular process handler: to service the processing job, to process the processing job, to update said identified request handler with state information pertaining to partial processing of said processing job, and to communicate the processing result to the identified request handler.Type: GrantFiled: September 7, 2002Date of Patent: May 27, 2008Assignee: Appistry, Inc.Inventors: Aaron Louis Hinni, Guerry Anderson Semones, Michael Scott Groner, Roberto Raul Lozano
-
Patent number: 7363346Abstract: Disclosed are mechanisms for reliably storing information across multiple computers networked together, where each of these computers may or may not be a hive node of a hive. This information includes multiple information units. At least one protection unit is generated based on the information units such that the information can be recreated using less than all of these information units and at least one protection unit. A data unit is defined as one or more information units, one or more protection units, or a combination of information and protection units, with each information unit being included in at least one of the data units and each protection unit being included in at least one of the data units. A operation is initiated to store on each of the computers at least one data unit, such that each data unit is stored in at least one of the computers.Type: GrantFiled: September 30, 2005Date of Patent: April 22, 2008Assignee: Appistry, Inc.Inventors: Michael Scott Groner, Roberto Raul Lozano
-
Publication number: 20070271334Abstract: A hive of computing engines, typically including clients, request handlers, and process handlers, is used to process of a processing job in order to determine a processing result. A client assigns a processing job to a request handler, which assigns the processing job to one or more processing handlers. One implementation uses one or more volunteer operations to identify the request handler, and/or the one or more process handlers. One implementation updates the request handler with state information related to the partial processing of the processing job such that the completion of the processing job can be assigned to other one or more process handlers, such as, but not limited to, in response to a detected error condition.Type: ApplicationFiled: July 30, 2007Publication date: November 22, 2007Applicant: APPISTRY, INC., A DELAWARE CORPORATIONInventors: Aaron Hinni, Guerry Semones, Michael Groner, Roberto Lozano
-
Publication number: 20070271333Abstract: A hive of computing engines, typically including clients, request handlers, process handlers, and task handlers, is used to process of a processing job in order to determine a processing result. A client assigns a processing job to a request handler, which assigns the processing job to a processing handler, which typically assigns one or more tasks of the processing job to one or more task handlers. One implementation uses one or more volunteer operations to identify the request handler, the process handler, and/or one or more task handlers. One implementation updates the request handler and/or the process handler with state information related to the partial processing of the processing job such that the completion of the processing job can be assigned to other process and/or task handlers, such as, but not limited to, in response to a detected error condition.Type: ApplicationFiled: July 30, 2007Publication date: November 22, 2007Applicant: APPISTRY, INC., A DELAWARE CORPORATIONInventors: Aaron Hinni, Guerry Semones, Michael Groner, Roberto Lozano
-
Publication number: 20070011302Abstract: Disclosed are mechanisms for reliably storing information across multiple computers networked together, where each of these computers may or may not be a hive node of a hive. This information includes multiple information units. At least one protection unit is generated based on the information units such that the information can be recreated using less than all of these information units and at least one protection unit. A data unit is defined as one or more information units, one or more protection units, or a combination of information and protection units, with each information unit being included in at least one of the data units and each protection unit being included in at least one of the data units. A operation is initiated to store on each of the computers at least one data unit, such that each data unit is stored in at least one of the computers.Type: ApplicationFiled: September 30, 2005Publication date: January 11, 2007Applicant: APPISTRY, INC. A DELAWARE CORPORATIONInventors: Michael Groner, Roberto Lozano