traffic such that the sum of all travel times—the total latency—is minimized. In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes

synthetic traffic and traces from the SPLASH-2 benchmark suite show reduction in packet latency by up to 77.1 % with upto 39.6 % reduction in average router energy consumption as compared to a state-of-theart baseline packet-switched design. For the same saturation throughput as the baseline network, TFC

) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100 % of messages with reasonable aggregate resource consumption

assignment (see table 1), and generates essential covers, off-set covers and privileged pair sets for outputs and state variables. The logic minimization is performed by the exact logic minimizer described in the previous section. In the future research, we plan to extend the burst mode specifications to allow don’t care inputs in the input bursts and provide the capability to handle the input choices based on “levelsensitive” conditional signals. Acknowledgement The authors would like to thank Steve Nowick of Stanford University for generously providing the logic minimizer and many helpful discussions.

to selfishly route traffic on minimumlatency paths. The quality of a routing of traffic is measured by the sum of travel times, also called the total latency. The outcome of selfish routing—a Nash equilibrium—does not in general minimize the total latency; hence, selfish behavior carries the cost of decreased

Given a tour visiting n points in a metric space, the latency of one of these points p is the distance traveled in the tour before reaching p. The minimum latency problem asks for a tour passing through n given points for which the total latency of the n points is minimum; in effect, we

bandwidth utilization by applying some traditional disk scheduling techniques. We have analyzed these techniques, which attempt to optimize head movement and guarantee fairness in response time, in the presence of long disk queues. We then propose two algorithms which take rotational latency into account

This paper makes the case that pin bandwidth will be a critical consideration for future microprocessors. We show that many of the techniques used to tolerate growing memory latencies do so at the expense of increased bandwidth requirements. Using a decomposition of execution time, we show

There are a lot of routing protocols that minimize the total latency of the network. These have the drawback of causing too high latency for some traffic. The goal of this paper is to suggest an approach that takes into account not only the total latency but also the greatest latency in the network

, and generalized optimization strategies. Key to performance on this platform is using massive multithreading to utilize the large number of cores and hide global memory latency. To achieve this, developers face the challenge of striking the right balance between each thread’s resource usage and the number