My algorithm: 1. 4-6 dishes are kept on the shelf (household size: 2) 2. When we eat, I pull the top 2 dishes from the shelf 3. Dishes get washed and put in

My algorithm: 1. 4-6 dishes are kept on the shelf (household size: 2) 2. When we eat, I pull the top 2 dishes from the shelf 3. Dishes get washed and put in drying rack 4. Next time we eat, we pull from the shelf. 5. In order to wash the dishes, we have to remove the dishes from the rack (our drying rack is pretty small). Sometimes we can fit two or three cycles on the rack, it doesn't make that much difference. When pulling the dishes off the drying rack back to the shelf, a random picking order is used. 6. Sometimes the dishes get left in the sink for a few cycles until they get washed 7. We have parties once every few months where all the plates come out, and go to the rack, then get randomly picked and split to the shelf and cabinet. After a few cycles the wear should be evenly distributed. --- * shelf => L1 cache * table => cpu * sink => L2 cache * rack => write buffer * cabinet => non-volatile storage (or something like that.)