登入選單
返回Google圖書搜尋
出版Weizmann Institute of Science, Department of Applied Mathematics and Computer Science, 1993
URLhttp://books.google.com.hk/books?id=N39OtwAACAAJ&hl=&source=gbs_api
註釋Abstract: "Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing: messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until it reaches its destination. A trend in multicomputer architecture, however, is to use wormhole routing. In wormhole routing a message is transmitted as a contiguous stream of bits, physically occupying a sequence of nodes/edges in the network. Thus, a message resembles a worm burrowing through the network. In this paper we give theoretical analyses of simple wormhole routing algorithms, showing them to be nearly optimal for butterfly and mesh connected networks. Our analysis requires initial random delays in injecting messages to the network.