Patents by Inventor Katiuscia Berretta

Katiuscia Berretta 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: 9250960
    Abstract: A computer-implemented method, program product and system for planning execution of a plurality of tasks according to a plurality of dependencies includes receiving an indication of a task type and execution time, ordering the tasks into a task list according to a primary ordering criterion, receiving an indication of a dependency type for the task type and an indication of a dependency time for the execution time of a predecessor one of the tasks, ordering the dependencies into a dependency list according to the primary ordering criterion, scanning the dependency list for resolving each current one of the dependencies, identifying the predecessor task as a current one of the tasks having the task type meeting the dependency type and the execution time meeting the dependency time, and planning the execution of the tasks according to the resolved dependencies.
    Type: Grant
    Filed: May 21, 2014
    Date of Patent: February 2, 2016
    Assignee: International Business Machines Corporation
    Inventors: Katiuscia Berretta, Francesca Curzi, Rossella Donadeo, Giuseppe Longobardi
  • Publication number: 20140366037
    Abstract: A computer-implemented method, program product and system for planning execution of a plurality of tasks according to a plurality of dependencies includes receiving an indication of a task type and execution time, ordering the tasks into a task list according to a primary ordering criterion, receiving an indication of a dependency type for the task type and an indication of a dependency time for the execution time of a predecessor one of the tasks, ordering the dependencies into a dependency list according to the primary ordering criterion, scanning the dependency list for resolving each current one of the dependencies, identifying the predecessor task as a current one of the tasks having the task type meeting the dependency type and the execution time meeting the dependency time, and planning the execution of the tasks according to the resolved dependencies.
    Type: Application
    Filed: May 21, 2014
    Publication date: December 11, 2014
    Applicant: International Business Machines Corporation
    Inventors: Katiuscia Berretta, Francesca Curzi, Rossella Donadeo, Giuseppe Longobardi
  • Publication number: 20090007132
    Abstract: Multiple timing availability chains can be created for individual processing resource in a common pool of resources. Each chain can include a plurality of time intervals each interval having a start time and an end time. Timing availability chains for individual processing resources in the pool of resources can be merged together based on a timing reference to create a pool timing availability chain based on the start times and end times for the intervals. Job plan execution can be simulated based on the pool timing availability chain. The pool chain can be utilized to simulate job execution and based on such simulation a job scheduler can improve the scheduling of jobs on a pool of resources. Other embodiments are also disclosed.
    Type: Application
    Filed: September 16, 2008
    Publication date: January 1, 2009
    Applicant: International Business Machines Corporation
    Inventor: Katiuscia Berretta