o H&i1@s0ddlmZddlmZmZmZmZddlmZm Z GdddZ GdddeZ Gdd d eZ Gd d d eZ Gd d d eZGdddeZdedeedefddZde deee fde fddZdee deee fdee e ffddZde de defdd Zdee d!ee e fdefd"d#Zd$S)%)Enum) NamedTupleDictListSet)Nodemap_argc@sBeZdZdZdeddfddZddZd d Zd d Zd dZ dS) PartitionzPartition class contains all the information about an individual partition. It also provides necessary methods for manipulation the partition. partition_idreturnNcCs4t|_||_t|_t|_d|_d|_g|_dS)Nr)setnodesr parentschildrenZ bfs_levelused_mem_byteslogical_device_ids)selfr rRC:\wamp64\www\opt\env\Lib\site-packages\torch/fx/experimental/partitioner_utils.py__init__ s zPartition.__init__cCs t|jSN)strr rrrr__str__s zPartition.__str__cCs,d|_|jD] }|jt||j7_qdS)Nr)rrget_extra_size_of)rnoderrrrecalculate_mem_sizes zPartition.recalculate_mem_sizecCsXi}t|j|jt|j|j|D] }|jdvr|j|q|j||dS)N>get_attr placeholder)rargs setdefaultkwargsopraddr)rr input_nodesnrrradd_nodes    zPartition.add_nodecs~|jvr=j|i}t|j|jt|j|j|D]}tfdd|jDr6|jdvr6j|q dSdS)Nc3s|]}|jvVqdSr)r.0r&rrr 4s  z(Partition.remove_node..>rr) rremoverr r!r"allusersr#r)rrr%Z input_noderrr remove_node(s      zPartition.remove_node) __name__ __module__ __qualname____doc__intrrrr'r.rrrrr s  r c@s&eZdZUeed<eed<eed<dS)DevicenameZavailable_mem_bytesZ logical_idN)r/r0r1r__annotations__r3rrrrr4;s  r4c@seZdZUeed<eed<dS) NodeLatencymem_latency_seccomputer_latency_secNr/r0r1floatr6rrrrr7As  r7c@s&eZdZUeed<eed<eed<dS)PartitionLatencyr8r9overall_latency_secNr:rrrrr<Hs  r<c@s eZdZdZdZdZdZdZdS) PartitionModerN)r/r0r1 size_basedZ sparse_nnZ cost_awareZkl_basedZ aot_basedrrrrr>Qs r>c@seZdZUeeed<ejZeed<dZ e ed<iZ e e efed<iZe e efed<iZe eeefed<dZeed <d S) PartitionerConfigZdevicesmodetransfer_rate_bytes_per_secnode_to_latency_mappingnode_to_partition_mapping#partition_to_logical_device_mappingF saturate_hostN)r/r0r1rr4r6r>rCrErGr;rHrrr7rIr3rJrKboolrrrrrDYs  rDrrr cCsi}t|j|jt|j|jd}|D]}||vr,t|dd}|r(||j7}qtdqt|dd}|r<||j7}|Std)zGiven a node and a set of nodes, this function return the extra size that needed if this node is included in this set. r size_bytesNznode has no size_bytes attr)rr r!r"getattr output_size RuntimeError total_size)rrr%Ztotal_size_of_input_nodesr&rMrrrrds     r partitionrHcsxdtdttfdd}dtdtffdd |}tdddd }|D]}|tdddd }|j|jkr9|}q%|S) zVGiven a partition and its nodes' latency, return a PartitionLatency for this partitionrRr cs`g}jD](}|jdvr qi}t|j|jt|j|jtfdd|Ds-||q|S)z>Given a partition, return a list of nodes on the top bfs level>rrc3s$|] }|jvo |jdvVqdS)>rrN)rr#r(rRrrr*s  zFget_latency_of_one_partition..get_top_nodes..)rr#rr r!r"anyappend)rR top_nodesrr%rrSr get_top_nodess    z3get_latency_of_one_partition..get_top_nodesrc s|}|jt|j|j}|j|j}|j|j}t|jj}|rDtdddd}|D]}|t|||} | j|jkrA| }q.|St|||S)zyGiven a top node of a partition, this function returns the latency of the critical path in the partition rFr8r9r=) r=maxr9r8r r- intersectionrr<) rpartition_latencyZ node_latencyr=r8r9r-Z max_latencyr&Znew_partition_latency dfs_helperrHrRrrr]s:  z0get_latency_of_one_partition..dfs_helperrFrX)r rrr<r=)rRrHrWrVZcritical_path_latencyrr[rr\rget_latency_of_one_partitions&,r^ partitionscCs$i}|D] }t||}|||<q|S)zGiven all the partitions and node_to_latency_mapping dictionary, return a mapping dictionary of each partition to its overall latency )r^)r_rHpartition_to_latency_mappingrRr[rrr get_partition_to_latency_mappings raparent_partitionchild_partitionrGc Cs|jgkr|jgkr|j|jkrdSd}t}|jD]4}i}t|j|jt|j|j|D]}||jvrM||vrMt|dd}|durH||j7}| |q.q||S)zfGiven two partitions (parent and child), calculate the communication latency between the two. rFrrMN) rr rrr r!r"rNrOr$) rbrcrGZ comm_sizeZ visited_nodesrr%r&rMrrrget_comm_latency_betweens&      rdr`cshdtdtdtffdd dttdttfdd}||}d }|D] }|d }||kr1|}q$|S) zGiven all partitions in a graph, find the critical path among all partitions and return its latency as the latency of the whole graph rRlatency_so_far_secr csX||j7}|j}|jr*d}|jD]}t||}|||}||kr'|}q|S|S)zJThis function helps to recursively get the latency of a path of partitionsrF)r=rrd)rRrerZmax_latency_secchildZcomm_latency_secZnew_latency_secr]r`rGrrr]s( z4get_latency_of_partitioned_graph..dfs_helperr_cSs*g}|D]}t|jdkr||q|S)zvThis function is to return all the partitions without parents as the starting points of all the paths r)lenrrU)r_top_partitionsrRrrrget_top_partitions,s  z.get_top_partitionsrF)r r;r)r_r`rGrjriZcritical_path_latency_secrRZ latency_secrrgr get_latency_of_partitioned_graph s   rkN)enumrtypingrrrrZ torch.fx.noderrr r4r7r<r>rDr3rr^rar;rdrkrrrrsL 4    Y    $