The paper examines the problem of mapping a dataflow program graphs onto a data-driven array with hexagonal cells. A particular mapping scheme is analyzed to show that, in general, it results in a low area utilization. An optimization method for reducing the hosting area is introduced with descriptions of two possible implementations.