In the past two decades, there has been a large body of work on both parallel garbage collection and parallel scheduling. In this paper, we propose an approach for coupling the two together, which is particularly useful in functional languages. The basic idea is to organize memory in away that mirrors the structure of parallel is min the computation and takes advantage of the independence of parallel tasks to perform garbage collection. While this general idea may be applicable to the broader array of parallel functional programming languages,we focus here on strict languages ,such as the MLfamily, extended with support for nested parallelism.