The document proposes a bin packaging technique to reduce thrashing in virtual memory systems. Processes are split into groups where each group's total memory size is close to the real memory size. This grouping problem is NP-hard. The document suggests a greedy first-fit approach where processes are sorted by size and placed into bins one by one until the bin is full, then a new bin is started. Processes from each bin are loaded into memory in a round robin fashion to prevent thrashing between bins.