1. A method for deterministic routing of a placed circuit design netlist, comprising: grouping nets of the netlist into a plurality of sub-netlists, each sub-netlist including one or more of the nets; for each sub-netlist, routing each net in the sub-netlist by a programmed processor as a function of congestion between nets of the sub-netlist, the function not being dependent on congestion between nets of other sub-netlists in the plurality of sub-netlists; and after routing each net of each sub-netlist and in response to two or more nets of the netlist being routed through one routing resource, performing steps including: grouping the two or more nets of the netlist into a revised set of sub-netlists; updating a global congestion history data set with congestion data that describe congestion between all nets in the netlist; undoing routes of the two or more nets of the netlist through the one routing resource; and for each of the two or more nets, routing the net as a function of the global congestion history data set and congestion between nets of the revised set of sub-netlists that includes the net, the function not being dependent on congestion between nets of other sub-netlists in the plurality of sub-netlists.