An Out-of-Order Load-Store Queue for Spatial Computing

Abstract

The efficiency of spatial computing depends onthe ability to achieve maximal parallelism. This needs memoryinterfaces that can correctly handle memory accesses arrivingin arbitrary order while still respecting data dependencies andensuring appropriate ordering for semantic correctness. However, a typical memory interface for out-of-order processors (i.e., aload-store queue) cannot immediately fulfill these requirements:a different allocation policy is needed to achieve out-of-orderexecution in a spatial system. We show a practical way toorganize the allocation for an out-of-order load-store queue forspatial computing by dynamically allocating groups of memoryaccesses, where the access order within the group is staticallypredetermined (for instance by a high-level synthesis tool).