21) What is a star network?
Answer: In a star-connected network, one processor acts as the central processor. Every other processor has a communication link connecting it to this processor.
22) What is a linear array?
Answer: A linear array is a static network in which each node (except the two nodes at the ends) has two neighbors, one each to its left and right.
23) What is Diameter?
Answer: The diameter of a network is the maximum distance between any two processing nodes in the network. The distance between two processing nodes is defined as the shortest path (in terms of number of links) between them.
24) What Connectivity?
Answer: The connectivity of a network is a measure of the multiplicity of paths between any two processing nodes. A network with high connectivity is desirable, because it lowers contention for communication resources.
25) What is Bisection-Width?
Answer: The bisection width of a network is defined as the minimum number of communication links that must be removed to partition the network into two equal halves.
26) What is Bisection Bandwidth?
Answer: The bisection bandwidth of a network is defined as the minimum volume of communication allowed between any two halves of the network. It is the product of the bisection width and the channel bandwidth. Bisection bandwidth of a network is also sometimes referred to as cross-section bandwidth.
27) What is start up time?
Answer: The startup time is the time required to handle a message at the sending and receiving nodes. This includes the time to prepare the message (adding header, trailer, and error correction information), the time to execute the routing algorithm, and the time to establish an interface between the local node and the router. This delay is incurred only once for a single message transfer.
28) What is per-hop time?
Answer: After a message leaves a node, it takes a finite amount of time to reach the next node in its path. The time taken by the header of a message to travel between two directly-connected nodes in the network is called the per-hop time. It is also known as node latency.
29) What is per word transfer time?
Answer: If the channel bandwidth is r words per second, then each word takes time tw = 1/r to traverse the link. This time is called the per-word transfer time. This time includes network as well as buffering time.
30) In order to optimize the cost of message transfer what we have to do?
Answer:
1. Communicate in bulk. That is, instead of sending small messages and paying a startup cost ts for each, we want to aggregate small messages into a single large message and amortize the startup latency across a larger message. This is because on typical platforms such as clusters and message-passing machines, the value of ts is much larger than those of th or tw.
2. Minimize the volume of data. To minimize the overhead paid in terms of per-word transfer time tw, it is desirable to reduce the volume of data communicated as much as possible.
3. Minimize distance of data transfer. Minimize the number of hops l that a message must traverse.
Comments
Post a Comment
Please share your opinions and suggestions or your experience in the comments section. This way we can all help each other...
Experienced guys can share their resumes at admin@interview-made-easy.com