Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Michael D. Noakes"'
Autor:
John S. Keen, G. A. Fyler, Richard Lethin, Michael D. Noakes, William J. Dally, R. E. Davison, P.R. Nuth, J.A.S. Fiske
Publikováno v:
IEEE Micro. 12:23-39
The message-driven processor (MDP), a 36-b, 1.1-million transistor, VLSI microcomputer, specialized to operate efficiently in a multicomputer, is described. The MDP chip includes a processor, a 4096-word by 36-b memory, and a network port. An on-chip
Autor:
D.B. Gaunce, P.R. Nuth, Waldemar Horwat, J.A.S. Fiske, Michael D. Noakes, G. A. Fyler, Deborah A. Wallach, William J. Dally, R. E. Davison, Richard Lethin, John S. Keen, D.S. Wills, Ellen Spertus, Brian Totty, S. Furman, S. Kaneshiro, Andrew A. Chien
Publikováno v:
Computing Systems in Engineering. 3:7-15
Most modern computers, whether parallel or sequential, are coarse grained. They are composed of physically large nodes with tens of megabytes of memory. Only a small fraction of the silicon area in the machine is devoted to computation. By increasing
Publikováno v:
IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.
The authors present novel algorithms for adaptive routing and link assignment, which can be used in a large-scale network (1000-10000 nodes) with dynamic topology and stress. Special attention was given to performance (delay, throughput, and survivab
Publikováno v:
MILCOM 88, 21st Century Military Communications - What's Possible?'. Conference record. Military Communications Conference.
An algorithm is presented responsible for determining the network connectivity by finding schedules for establishing and disconnecting high-bandwidth satellite crosslinks that use directional antennas. The context is for a stressed satellite network.
Autor:
P.R. Nuth, G. A. Fyler, J.A.S. Fiske, Richard Lethin, Waldemar Horwat, Michael D. Noakes, John S. Keen, Andrew A. Chien, William J. Dally, D.S. Wills
Publikováno v:
ICCD
A description is given of the Message-Driven Processor (MDP), an integrated multicomputer node. It incorporates a 36-bit integer processor, a memory management unit, a router for a 3D mesh network, a network interface, a 4K*36-bit word static RAM (SR
Publikováno v:
Digest of Papers. Compcon Spring.
The authors discuss the architecture of the J-Machine and evaluate the effectiveness of the mechanisms embodied in the message-driven processor (MDP). The J-Machine is a fine-grained distributed memory multicomputer that provides low-overhead mechani
Autor:
Stuart Fiske, D. Scott Wills, Deborah A. Wallach, Waldemar Horwat, Richard Lethin, Michael D. Noakes, Andrew A. Chien, John S. Keen, Ellen Spertus, Andrew Chang, William J. Dally, P.R. Nuth
Publikováno v:
25 Years ISCA: Retrospectives and Reprints
Publikováno v:
ISCA
The MIT J-Machine multicomputer has been constructed to study the role of a set of primitive mechanisms in providing efficient support for parallel computing. Each J-Machine node consists of an integrated multicomputer component, the Message-Driven P
Publikováno v:
SPIE Proceedings.
This paper discusses link-assignment and adaptive routing algorithms that have been developed for networks consisting of a large number of mobile nodes having directive links. We focus on the special case where data rates are large (tens of Mbits/sec
Publikováno v:
MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality.
This paper presents an adaptive routing algorithm for a mid-course, space-based SDI architecture. The goals include rapid recovery from both predictable and unpredictable outages as well as load balancing. Robust operation is critical. The routing ta