A multicast single-queue switch with a novel copy mechanism
Bibliographic record
Abstract
A new multicasting mechanism for RAM-based shared-buffer ATM switches is introduced. Multiple logical output queues, including a new queue for multicast and broadcast cells, are all interleaved into a single physical buffer as in the single-queue switch architecture. Queues are hardware-independent and full buffer-sharing is achieved. Cells are scheduled in the multicast queue based on their priority level and service type as in the unicast queues. A single copy of a multicast cell is kept in the queue. The cell is sent to all of its destinations upon its service time. A unicast cell in a given output queue can still be sent if it has higher priority than a multicast cell. In this case a unicast copy of the multicast cell for that output port is placed in the output queue. This copying scheme requires neither extra hardware nor extra memory space for duplicated cells. A new grouping algorithm is presented which supports the incorporation of the multicast queue and the unicast queues into a single overall queue.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".