An efficient single copy cache coherence protocol for multiprocessors with multistage interconnection networks
Bibliographic record
Abstract
Multistage interconnection networks offer an efficient, scalable, and cost effective solution for the problem of connecting processors to memory in a shared memory multiprocessor system. In this paper, we present an efficient single copy cache coherence protocol for multiprocessors with multistage interconnection networks. Our protocol depends on incorporating the cache memory into the switches (caching switches) of the multistage interconnection network. In our proposed protocol, data blocks move between the switches in order to minimize the memory access time. We also develop a migration policy for data blocks not only to minimize the average memory response time but also to minimize the overhead in locating a specific memory block in case of a cache miss. We use two variations of our proposed protocol, the first allows caches to be only in the caching switches in the second of the interconnection network, while the first allows the caches to be in any switch of the interconnection network. We use simulation to evaluate the performance of our protocol and compare it with two multiple copy cache coherence protocols designed for systems employing multistage interconnection networks. The simulation results indicate that our proposed protocol outperforms the distributed write and distributed invalidate protocols for a wide range of memory access patterns.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.001 | 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".