Bibliographic record
Abstract
Datacenters are vitally important in the information era in which we currently live. Datacenters are the key enabler of cloud computing, and host many important applications including web service and machine learning. To deliver superior application performance, it is imperative to carefully design and optimize networks in datacenters. we improve the network design in datacenters at two granularities. At the high level, we optimize datacenter networks to better handle collective communication and network failures. At a lower level, we propose sampled approaches to enable fast and accurate evaluation for Network-on-Chips (NoCs) that are widely used in Chip-Multiprocessors (CMPs).\nCurrent datacenters rely on IP multicast and TCP incast to support collective communication, or one-to-many and many-to-one traffic. However, they struggle to meet the latency, throughput and scalability requirements posed by modern datacenters. We present McLink and rMcLink, an efficient and scalable collective communication solution. In McLink, we distribute multicast packets in a table-free, tree-based manner. rMcLink aggregates incast packets on-the-fly as they travel towards their destination, reducing network bandwidth consumed by incast traffic. Our simulation results show that McLink reduces multicast packet delay by 16%, and rMcLink improves incast TCP flow finish time by 82%.\nDatacenter networks are subject to failures. In this work, we design a fault-tolerant routing protocol, GatewayPath. We propose a graph-partitioning based algorithm to forward packets around failures. It also allows further optimization to be applied towards shortest path or load balance. Our evaluation shows that GatewayPath improves convergence time by more than 80%; meanwhile the packet delay is on par with that of a traditional link-state fault-tolerant routing protocol.\nFor CMPs used in datacenter servers, full system simulations are widely used to evaluate their performance. Full system simulations are accurate but prohibitively slow, limiting the range and depth of design space exploration. We focus on accelerating NoC simulation via the use of sampling techniques. We propose NoCLabs and NoCPoint, two sampling methodologies utilizing statistical sampling theory and traffic phase behavior, respectively. Experimental results show that NoCLabs and NoCPoint estimate NoC performance with an average error of 7% while achieving one order of magnitude speedup.
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.001 |
| 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".