Does chunk size matter in distributed video transcoding?
Bibliographic record
Abstract
In recent years, the demand for high quality video streaming services has been growing significantly. Distributed video transcoding in cloud, i.e., re-encoding the source video to best match the capabilities of the network connection and the playback device in cloud and sending each user a tailored version of the video, is a recent solution for fast and high quality video streaming services. In such a transcoding scheme, video is segmented into chunks of equal size and the chunks are distributed among multiple virtual machines for parallel transcoding. The transcoded chunks are then merged together to create the new transcoded video appropriate for playback on specific end-user devices. In this paper, we conduct a performance analysis of the impact of chunk size on coding efficiency and transcoding time. We observe that transcoding with larger chunks leads to better coding efficiency (i.e., lower bitrate) by trading off the transcoding time. The improvement in coding efficiency and the level of trade-off in transcoding time highly depend on the visual similarity among frames of a video sequence. From the analysis, we suggest that for better coding efficiency and faster transcoding, the chunk size should be dynamically adjusted according to the visual similarity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.036 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".