Patents by Inventor Luca Castellano
Luca Castellano 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: 20240160593Abstract: A processor includes a synchronous circuit including a plurality of processing stages, wherein each processing stage includes a selection data bus; and an asynchronous circuit coupled to each selection data bus, wherein the asynchronous circuit includes an asynchronous state machine whose states correspond to a process phase or a plurality of circuits, wherein the asynchronous circuit further includes a selectable delay circuit whose delay is determined by a present state of the asynchronous state machine, and wherein the asynchronous circuit is configured for generating a plurality of processing stage clock signals each having a selectable delay provided by the selectable delay circuit.Type: ApplicationFiled: November 16, 2022Publication date: May 16, 2024Inventors: Marco Castellano, Francesco Bruni, Luca Gandolfi, Marco Leo
-
Patent number: 11010206Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.Type: GrantFiled: February 11, 2019Date of Patent: May 18, 2021Assignee: VMware, Inc.Inventor: Luca Castellano
-
Patent number: 10552228Abstract: Techniques disclosed herein provide an approach for assigning resource consumers to available resources. In one embodiment, components of a distributed scheduler are organized into a hierarchy, such as a tree. A placement request received at a root scheduler of the hierarchy is propagated down the hierarchy, either to all children or to randomly selected subsets of children of each scheduler in the hierarchy. Leaf schedulers in the hierarchy that receive the request each propagate back up a score indicating the amount of free resources in its corresponding resource bucket. Branch schedulers then compare scores that they receive, and each further propagate one of the received scores, such as the highest score, based on the comparison, until the root scheduler is reached. The root scheduler makes an additional comparison and returns one of the resource buckets in response to the received placement request.Type: GrantFiled: June 20, 2016Date of Patent: February 4, 2020Assignee: VMware, Inc.Inventors: Vadim Spivak, Amar Padmanabhan, Anfernee Yongkun Gui, Badhri Sampathkumar, Luca Castellano, Maithem Munshed, Michi Mutsuzaki, Vui Chiap Lam
-
Publication number: 20190188051Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.Type: ApplicationFiled: February 11, 2019Publication date: June 20, 2019Inventor: Luca Castellano
-
Patent number: 10235212Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.Type: GrantFiled: October 30, 2017Date of Patent: March 19, 2019Assignee: VMware, Inc.Inventor: Luca Castellano
-
Publication number: 20180060137Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.Type: ApplicationFiled: October 30, 2017Publication date: March 1, 2018Inventor: Luca CASTELLANO
-
Publication number: 20170364392Abstract: Techniques disclosed herein provide an approach for assigning resource consumers to available resources. In one embodiment, components of a distributed scheduler are organized into a hierarchy, such as a tree. A placement request received at a root scheduler of the hierarchy is propagated down the hierarchy, either to all children or to randomly selected subsets of children of each scheduler in the hierarchy. Leaf schedulers in the hierarchy that receive the request each propagate back up a score indicating the amount of free resources in its corresponding resource bucket. Branch schedulers then compare scores that they receive, and each further propagate one of the received scores, such as the highest score, based on the comparison, until the root scheduler is reached. The root scheduler makes an additional comparison and returns one of the resource buckets in response to the received placement request.Type: ApplicationFiled: June 20, 2016Publication date: December 21, 2017Inventors: Vadim SPIVAK, Amar PADMANABHAN, Anfernee Yongkun GUI, Badhri SAMPATHKUMAR, Luca CASTELLANO, Maithem MUNSHED, Michi MUTSUZAKI, Vui Chiap LAM
-
Patent number: 9804895Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.Type: GrantFiled: December 31, 2015Date of Patent: October 31, 2017Assignee: VMware, Inc.Inventor: Luca Castellano
-
Publication number: 20170060642Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.Type: ApplicationFiled: December 31, 2015Publication date: March 2, 2017Inventor: Luca CASTELLANO
-
Publication number: 20170031790Abstract: A system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain. In addition, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.Type: ApplicationFiled: August 2, 2016Publication date: February 2, 2017Inventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Raghu Mallena
-
Patent number: 9405640Abstract: A system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain. In addition, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.Type: GrantFiled: May 27, 2014Date of Patent: August 2, 2016Assignee: SONY INTERACTIVE ENTERTAINMENT AMERICA LLCInventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Raghu Mallena
-
Publication number: 20150356133Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.Type: ApplicationFiled: August 7, 2015Publication date: December 10, 2015Inventor: Luca Castellano
-
Patent number: 9189513Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.Type: GrantFiled: August 7, 2015Date of Patent: November 17, 2015Assignee: VMware, Inc.Inventor: Luca Castellano
-
Patent number: 9135287Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.Type: GrantFiled: April 21, 2015Date of Patent: September 15, 2015Assignee: VMware, Inc.Inventor: Luca Castellano
-
Publication number: 20150227573Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.Type: ApplicationFiled: April 21, 2015Publication date: August 13, 2015Inventor: Luca Castellano
-
Patent number: 9037556Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.Type: GrantFiled: December 3, 2012Date of Patent: May 19, 2015Assignee: VMware, Inc.Inventor: Luca Castellano
-
Publication number: 20140281675Abstract: A system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain. In addition, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.Type: ApplicationFiled: May 27, 2014Publication date: September 18, 2014Applicant: Sony Computer Entertainment America LLCInventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Raghu Mallena
-
Patent number: 8769132Abstract: A system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain. In addition, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.Type: GrantFiled: September 27, 2010Date of Patent: July 1, 2014Assignee: Sony Computer Entertainment America LLCInventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert D. Bradshaw, Jr., Luca Castellano, Raghu Mallena
-
Publication number: 20140156618Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.Type: ApplicationFiled: December 3, 2012Publication date: June 5, 2014Applicant: VMWARE, INC.Inventor: Luca Castellano
-
Publication number: 20110214007Abstract: A system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain. In addition, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.Type: ApplicationFiled: September 27, 2010Publication date: September 1, 2011Applicant: Silicon Graphics, Inc.Inventors: Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert David Bradshaw, Luca Castellano, Raghu Mallena