Abstract: Various embodiments are provided for using pessimistic scheduling for topology optimized workload placement by a processor in a computing environment. An excessive amount of computing resources may be requested (e.g., a pessimistic request) to execute a workload as compared to a required amount of the computing resources to execute the workload. The workload may be assigned to a selected configuration of the excessive amount of computing resources and releasing a remaining amount of the excessive amount of computing resources.

Abstract: Various embodiments are provided for using pessimistic scheduling for topology optimized workload placement by a processor in a computing environment. An excessive amount of computing resources may be requested (e.g., a pessimistic request) to execute a workload as compared to a required amount of the computing resources to execute the workload. The workload may be assigned to a selected configuration of the excessive amount of computing resources and releasing a remaining amount of the excessive amount of computing resources.

Abstract: Resources of a partitionable computer system are partitioned into at least first and second partitions, in accordance with a first or second mode of operation of the partitionable computer system. The system is run in the first or second mode, partitioned in accordance with the partitioning step. Periodically, it is determined whether the computer system should be switched from one mode to the other mode. If so, the computer system is run in the other mode, partitioned in accordance with the other mode. The first and second modes of operation are defined in accordance with historical observations of the partitionable computer system. The periodic determination is carried out based on predictions in accordance with the historical observations.

Abstract: Resources of a partitionable computer system are partitioned into: (i) a first partition for first jobs, the first jobs being at least one of small and short running; and (ii) a second partition for second jobs, the second jobs being at least one of large and long running. The computer system is run as partitioned in the partitioning step and the partitioning is periodically re-evaluated against at least one threshold for at least one of the partitions. If the periodic re-evaluation suggests that one of the first and second partitions is underutilized, the resources of the partitionable computer system are dynamically re-partitioned to reassign at least some of the resources of the partitionable computer system from the underutilized one of the first and second partitions to another one of the first and second partitions.

Abstract: Resources of a partitionable computer system are partitioned into: (i) a first partition for first jobs, the first jobs being at least one of small and short running; and (ii) a second partition for second jobs, the second jobs being at least one of large and long running. The computer system is run as partitioned in the partitioning step and the partitioning is periodically re-evaluated against at least one threshold for at least one of the partitions.

Abstract: Resources of a partitionable computer system are partitioned into at least first and second partitions, in accordance with a first or second mode of operation of the partitionable computer system. The system is run in the first or second mode, partitioned in accordance with the partitioning step. Periodically, it is determined whether the computer system should be switched from one mode to the other mode. If so, the computer system is run in the other mode, partitioned in accordance with the other mode. The first and second modes of operation are defined in accordance with historical observations of the partitionable computer system. The periodic determination is carried out based on predictions in accordance with the historical observations.