In this paper we discuss the problem of mapping a dataflow program graph onto data-driven array with hexagonal cells. We analyze a particular mapping scheme and show that it results in low area utilization. Finally, we introduce area optimization into the mapping scheme and define several measures to evaluate the quality of augmented mappings.