Fast multi-pass partitioning via priority based scheduling

摘要

Computer operations are partitioned for execution by a processor. A plurality of operations to be partitioned is received. The respective priorities for each of the plurality of operations is determined. Ready operations are identified, where a ready operation is an operation that does not have any predecessor operations that have not yet been added to a partition. A determination is made whether adding the ready operations with the highest priorities to the current partition would violate a hardware resource constraint. Based on this determination, the ready operations are added to the partition. The operations added to the partition are provided to a processor for execution.