A method is described of allocating core storage on a computer without paging facilities, working in a time-shared environment. The algorithm includes techniques for the dynamic repositioning of program segments, and the dumping of segments to a secondary store, in order to enlarge and consolidate unused portions of the core store. The paper also gives the results obtained from the random simulation of a system requiring the scheduling algorithm, to check out the logic, and to provide patterns of behaviour.