We study the data-parallel language ButF, inspired by the Futhark language, with the purpose of exploring its data-parallel nature. To this end we give a translation of ButF into a version of the 𝜋-calculus with broadcasting and labelled names. We show that our translation satisfies a property of operational correspondence, showing that it is both complete and sound. Moreover, we propose a cost model by annotating the translated ButF processes. This is used in a asymptotic complexity analysis of the translation in which we compare with the asymptotic cost of Futhark.