• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 67,247
Next 10 →

Table 3: Support for adding metadata to some protocols. We have implementations for the protocols in italics. Protocol Metadata Comment

in X-trace: A pervasive network tracing framework
by Rodrigo Fonseca, George Porter, Randy H. Katz, Scott Shenker, Ion Stoica 2007
"... In PAGE 7: ... In the implementation of Chord that comes with I3 we had to create a new type of message. Table3 gives details on adding metadata to these and some other protocols. (ii) Propagation Applications must support two as- pects of X-Trace identifier propagation: (a) carry- ing X-Trace metadata between incoming and outgo- ing messages, and (b) manipulating the metadata with pushDown() and pushNext() operations to cor- rectly record the causal relations.... ..."
Cited by 7

Table 2: Translation of MPI communication modes to internal protocols.

in MPI-LAPI: An Efficient Implementation of MPI for IBM RS/6000 SP Systems
by Mohammad Banikazemi, Rama K Govindaraju, Robert Blackmore, Dhabaleswar K Panda
"... In PAGE 6: ... These four modes are usually implemented by using two internal protocols called Eager and Rendezvous protocols. The translation of the MPI communication modes into these internal protocols in our implementation is shown in Table2 . The Rendezvous protocol is used for large messages to avoid the potential bu er exhaustion caused by unexpected messages (whose receives have not been posted by the... ..."

Table 2. Translation of MPI communication modes to internal protocols.

in Implementing Efficient MPI on LAPI for IBM RS/6000 SP Systems: Experiences and Performance Evaluation
by Govindaraju Blackmore, Mohammad Banikazemi Rama, Dhabaleswar K Panda
"... In PAGE 3: ... These four modes are usually implemented by using two internal pro- tocols called Eager and Rendezvous protocols. The translation of the MPI communication modes into these internal protocols in our implementation is shown in Table2 . The Rendezvous protocol is used for large messages to avoid the potential buffer exhaustion caused by unexpected messages (whose receives have not been posted by the time they reach the destination).... ..."

Table 2. Translation of MPI communication modes to internal protocols.

in Implementing Efficient MPI on LAPI for IBM RS/6000 SP Systems: Experiences and Performance Evaluation
by Mohammad Banikazemi Rama, Rama K Govindaraju, Robert Blackmore, Dhabaleswar K Panda
"... In PAGE 3: ... These four modes are usually implemented by using two internal pro- tocols called Eager and Rendezvous protocols. The translation of the MPI communication modes into these internal protocols in our implementation is shown in Table2 . The Rendezvous protocol is used for large messages to avoid the potential buffer exhaustion caused by unexpected messages (whose receives have not been posted by the time they reach the destination).... ..."

Table 1 gives a summary of some interconnection technologies which are then compared as shown in table 2. The comparisons examine factors that include: bandwidth, latency, hardware availability, support for Linux, maximum number of cluster nodes supported, how the protocol is implemented, support for Virtual Interface Architecture (VIA), and support for Message Passing Interface (MPI). VIA [9] is a standard for low latency communication software interface that was developed by a consortium of hardware producers and academic institutions and has been adopted for use by most cluster vendors. MPI [10] provides message passing thru a set of libraries that users can use to develop parallel and distributed applications. This means that MPI provides the communication layer for user applications and thus ensures portability of application code across all distributed and parallel platforms.

in Cluster Computing: High-Performance, High-Availability, and High-Throughput Processing on a Network of Computers
by Chee Shin Yeo, Rajkumar Buyya, Hossein Pourreza, Rasit Eskicioglu, Peter Graham, Frank Sommers 2006
"... In PAGE 3: ...3 Table1 . Examples of some interconnection technologies.... ..."
Cited by 1

TABLE I OPTIMIZATIONPRINCIPLEPATTERNS FOR EFFICIENT PROTOCOL IMPLEMENTATIONS

in Optimizing a CORBA Inter-ORB Protocol (IIOP) Engine for Minimal Footprint Embedded Multimedia Systems
by Aniruddha Gokhale , Douglas C. Schmidt
Cited by 1

Table 2: Applications Used in the Experiments. Application Problem Description Messages Ckp Mesg Log

in RENEW: A Tool for Fast and Efficient Implementation of Checkpoint Protocols
by Nuno Neves , W. Kent Fuchs 1998
"... In PAGE 6: ...2 Applications and Environment Five long-running parallel applications were used in the experiments. Table2 presents, for each application, a de- scription of the problem solved, communication rates and average values for checkpoint size and time. The values shown in the last two columns correspond to average log... In PAGE 7: ... The first one is the most important, and it accounts for the major- ity of the difference between the times with and without checkpointing. For instance, on the SP application the to- tal overhead is 241 seconds, from which 202 seconds were spent on the writes (see Table2 ). In practice, this penalty can be even higher since writes were asynchronous2.... In PAGE 8: ... The cost of using this type of optimizationis that processes loose their autonomy to schedule their own checkpoints. The message logging protocol showed the worst per- formance due to the high message traffic of some applica- tions (see Table2 ). In two of the applications, BT and SP, the log had to be written to disk more than once between checkpoints.... ..."
Cited by 19

Table 2: Applications Used in the Experiments. Application Problem Description Messages Ckp Mesg Log

in RENEW: A Tool for Fast and Efficient Implementation of Checkpoint Protocols
by Nuno Neves, W. Kent Fuchs 1998
"... In PAGE 6: ...2 Applications and Environment Five long-running parallel applications were used in the experiments. Table2 presents, for each application, a de- scription of the problem solved, communication rates and average values for checkpoint size and time. The values shown in the last two columns correspond to average log... In PAGE 7: ... The first one is the most important, and it accounts for the major- ity of the difference between the times with and without checkpointing. For instance, on the SP application the to- tal overhead is 241 seconds, from which 202 seconds were spent on the writes (see Table2 ). In practice, this penalty can be even higher since writes were asynchronous2.... In PAGE 8: ... The cost of using this type of optimizationis that processes loose their autonomy to schedule their own checkpoints. The message logging protocol showed the worst per- formance due to the high message traffic of some applica- tions (see Table2 ). In two of the applications, BT and SP, the log had to be written to disk more than once between checkpoints.... ..."
Cited by 19

Table 1 Instruction count for sending and receiving an eight-byte message MPI implementation MPI_Send MPI_Recv Total

in MPICH2 using the Nemesis
by Darius Buntinas A, Guillaume Mercier B 2007
"... In PAGE 8: ... This ensured that the incoming message had arrived and was waiting at the receive queue when MPI_Recv was called. Table1 shows these results. All MPI implementations were compiled with the -O3 opti- 0 0 4 8 12 16 20 24 28 32 Number of Processes Fig.... ..."

Table 1: A comparison of three open telematics protocols: the Application Communication Protocol, Global Automotive Telematics Standards, and the Motorola Emergency Messaging System.

in unknown title
by unknown authors
"... In PAGE 7: ... MEMS is a protocol for ana- log AMPS networks. Table1 compares ACP, GATS, and MEMS. For standards activities and other rel- evant information, see Evolving Telematics Systems and Standards.... ..."
Next 10 →
Results 1 - 10 of 67,247
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University