网格是多计算机中应用广泛的直连结构，提出了一种新的互连结构──对角网格．并在这种结构上提出了一类自适应无死锁的路由算法──负优先算法，证明了此算法的无死锁性．对角网格是可平面图，其结构简单，可扩充性非常好．它的每个节点的度数是固定的，便于VLSI工艺实现．负优先自适应路由算法的突出优点是对硬件逻辑要求简单，无须增加虚拟通道即可达到无死锁和自适应． Grid is a widely used direct-connect structure in multi-computer. A new interconnection structure is proposed-diagonal grid. In this structure, a class of adaptive deadlock free routing algorithm - negative first algorithm is proposed, which proves that this algorithm has no deadlock. Diagonal grid is a plan view, its structure is simple, scalability is very good. The degree of each of its nodes is fixed, which facilitates VLSI process implementation. Negative-priority adaptive routing algorithm has the salient advantages of simple hardware logic requirements, without adding a virtual channel to achieve deadlock-free and adaptive.