3 ms·
At these delays you can use sharded coding with clustering. I.e., at a GOP of say 10 seconds, this gives you 8 shards. And with that many shards, I think a nice
by namibj 8y ago
At these delays you can use sharded coding with clustering. I.e., at a GOP of say 10 seconds, this gives you 8 shards. And with that many shards, I think a nice blade center full of high-clock current-gen CPUs can do it. I.e., 8 systems with as many max speed cores each as the encoder can handle.
x264 for example caps out at about 20~60 cores for 1080p, but I didn't save the exact numbers.
- ttoinou 8y agoNote : it seems that for live TV the GOP is more like 2 seconds
- namibj 8y ago10 seconds is a good balance between seekability and gains due to B-frames, for normal movie content. If the movement is particularly absent/easy to compress, e.g. with screen recordings of Minecraft (as long as there are not too many particles around), one benefits from a much larger GOP, towards the minute and even over a minute. Though you pay for this with most of the seeking you could do before. Choose wisely depending on what it's for.
- dan1234 8y agoGOP = Group of Pictures[0], for anyone unfamiliar with the term. [0]https://en.wikipedia.org/wiki/Group_of_pictures https://en.wikipedia.org/wiki/Group_of_pictures