A computer memory sharing problem

A multitask computer system with shared memory is described. The memory is considered to be limited. Initially it is shared among tasks in the form of separable memory areas. Each task generates random stream of data, which fills memory area connected with it. When any memory area is filled with data the system must be reorganized. The problem formulated and solved is: how to share limited memory among tasks in order to maximize expected time to system reorganization?