Patents by Inventor Paolo Deidda

Paolo Deidda 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: 8185902
    Abstract: Method and system for providing a mechanism for determining an optimal workload distribution, from a plurality of candidate workload distributions, each of which has been determined to optimize a particular aspect of a workload-scheduling problem. More particularly, the preferred embodiment determines a workload distribution based on resource selection policies. From this workload distribution, the preferred embodiment optionally determines a workload distribution based on job priorities. From either or both of the above parameters, the preferred embodiment determines a workload distribution based on a total prioritized weight parameter. The preferred embodiment also determines a workload distribution which attempts to match the previously determined candidate workload distributions to a goal distribution. Similarly, the preferred embodiment calculates a further workload distribution which attempts to maximize job throughput.
    Type: Grant
    Filed: August 31, 2008
    Date of Patent: May 22, 2012
    Assignee: International Business Machines Corporation
    Inventors: Paolo Deidda, Fabio Benedetti
  • Patent number: 8060885
    Abstract: A solution is proposed for facilitating the selection of execution servers to be used in a scheduler for submitting the execution of jobs. Each job is defined by a corresponding descriptor. The descriptor specifies the execution servers to be used by the jobs in a formal way (through their properties); in addition, the descriptor may also include the definition of formal relationships to be satisfied by the execution server with other resources of the system (in turn defined in a formal way through their properties). A query is created according to the descriptor for selecting (concrete) execution servers having the desired properties and satisfying the desired relationships with the resources of the system. This query is then run on a central database, wherein all the concrete execution servers, resources and relationships are defined. In this way, it is possible to obtain a list of concrete execution servers eligible to execute the job in a single transaction.
    Type: Grant
    Filed: October 3, 2007
    Date of Patent: November 15, 2011
    Assignee: International Business Machines Corporation
    Inventors: Fabio Benedetti, Paolo Deidda
  • Patent number: 7702780
    Abstract: For monitoring a data processing system, a sequence of critical conditions with increasing severity indexes is defined. Each critical condition is detected when a corresponding state parameter exceeds a threshold value with a predefined persistence over time. The persistence may be specified by a minimum number of repeated occurrences of this event, with a maximum number of consecutive non-occurrences that are allowed between them. Whenever critical conditions are detected, the monitoring application retrieves the severity index of the last detected critical condition with the highest severity index, and calculates an incremental index indicative of how closely the state parameter is approaching the next critical condition. An indicator of the health of the system may be generated by subtracting the severity index of the last critical condition plus the incremental index from an optimal value.
    Type: Grant
    Filed: June 22, 2005
    Date of Patent: April 20, 2010
    Assignee: International Business Machines Corporation
    Inventors: Wade Allen, Paolo Deidda, David Anthony Fresquez, Antonio Perrone, Rosalind Radcliffe
  • Publication number: 20090193421
    Abstract: Exemplary embodiments of the present invention provide a solution that comprises the capability to dispatch jobs to target system according to the declared resource consumption by providing a way for automatically calculating the resource consumption at a target processing system. The algorithmic solution provided can also be utilized by standalone reporting tools to calculate resource consumption offline and show resource impact based upon database query results in the event that data samples are available. The solution provided by exemplary embodiments of the present invention is obtained by reducing the resource consumption problem to an optimization problem involving a set of linear equations.
    Type: Application
    Filed: January 30, 2008
    Publication date: July 30, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Fabio Benedetti, Umberto Caselli, Paolo Deidda
  • Publication number: 20090113442
    Abstract: Method and system for providing a mechanism for determining an optimal workload distribution, from a plurality of candidate workload distributions, each of which has been determined to optimize a particular aspect of a workload-scheduling problem. More particularly, the preferred embodiment determines a workload distribution based on resource selection policies. From this workload distribution, the preferred embodiment optionally determines a workload distribution based on job priorities. From either or both of the above parameters, the preferred embodiment determines a workload distribution based on a total prioritized weight parameter. The preferred embodiment also determines a workload distribution which attempts to match the previously determined candidate workload distributions to a goal distribution. Similarly, the preferred embodiment calculates a further workload distribution which attempts to maximize job throughput.
    Type: Application
    Filed: August 31, 2008
    Publication date: April 30, 2009
    Inventors: Paolo Deidda, Fabio Benedetti
  • Publication number: 20080082982
    Abstract: A solution (400) is proposed for facilitating the selection of execution servers to be used in a scheduler for submitting the execution of jobs. Each job is defined by a corresponding descriptor (415). The descriptor specifies the execution servers to be used by the jobs in a formal way (through their properties); in addition, the descriptor may also include the definition of formal relationships to be satisfied by the execution server with other resources of the system (in turn defined in a formal way through their properties). A query is created according to the descriptor (421) for selecting (concrete) execution servers having the desired properties and satisfying the desired relationships with the resources of the system. This query is then run (424) on a central database, wherein all the concrete execution servers, resources and relationships are defined. In this way, it is possible to obtain a list of concrete execution servers eligible to execute the job in a single transaction.
    Type: Application
    Filed: October 3, 2007
    Publication date: April 3, 2008
    Inventors: Fabio Benedetti, Paolo Deidda
  • Publication number: 20070005298
    Abstract: For monitoring a data processing system, a sequence of critical conditions with increasing severity indexes is defined. Each critical condition is detected when a corresponding state parameter exceeds a threshold value with a predefined persistence over time. The persistence may be specified by a minimum number of repeated occurrences of this event, with a maximum number of consecutive non-occurrences that are allowed between them. Whenever critical conditions are detected, the monitoring application retrieves the severity index of the last detected critical condition with the highest severity index, and calculates an incremental index indicative of how closely the state parameter is approaching the next critical condition. An indicator of the health of the system may be generated by subtracting the severity index of the last critical condition plus the incremental index from an optimal value.
    Type: Application
    Filed: June 22, 2005
    Publication date: January 4, 2007
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Wade Allen, Paolo Deidda, David Fresquez, Antonio Perrone, Rosalind Radcliffe