A general purpose cell sequencer/scheduler for ATM switches
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
Groups of cells, such as cells belonging to different priority levels, that are all placed in one queue, can be identified by using labels or tags to distinguish them from each other. We describe a buffering device called a sequencer, which can distinguish logical queues within the same physical queue, and at the same time can successfully schedule the service among these logical queues. Scheduling the service among cells, VCs, or groups of cells in ATM switches is necessary to provide guaranteed QoS for each connection which is a major goal of ATM networks. The proposed sequencer is quite flexible and can realize different scheduling algorithms in different levels, including per VC scheduling. The sequencer can operate in real time and at very high speeds. It has a simple and modular architecture and can be implemented in a single chip. The site of the buffer can be increased simply by cascading several sequencers. The sequencer can be used as a traffic shaper, input buffer, output buffer, or a queue controller of RAM-based switches.
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