Results 1 - 10
of
1,277
How bad is selfish routing?
- JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract
-
Cited by 657 (27 self)
- Add to MetaCart
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
Token flow control
"... As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design with route ..."
Abstract
-
Cited by 635 (35 self)
- Add to MetaCart
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
Epidemic routing for partially-connected ad hoc networks
, 2000
"... Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination ..."
Abstract
-
Cited by 358 (0 self)
- Add to MetaCart
) 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
Specification Implementation States / Primary State Product Terms Literals Cycle Transitions In Out Vars Output Total Output Total Latency Time
, 1973
"... 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 specificatio ..."
Abstract
- Add to MetaCart
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.
The price of anarchy is independent of the network topology
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 2002
"... We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to ..."
Abstract
-
Cited by 217 (17 self)
- Add to MetaCart
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
An Improved Approximation Ratio for the Minimum Latency Problem
- Mathematical Programming
, 1996
"... 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 are seekin ..."
Abstract
-
Cited by 89 (2 self)
- Add to MetaCart
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
Disk Scheduling Revisited
- In Proceedings of the USENIX Winter Technical Conference (USENIX Winter ’90
, 1990
"... Since the invention of the movable head disk, people have improved I/O performance by intelligent scheduling of disk accesses. We have applied these techniques to systems with large memories and potentially long disk queues. By viewing the entire buffer cache as a write buffer, we can improve disk b ..."
Abstract
-
Cited by 227 (12 self)
- Add to MetaCart
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
Memory bandwidth limitations of future microprocessors
- IN PROCEEDINGS OF THE 23RD ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE
, 1996
"... 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 that for ..."
Abstract
-
Cited by 226 (12 self)
- Add to MetaCart
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
ROUTING PROTOCOLS WITH SMALLEST MAXIMAL LATENCY
, 2005
"... 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. ..."
Abstract
- Add to MetaCart
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
Optimization Principles and Application Performance Evaluation of a Multithreaded GPU Using CUDA
- PPOPP'08
, 2008
"... GPUs have recently attracted the attention of many application developers as commodity data-parallel coprocessors. The newest generations of GPU architecture provide easier programmability and increased generality while maintaining the tremendous memory bandwidth and computational power of tradition ..."
Abstract
-
Cited by 215 (11 self)
- Add to MetaCart
, 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
Results 1 - 10
of
1,277