Patents by Inventor Samir SEBBAH
Samir SEBBAH 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: 11256578Abstract: Techniques for determining one or more replication paths for resources in different failure domains, while maintaining a target resiliency level, are disclosed. A replication path is a sequence of at least a subset of the set of resources. Based on the sequence, a resource is selected for replicating at least a portion of the resource consumers corresponding to each of the subset of resources. A replication path may be determined by adding a resource to the replication path and/or replacing one resource with another resource to modify the replication path. The modified replication path maintains the target resiliency level if the modified replication path does not include any loop of a length less than or equal to the target resiliency level.Type: GrantFiled: April 22, 2020Date of Patent: February 22, 2022Assignee: Oracle International CorporationInventors: Samir Sebbah, Claire M. Bagley
-
Publication number: 20200250048Abstract: Techniques for determining one or more replication paths for resources in different failure domains, while maintaining a target resiliency level, are disclosed. A replication path is a sequence of at least a subset of the set of resources. Based on the sequence, a resource is selected for replicating at least a portion of the resource consumers corresponding to each of the subset of resources. A replication path may be determined by adding a resource to the replication path and/or replacing one resource with another resource to modify the replication path. The modified replication path maintains the target resiliency level if the modified replication path does not include any loop of a length less than or equal to the target resiliency level.Type: ApplicationFiled: April 22, 2020Publication date: August 6, 2020Applicant: Oracle International CorporationInventors: Samir Sebbah, Claire M. Bagley
-
Patent number: 10664359Abstract: Techniques for determining one or more replication paths for resources in different failure domains, while maintaining a target resiliency level, are disclosed. A replication path is a sequence of at least a subset of the set of resources. Based on the sequence, a resource is selected for replicating at least a portion of the resource consumers corresponding to each of the subset of resources. A replication path may be determined by adding a resource to the replication path and/or replacing one resource with another resource to modify the replication path. The modified replication path maintains the target resiliency level if the modified replication path does not include any loop of a length less than or equal to the target resiliency level.Type: GrantFiled: January 26, 2018Date of Patent: May 26, 2020Assignee: Oracle International CorporationInventors: Samir Sebbah, Claire M. Bagley
-
Patent number: 10296227Abstract: Systems, methods, and other embodiments are disclosed that use constraint programming to dynamically distribute cache throughout a data grid. In one embodiment, modeling logic is configured to generate a constraint programming model based at least in part on a set of constraints that limits assignment of a plurality of data partitions to a plurality of virtual machines hosted on a plurality of physical machines in a data grid. Solver logic is configured to generate at least one solution for assigning the plurality of data partitions to the plurality of virtual machines by operating on the constraint programming model using constraint programming techniques.Type: GrantFiled: August 18, 2015Date of Patent: May 21, 2019Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Samir Sebbah, Claire M. Bagley, Michael P. Colena, Gene Gleyzer
-
Patent number: 10248550Abstract: Techniques for selecting test configurations associated with a particular coverage strength using a constraint solver are disclosed. A set of parameters are configurable for conducting a test on a particular target application. A data model generator identifies one or more candidate test configurations based on the set of parameters. The data model generator determines a set of interactions based on a desired coverage strength. The data model generator specifies a selection variable indicating the candidate test configurations that are selected for testing the particular target application. The data model generator specifies constraint(s) minimizing the number of selected test configurations. The data model generator specifies constraint(s) requiring that each interaction be covered by at least one selected test configuration.Type: GrantFiled: September 25, 2017Date of Patent: April 2, 2019Assignee: Oracle International CorporationInventors: Serdar Kadioglu, Samir Sebbah
-
Patent number: 10104170Abstract: A system and method of assigning resource consumers to resources using constraint programming is disclosed. The resource consumers are to be assigned to the resources in a way that achieves one or more particular objectives, such as resiliency, load balancing, and network embedding criteria. A data model, for application to a constraint programming solver, formulates the assignment problem as a set of constraints for a solution to be found. The data model includes a first set of data model elements corresponding to pairs of resources, each pair having two resources in different failure domains. The data model includes a second set of data model elements corresponding to the resource consumers. The data model includes a constraint that limits assignment of the resource consumers to the resources to: assigning the resource consumers respectively to the pairs of resources.Type: GrantFiled: January 5, 2016Date of Patent: October 16, 2018Assignee: Oracle International CorporationInventors: Samir Sebbah, Michael Colena
-
Patent number: 10007538Abstract: Techniques for assigning applications to virtual machines (VMs) using constraint programming are disclosed. The applications are associated with application groups. The assignment problem requires that each application of a particular application group be assigned to a VM hosted by a same machine. A data model, for application to a constraint programming solver, formulates the assignment problem as a set of constraints for a solution to be found. The data model includes a set of data model elements corresponding to the applications to be processed. The data model includes a set of data model elements corresponding to the VMs. The data model includes a set of constraints that limits assignment of any particular application to a VM corresponding to a tenant associated with the particular application. The set of constraints further limits assignment of applications corresponding to a same application group to VMs executing on a same machine.Type: GrantFiled: July 15, 2016Date of Patent: June 26, 2018Assignee: Oracle International CorporationInventors: Serdar Kadioglu, Michael Colena, Samir Sebbah, Mirza Mohsin Beg
-
Publication number: 20180173605Abstract: Techniques for selecting test configurations associated with a particular coverage strength using a constraint solver are disclosed. A set of parameters are configurable for conducting a test on a particular target application. A data model generator identifies one or more candidate test configurations based on the set of parameters. The data model generator determines a set of interactions based on a desired coverage strength. The data model generator specifies a selection variable indicating the candidate test configurations that are selected for testing the particular target application. The data model generator specifies constraint(s) minimizing the number of selected test configurations. The data model generator specifies constraint(s) requiring that each interaction be covered by at least one selected test configuration.Type: ApplicationFiled: September 25, 2017Publication date: June 21, 2018Applicant: Oracle International CorporationInventors: Serdar Kadioglu, Samir Sebbah
-
Publication number: 20180165160Abstract: Techniques for determining one or more replication paths for resources in different failure domains, while maintaining a target resiliency level, are disclosed. A replication path is a sequence of at least a subset of the set of resources. Based on the sequence, a resource is selected for replicating at least a portion of the resource consumers corresponding to each of the subset of resources. A replication path may be determined by adding a resource to the replication path and/or replacing one resource with another resource to modify the replication path. The modified replication path maintains the target resiliency level if the modified replication path does not include any loop of a length less than or equal to the target resiliency level.Type: ApplicationFiled: January 26, 2018Publication date: June 14, 2018Applicant: Oracle International CorporationInventors: Samir Sebbah, Claire M. Bagley
-
Patent number: 9916208Abstract: Techniques for determining one or more replication paths for resources in different failure domains, while maintaining a target resiliency level, are disclosed. A replication path is a sequence of at least a subset of the set of resources. Based on the sequence, a resource is selected for replicating at least a portion of the resource consumers corresponding to each of the subset of resources. A replication path may be determined by adding a resource to the replication path and/or replacing one resource with another resource to modify the replication path. The modified replication path maintains the target resiliency level if the modified replication path does not include any loop of a length less than or equal to the target resiliency level.Type: GrantFiled: January 21, 2016Date of Patent: March 13, 2018Assignee: Oracle International CorporationInventors: Samir Sebbah, Claire M. Bagley
-
Publication number: 20170220364Abstract: Techniques for assigning applications to virtual machines (VMs) using constraint programming are disclosed. The applications are associated with application groups. The assignment problem requires that each application of a particular application group be assigned to a VM hosted by a same machine. A data model, for application to a constraint programming solver, formulates the assignment problem as a set of constraints for a solution to be found. The data model includes a set of data model elements corresponding to the applications to be processed. The data model includes a set of data model elements corresponding to the VMs. The data model includes a set of constraints that limits assignment of any particular application to a VM corresponding to a tenant associated with the particular application. The set of constraints further limits assignment of applications corresponding to a same application group to VMs executing on a same machine.Type: ApplicationFiled: July 15, 2016Publication date: August 3, 2017Applicant: Oracle International CorporationInventors: Serdar Kadioglu, Michael Colena, Samir Sebbah, Mirza Mohsin Beg
-
Publication number: 20170212809Abstract: Techniques for determining one or more replication paths for resources in different failure domains, while maintaining a target resiliency level, are disclosed. A replication path is a sequence of at least a subset of the set of resources. Based on the sequence, a resource is selected for replicating at least a portion of the resource consumers corresponding to each of the subset of resources. A replication path may be determined by adding a resource to the replication path and/or replacing one resource with another resource to modify the replication path. The modified replication path maintains the target resiliency level if the modified replication path does not include any loop of a length less than or equal to the target resiliency level.Type: ApplicationFiled: January 21, 2016Publication date: July 27, 2017Inventors: Samir Sebbah, Claire M. Bagley
-
Publication number: 20170195410Abstract: A system and method of assigning resource consumers to resources using constraint programming is disclosed. The resource consumers are to be assigned to the resources in a way that achieves one or more particular objectives, such as resiliency, load balancing, and network embedding criteria. A data model, for application to a constraint programming solver, formulates the assignment problem as a set of constraints for a solution to be found. The data model includes a first set of data model elements corresponding to pairs of resources, each pair having two resources in different failure domains. The data model includes a second set of data model elements corresponding to the resource consumers. The data model includes a constraint that limits assignment of the resource consumers to the resources to: assigning the resource consumers respectively to the pairs of resources.Type: ApplicationFiled: January 5, 2016Publication date: July 6, 2017Inventors: Samir Sebbah, Michael Colena
-
Publication number: 20170052712Abstract: Systems, methods, and other embodiments are disclosed that use constraint programming to dynamically distribute cache throughout a data grid. In one embodiment, modeling logic is configured to generate a constraint programming model based at least in part on a set of constraints that limits assignment of a plurality of data partitions to a plurality of virtual machines hosted on a plurality of physical machines in a data grid. Solver logic is configured to generate at least one solution for assigning the plurality of data partitions to the plurality of virtual machines by operating on the constraint programming model using constraint programming techniques.Type: ApplicationFiled: August 18, 2015Publication date: February 23, 2017Inventors: Samir SEBBAH, Claire M. BAGLEY, Michael P. COLENA, Gene GLEYZER