Improved embeddings in POPS networks through stack-graph models
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
In 1996 MPPOI, Gravenstreter and Melhem presented optimal embeddings of ring and torus communications on the POPS architecture, for the case where the number of nodes (n) and the optical passive star (OPS) coupler degree (d) are powers of two. In the same conference, Bourdin, Ferreira and Marcus; see massively parallel multiprocessing using optical interconnections, San Antonio, USA, Oct, 1995, IEEE press; proposed stack-graphs as a good model for OPS-based architectures. In this paper we show that directed stack-complete graphs with loops (stack-K/sup +//sub n/ for shown perfectly model POPS. As a consequence, we settle the question with respect to ring embeddings, presenting optimal embeddings for all values of n and d, based on Euler tours on K/sup +//sub n/. We also show how to optimally embeded Bruijn (B (g, D)) communications on POPS when g is the number of groups in the POPS topology, using the fact that K/sup +//sub g/ is also a B (g, 1).
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.001 |
| 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