Scheduling algorithms for the cdma2000 packet data evolution
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The paper presents a performance comparison of several scheduling algorithms for the forward link of the high data rate (HDR) system. This system has been adopted as a possible evolutionary path for the North American 3/sup rd/ generation cdma2000 cellular system, and is designed to enable high bit rate packet data access. On the HDR forward link, only one user receives packet data in a given time slot. Hence, a scheduling algorithm is necessary to determine which user among those requesting service should receive data. In our performance analysis, we assume data packets are always available for transmission to every user. The scheduler performance is evaluated in terms of the average throughput per sector as a function of the number of users in the sector and the bit rate distributions. The throughput distributions over a set of users, the average delay per packet and per user, and the distributions of packet delays and allocated slots per user are also determined as a measure of fairness of the scheduling algorithms.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it