Date specific addition?

[kdackiw]

Fabulous program. Use it often!

I do frequently scatter my items to older drives with older data which keeps them in the array but mostly unused. Can there be a way prior to the plan running to work with the oldest data first and have that moved/copied until the plan is complete?

Kev.

[jbrodriguez]

Hi, thanks a lot for the praise ! Much appreciated !

Could you share a scenario, just a couple of lines showing what you're thinking the app should do ?

I think I have an idea of what you're asking, but it would help getting some more context

[kdackiw]

Hi Juan. Across my array, I of course have a mix of newer/older/bigger/smaller disks. As I delete/cleanse, unraid of course works to diligently level all the usage out over time (since I use high-water). I'll then want to fill up the older disks with items on the newer disks, targeting the oldest material. Moving that data over and repeating this process for the disks starts to make the oldest disks over time collect the oldest data. Let's pick TV shows. A series that I added 2 years ago is fair game to move off my "best/fastest" disks and towards the oldest/smallest disks. I currently do this with MC and a per disk per folder-share method. Knowing that my drive 10 has space and wishing to move old shows from disks 1, 2, and 3, I enter each "TV" share on those disks, rescan to get the directory sizes, then sort by date. I can now select the right amount of data then move it to disk 10. I continue this again with disk 2 to 10, 3, to 10, etc. Then I perhaps move to disk 9 then do this again with 1, 2, 3, 4, etc. I guess basically you want a share's worth of data moved to a disk (or disks), oldest first. The goal of all the wizardry would be to have an array where even across all shares, the oldest data ends up on parts of the array (or a pool) where the disks themselves rarely spin up. I achieve this by adding any new disk as "1" and pushing every other one down, so I know the disks at the end (10,11,12...) are the oldest, most tired, and should have the oldest data and rarely turn on. Makes sense? In a perfect world, one would pick every share and indicate an order of disk fill and move the data, oldest first. Also move the newest data on those disks to other drives. Like a giant, scary disk defrag. Keep newest data on 1, 2, 3, etc. (in my case) and the oldest at the end (8, 9, 10...). ...or some useful variant of the above. Moore of a 'balance' than un- I will say. Kev. On Wednesday, December 30, 2020 6:30:44 PM MST Juan B. Rodriguez wrote: Hi, thanks a lot for the praise ! Much appreciated ! Could you share a scenario, just a couple of lines showing what you're thinking the app should do ? I think I have an idea of what you're asking, but it would help getting some more context — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub[1], or unsubscribe[2].[3]

…

-------- [1] #43 (comment) [2] https://github.com/notifications/unsubscribe-auth/AKKHRWBRKVE6AXHNLRY3AZDSXPH4JANCNFSM4VMSQNSA [3] https://github.com/notifications/beacon/AKKHRWEFJTC7EBRJ4DIQ3X3SXPH4JA5CNFSM4VMSQNSKYY3PNVWWK3TUL52HS4DFVREXG43VMVBW63LNMVXHJKTDN5WW2ZLOORPWSZGOFTPPYQA.gif

[jbrodriguez]

hi, i re-read the subject and i will not work on this, this would require some per-user logic (what does "old" mean?, and so on) which makes it not easy to automate

if possible, do open a pr on the new codebase and i would certainly look at it