Abstract: A method for scheduling computing jobs in a scheduling event. A computing node is identified that is able to satisfy the required resource during a first time period. A second computing job is determined to have previously been scheduled to execute during a second time period, where the second time period overlaps a first time period. Execution of the second computing job is preempted if the first computing job's priority is greater than the second computing job's priority by at least a threshold amount, and if preempting the second job frees the required resource for use by the first computing job. Execution of the first computing job is scheduled to take place on a first computing node during the first time period, where a start time associated with the first time period is a time selected from the group consisting of a current time and a future time.

Abstract: A method of executing jobs includes obtaining a first plurality of scheduled jobs, setting a first trigger threshold based on at least one of the first plurality of scheduled jobs, executing the first plurality of scheduled jobs, receiving a submitted job during the execution of the first plurality of scheduled jobs, associating the submitted job with a submitted job priority, if the submitted job priority satisfies the first trigger threshold, obtaining a second plurality of scheduled jobs, setting a second trigger threshold based on at least one of the second plurality of scheduled jobs, executing the second plurality of scheduled jobs, and if the submitted job priority does not satisfy the first trigger threshold, continuing execution of the first plurality of jobs.

Abstract: A method includes associating each computing job with a group of a plurality of groups, and associating each group with a minimum promised utilization. Further, the method includes determining a present utilization for each group having at least one job ready for scheduling, each job being associated with at least one required resource, the present utilization for a given group comprising a total amount of a promised resource consumed by presently executing jobs associated with the given group divided by the minimum promised utilization associated with the given group. A first computing job selected for scheduling is one that is ready for scheduling and is the computing job having a highest static priority within a group having a lowest present utilization. A subset of computing nodes able to satisfy the at least one required resource associated with the first computing job is identified.

Abstract: A method for scheduling jobs in a computing system accounts provides for current and future scheduling according to job priority, and system resources expected to be available during a given time period. Resources may be freed by preempting jobs scheduled to execute according to preemption rules specified for the system. Advance reservation and backfilling are accomplished, maximizing system efficiency.

Abstract: A method for scheduling computing jobs in a scheduling event includes selecting a computing job that is ready for scheduling the first computing job being associated with at least one required resource. A computing node is identified that is able to satisfy the at least one required resource during a first time period having a start time and an end time. A second computing job is determined to have previously been scheduled to execute during a second time period; wherein the second time period overlaps the first time period. At a time prior to scheduling the first computing job, a determination is made as to whether the second computing job is preemptible by the first computing job.

Abstract: A method for scheduling computing jobs in a scheduling event includes calculating a static priority of each computing job ready for scheduling, and then selecting a first computing job having the highest static priority as compared to at least one other computing jobs ready for scheduling, the first computing job being associated with at least one required resource. Further, a subset of computing nodes able to satisfy the at least one required resource are identified, and predictions are made for each node of an earliest predicted completion time that the first computing job can be completed on each of those nodes, taking into account already scheduled jobs. Finally, execution of the first computing job is scheduled on the node having the earliest predicted completion time.

Abstract: A method of executing jobs includes obtaining a first plurality of scheduled jobs, setting a first trigger threshold based on at least one of the first plurality of scheduled jobs, executing the first plurality of scheduled jobs, receiving a submitted job during the execution of the first plurality of scheduled jobs, associating the submitted job with a submitted job priority, if the submitted job priority satisfies the first trigger threshold: obtaining a second plurality of scheduled jobs, setting a second trigger threshold based on at least one of the second plurality of scheduled jobs, executing the second plurality of scheduled jobs, and if the submitted job priority does not satisfy the first trigger threshold: continuing execution of the first plurality of jobs.

Abstract: Guidance provision to the creation of an electronic design is facilitated through a method that includes facilitating interactive exploration of the electronic design by a designer to aid the designer in formulating his/her guidance, and facilitating the designer in interactively providing the formulated guidance. In one embodiment, facilitation of interactive exploration by the designer include facilitating interactive cross-probing into a number of issues about the design, including generated candidate architectures for the design. In one embodiment, the issues available for cross probing include inter-dependencies of data and mobility of operations of the design, as well as occupation of hardware resources for the generated candidate architectures. In one embodiment, Gantt diagrams are employed to facilitate navigation by the designer in performing the interactive cross probing. Gantt diagrams graphically representing the generated candidate architectures are selectively presented to the designer.

Abstract: An electronic design is created through a machine implemented method that includes evolutionarily generating candidate architectures for the electronic design, with the evolutionary generation of the candidate architectures being periodically guided by the designer, and generating an implementation specification for the design in accordance with a selected one of the evolutionarily generated candidate architectures. In one embodiment, the candidate architectures are evolutionarily generated on different abstraction levels, and the generated candidate architectures on the different abstraction levels may be selectively regenerated as often as desired by the designer. In one embodiment, the periodic guidance includes periodic modification of the constraints on the electronic design. In one embodiment, the method further includes facilitating periodic exploration of the electronic design, including the generated candidate architectures, by the designer, to aid the designer in formulating his/her guidance.

Abstract: Candidate architectures for an electronic design are created through a machine implemented method that includes initially generating one or more initial candidate architectures for the electronic design on a top abstraction level, and subsequently generating additional candidate architectures for the electronic design at one or more lower abstraction level, in accordance with periodic guidance provided by a designer. In one embodiment, the initial candidate architectures on the top abstraction level are generated in accordance with a behavioral specification of the electronic design, and an initial set of constraints on the electronic design, independently described, and include application of a de-abstraction transformation.