Memory restricted scheduling

Certain aspects of the present disclosure provide techniques for generating an execution schedule, including: receiving a dataflow graph for a process, where the dataflow graph includes a plurality of nodes and a plurality of edges; generating a topological ranking of the dataflow graph based at least in part on memory utilization of the process; generating a first modified topological order by inserting one or more new nodes corresponding to memory accesses into the topological order based on a predefined memory capacity; allocating memory cells based on the first modified topological ranking; and generating a second modified topological order by rearranging the one or more nodes according to the first modified topological order, wherein the second modified topological order enables increased parallel utilization of the plurality of hardware components. 本公开的某些方面提供了用于生成执行调度的技术，包括：接收用于进程的数据流图表，其中数据流图表包括多个节点和多条边；至少部分地基于该进程的存储器利用来生成该数据流图表的拓扑排序；通过基于预定义的存储器容量将与存储器存取相对应的一个或多个新节点插入到该拓扑排序中来生成第一经修改拓扑排序；基于第一经修改拓扑排序来分配存