The successful retaining of the gob‐side entry under a thick and hard roof stratum is difficult because of the high pressure present and complex construction technology commonly used. To solve this problem, a new type of gob‐side entry supporting system is proposed in this paper. This system is mainly composed of concrete‐filled steel tubular columns (CSTCs), flexible cushion, and gob isolation structures. This new supporting system combines the high‐strength support of CSTCs with the flexible support of cushion bodies and is simple to construct, enabling fast and efficient gob‐side entry retaining under a thick and hard roof stratum. The range of the roof strata controlled by gob‐side support structures is determined for a case study, and a calculation formula for the gob‐side support resistance is established. Through theoretical and experimental research, a reasonable calculation formula for the choice of CSTC is also established. The CSTC structure ultimately selects Φ194 × 8 mm hollow steel tubes and C40 grade concrete for use in a field application, which can provide 4814 kN of supporting force. A simple on‐site construction process is designed for the field application, and the time required for entry retaining per meter is only approximately 40‐45 minutes. This application shows that the new technology controls the deformation of the retained entry very well; the final deformation stabilizes at 412 mm, which meets the engineering requirements.

No abstract

Endpoint congestion is one of the most challenging issues when designing low latency and high bandwidth on-chip interconnection networks. Tree saturation and head-ofline blocking caused by the endpoint congestion seriously decrease system throughput and increases network latency, leading to overall performance degradation. Adaptive routing algorithms utilize dynamic network states to route packets around congestion areas and potentially mitigate network congestions, but still cannot deal with endpoint congestions. Existing adaptive routing algorithms mainly take the current route information into account, and rarely use the route information of past packets. In this paper, we explore the route information of past packets, and led to the following novel observations that the virtual channel (VC) allocations of prior packets can be collected as useful information, and the tree saturation can be isolated through better VC selection strategy based on the past route information. Based on this observation, a novel history-aware adaptive routing algorithm for endpoint congestion, HARE, is proposed to improve network performance. We implement HARE based on the state-of-the-art routing algorithm, Footprint, and conduct extensive simulation experiments to compare it with our algorithm. The evaluation results show that our design alleviate the impact of tree saturation consistently and achieve high throughput on both synthetic and trace-driven workloads.

No abstract

No abstract