Brent N. Chun, Alan M. Mainwaring, and David E. Culler. Virtual network transport protocols for myrinet. IEEE Micro, January/February 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Overhead Analysis of Preemptive Gang Scheduling - Hori, Tezuka, Ishikawa (1998) (11 citations) (Correct)
....processes. At the same time, communication interface hardware is getting faster every year causing problems with system call overheads. To tackle this problem, there are several user level communication proposals which allow users to access communication interfaces directly[PLC95,vEBV95,THIS97,CMC97] User level communication provides high performance communication, however, it introduces a new problem when implementing gang scheduling. First, the network interface status must be saved and restored when switching processes. Second, some messages that should be received by a process before ....
....skew can not be observed by SCore D. Comparing Figure 5 and Figure 6, we find that the overhead (slowdown) of the CG program is the highest, while the gang scheduling time of FT programs is the longest. We are now investigating these points. 6 Concluding Remarks U Net[vEBV95] and AM II[CMC97] support endpoints similar to PM s channel to provide multiplexed, virtualized networks. If there were a sufficient number of channels (endpoints) there would be no need of network preemption when 0 2 4 6 8 10 12 14 16 18 Overhead [ 0 16 32 48 64 Number of Processors (EP) 0 2 ....
[Article contains additional citation context not shown here]
Brent N. Chun, Alan M. Mainwaring, and David E. Culler. Virtual Network Transport Protocols for Myrinet. In Hot Interconnect'97, August 1997.
Network Performance with Distributed Memory Scientific Applications - Petrini (1998) (Correct)
....class of k ary n trees [12] The design is based on a butterfly multistage network with processing nodes attached on a 3 single side of the network and has the property that the overall communication bandwidth remains constant at each level. An example of asymmetric fat tree is the Berkeley NOW [13]. While the direct interconnection networks as the cubes typically have a fixed amount of communication fabric (a single router for each processing node) the indirect ones, as the fat trees, separate the number of processing nodes and routing devices. So it is possible to design the network ....
Brent N. Chum, Alan M. Mainwaring, and David E. Culler. Virtual Network Transport Protocols for Myrinet. In Hot Interconnects V, Stanford University, Stanford, CA, August 1997.
Market-based Cluster Resource Management - Chun (2001) (2 citations) Self-citation (Chun) (Correct)
No context found.
Brent N. Chun, Alan M. Mainwaring, and David E. Culler. Virtual network transport protocols for myrinet. IEEE Micro, January/February 1998.
Efficient, Protected Extension of Commodity Operating Systems - Ghormley (1998) Self-citation (Culler) (Correct)
No context found.
Brent Chun, Alan Mainwaring, and David Culler. Virtual Network Transport Protocols for Myrinet. In Proceedings of the 5th Hot Interconnects Conference, August 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC