The implementation of sequential loops in dataflow computation had traditiomdly not received very much attention as it was assumed that most loops would be executed in parallel.This assumption was valid for earlier dataflow machines such as the MIT Tagged Token Dataflow Architecture (TTDA)[2], Sigma-1 [9] but not for the newest generation of dataflow machines including Monsoon[6], EM-4[11] and Epsilon-2[7].On the latter machines, sequential loops use less memory, and can execute in fewer instructions, albeit with lower parallelism than the parallel versions. Th~characterisation of sequential and parallel loops suggests that programs should have parallel outer loops and sequential inner loops. The run time of sequential loops therefore become significant in the overall run time. We also found that previous implementations of sequential loops can incur fairly high overheads.In thu paper, we present two new ways of implementing sequential loops that have lower overhead then previous methods.We studied this problem in the context of compiling Id[14, 15] for Monsoon.