Moca Systems, Inc.

Torrent Systems, Inc.

Daniel L Leary

David W Rolin

Michael James Beckerle

Jerry Lee Callen

Robert Louise Krawitz

Jeffrey D Ives

James Richard Burns

Michael N Carr

Dong Jiang

Edward S A Zyzkowski

Seven Rosenthal

The present disclosure is directed to systems and methods for managing a pull-schedule. The system includes a schedule for completing at least one milestone, the schedule comprising an active schedule portion and a pull-schedule portion and one or more tickets that can be represented in the active schedule portion and/or the pull schedule portion, each ticket comprising a task to be completed to reach the at least one milestone. A scheduling service includes a pull column partitioning engine to scan the pull-schedule portion to define one or more columns with boundaries at the vertical positions that do not overlap with any tickets, a pull column assigning engine to assign the one or more tickets to a column and assign planned start and finish dates to the tickets, and a pull column activation engine to move a collection of a tickets contained in a pull column to the active schedule portion.

Method for graphical pull planning with active work schedules

A system and method for simulating resource allocation, where the allocation strategies which can be simulated include those of prior art but also include a large class of important allocation strategies that are not possible or not easy to simulate using prior art techniques and systems is described. A location limiting allocation strategy is also described. This strategy supports resource capacity schedules and request priorities as supported by prior art, but simultaneously supports the enforcement of allocation limits applied to a property expressed in the allocation request, namely the location of the work to be performed, or a location, resource pair to perform the work.

System and method for simulating resource allocation

A system provides an environment for parallel programming by providing a plurality of modular parallelizable operators stored in a computer readable memory. Each operator defines operation programming for performing an operation, one or more communication ports, each of which is either an input port for providing the operation programming a data stream of records, or an output port for receiving a data stream of records from the operation programming and an indication for each of the operator's input ports, if any, of a partitioning method to be applied to the data stream supplied to the input port. An interface enables users to define a data flow graph by giving instructions to select a specific one of the operators for inclusion in the graph, or instructions to select a specific data object, which is capable of supplying or receiving a data stream of one or more records, for inclusion in the graph, or instructions to associate a data link with a specific communication port of an operator in the graph, which data link defines a path for the communication of a data stream of one or more records between its associated communications port and either a specific data object or the specific communication port of another specific operator in said graph. The execution of a data flow graph equivalent to that defined by the users is automatically parallelized by causing a separate instance of each such operator, including its associated operation programming, to be run on each of multiple processors, with each instance of a given operator having a corresponding input and output port for each input and output port of the given operator, and by automatically partitioning the data stream supplied to the corresponding inputs of the instances of a given operator as a function of the partitioning method indication for the given operator's corresponding input.

Apparatuses and methods for programming parallel computers

Growing community of inventors

New Ipswich, NH, United States of America

Daniel L Leary