1. A method, comprising: obtaining processes of a high-level synthesis design of a dataflow pipeline by a programmed computer; determining a schedule for read operations and write operations for first-in, first-out data channels of the processes; determining a dataflow through the dataflow pipeline for the schedule; generating an edge-weighted directed acyclic graph for the processes and the dataflow; locating a longest path in the edge-weighted directed acyclic graph; and outputting a weight of the longest path as a latency estimate for the dataflow; wherein the generating comprises: constructing a directed acyclic graph for the dataflow; interconnecting the processes from first operations of the write operations to second operations of the read operations corresponding thereto; and assigning weights to each of the edges.