U yhm0@sddlmZddlmZmZmZmZddlmZm Z GdddZ GdddeZ Gdd d eZ Gd d d eZ Gd d d eZGdddeZeeeedddZe eee fe dddZee eee fee e fdddZe e edddZee ee e fedddZdS) )Enum) NamedTupleDictListSet)Nodemap_argc@s@eZdZdZeddddZddZdd Zd d Zd d Z dS) PartitionzPartition class contains all the information about an individual partition. It also provides necessary methods for manipulation the partition. N) partition_idreturncCs4t|_||_t|_t|_d|_d|_g|_dS)Nr)setnodesr parentschildrenZ bfs_levelused_mem_byteslogical_device_ids)selfr rY/var/www/html/venv/lib/python3.8/site-packages/torch/fx/experimental/partitioner_utils.py__init__ szPartition.__init__cCs t|jSN)strr rrrr__str__szPartition.__str__cCs,d|_|jD]}|jt||j7_q dS)Nr)rrget_extra_size_of)rnoderrrrecalculate_mem_sizes zPartition.recalculate_mem_sizecCsXi}t|j|jt|j|j|D]}|jdkr$|j|q$|j||dS)N>get_attr placeholder)rargs setdefaultkwargsopraddr)rr input_nodesnrrradd_nodes  zPartition.add_nodecsz|jkrvj|i}t|j|jt|j|j|D]2}tfdd|jDr:|jdkr:j|q: dS)Nc3s|]}|jkVqdSr)r.0r&rrr 5sz(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/r0r1floatr6rrrrr7Bs r7c@s&eZdZUeed<eed<eed<dS)PartitionLatencyr8r9overall_latency_secNr:rrrrr<Is r<c@s eZdZdZdZdZdZdZdS) PartitionModerN)r/r0r1 size_basedZ sparse_nnZ cost_awareZkl_basedZ aot_basedrrrrr>Rs 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;rHrrr7rIr3rJrKboolrrrrrDZs   rD)rrr cCsi}t|j|jt|j|jd}|D]0}||kr(t|dd}|rP||j7}q(tdq(t|dd}|rv||j7}ntd|S)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 RuntimeErrorZ total_size)rrr%Ztotal_size_of_input_nodesr&rMrrrres     r) partitionrHr csttttddd}ttdfdd |}tdddd}|D](}|tdddd}|j|jkrF|}qF|S) zVGiven a partition and its nodes' latency, return a PartitionLatency for this partition)rQr cs`g}jD]P}|jdkrq i}t|j|jt|j|jtfdd|Ds ||q |S)z>Given a partition, return a list of nodes on the top bfs level>rrc3s"|]}|jko|jdkVqdS)>rrN)rr#r(rQrrr*szFget_latency_of_one_partition..get_top_nodes..)rr#rr r!r"anyappend)rQ top_nodesrr%rrRr get_top_nodess    z3get_latency_of_one_partition..get_top_nodes)rr c s|}|jt|j|j}|j|j}|j|j}t|jj}|rtdddd}|D]&}|t|||} | j|jkr\| }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_helperrHrQrrr\sH  z0get_latency_of_one_partition..dfs_helperrFrW)r rrr<r=)rQrHrVrUZcritical_path_latencyrrZrr[rget_latency_of_one_partitions.,r]) partitionsrHr cCs$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_mappingrQrZrrr get_partition_to_latency_mappings r`)parent_partitionchild_partitionrGc Cs|jgkr$|jgkr$|j|jkr$dSd}t}|jD]h}i}t|j|jt|j|j|D]>}||jkr\||kr\t|dd}|dk r||j7}| |q\q4||S)zfGiven two partitions (parent and child), calculate the communication latency between the two. rFrrMN) rr rrr r!r"rNrOr$) rarbrGZ comm_sizeZ visited_nodesrr%r&rMrrrget_comm_latency_betweens(     rc)r^r_rGcsbtttdfdd ttttddd}||}d}|D]}|d}||krB|}qB|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 )rQlatency_so_far_secr csX||j7}|j}|jrTd}|jD]*}t||}|||}||kr$|}q$|S|S)zJThis function helps to recursively get the latency of a path of partitionsrF)r=rrc)rQrdrZmax_latency_secchildZcomm_latency_secZnew_latency_secr\r_rGrrr\s( z4get_latency_of_partitioned_graph..dfs_helper)r^r 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)lenrrT)r^top_partitionsrQrrrget_top_partitions-s  z.get_top_partitionsrF)r r;r)r^r_rGrirhZcritical_path_latency_secrQZ latency_secrrfr get_latency_of_partitioned_graphs   rjN)enumrtypingrrrrZ torch.fx.noderrr r4r7r<r>rDr3rr]r`r;rcrjrrrrs2 4    Z   %