|
7703
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1491
|
A generalized processor sharing approach to flow control in integrated services networks: The single-node case
– Parekh, Gallager
- 1993
|
|
1257
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
989
|
Analysis and Simulation of A Fair Queueing Algorithm
– Demers, Keshav, et al.
- 1989
|
|
863
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
666
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
540
|
A Calculus for Network Delay, Part I: Network Elements in Isolation
– Cruz
- 1991
|
|
525
|
Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks
– Zhang
- 1991
|
|
489
|
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
– Chernoff
- 1952
|
|
444
|
An introduction to disk drive modeling
– Ruemmler, Wilkes
- 1994
|
|
402
|
Queueing Systems
– Kleinrock
- 1975
|
|
359
|
Reversibility and Stochastic Networks
– Kelly
- 1979
|
|
319
|
The hungarian method for the assignment problem
– Kuhn
- 1955
|
|
288
|
A calculus for network delay, part II: network analysis
– Cruz
- 1991
|
|
278
|
An Engineering Approach to Computer Networking
– Keshav
- 1997
|
|
253
|
Bounds for certain multiprocessing anomalies
– Graham
- 1966
|
|
253
|
Unix disk access patterns
– Ruemmler, Wilkes
- 1993
|
|
244
|
Sequencing and scheduling: Algorithms and complexity
– Lawler, Lenstra, et al.
- 1993
|
|
231
|
Throughput competitive on-line routing
– Awerbuch, Azar, et al.
- 1993
|
|
225
|
New directions in communications (or which way to the information age
– Turner
- 1986
|
|
211
|
Disk Scheduling Revisited
– Seltzer, Chen, et al.
- 1990
|
|
171
|
File system design for an NFS file server appliance
– Hitz, Lau, et al.
- 1994
|
|
168
|
Non-Volatile Memory for Fast, Reliable File Systems
– Baker, Asami, et al.
- 1992
|
|
159
|
A decomposition theorem for partially ordered sets
– Dilworth
- 1950
|
|
152
|
Disk scheduling algorithms based on rotational position
– Jacobson, Wilkes
- 1991
|
|
146
|
A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node
– Elwalid, Mitra, et al.
- 1995
|
|
132
|
Scheduling Algorithms for Modern Disk Drives
– Worthington, Ganger, et al.
- 1994
|
|
131
|
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
– Stiliadis, Varma
- 1996
|
|
128
|
On-line extraction of SCSI disk drive parameters
– Worthington, Ganger, et al.
- 1995
|
|
123
|
Universal Stability Results for Greedy Contention-Resolution Protocols
– Andrews, Awerbuch, et al.
- 1996
|
|
115
|
Adversarial queueing theory
– Borodin, Kleinberg, et al.
- 1996
|
|
114
|
On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing
– Aspnes, Azar, et al.
- 1993
|
|
107
|
On-line load balancing
– Azar, Broder, et al.
- 1992
|
|
103
|
Packet routing and job-shop scheduling in O(congestion + dilation) steps
– Leighton, Maggs, et al.
- 1994
|
|
102
|
New algorithms for an ancient scheduling problem
– Bartal, Fiat, et al.
- 1992
|
|
89
|
A Comparative Analysis of Disk Scheduling Policies
– Teorey, Pinkerton
- 1972
|
|
87
|
The competitiveness of on-line assignments
– Azar, Naor, et al.
- 1992
|
|
75
|
A Continuum of Disk Scheduling Algorithms
– Geist, Daniel
- 1987
|
|
71
|
Competitive Routing of Virtual Circuits with Unknown Duration
– Awerbuch, Azar, et al.
- 1994
|
|
68
|
Average case analysis of greedy routing algorithms on arrays
– Leighton
- 1990
|
|
64
|
A better algorithm for an ancient scheduling problem
– Karger, Phillips, et al.
- 1996
|
|
63
|
On-line load balancing of temporary tasks
– Azar, Kalyanasundaram, et al.
- 1993
|
|
61
|
Ten lectures on the probabilistic method
– Spencer
- 1987
|
|
56
|
Fast algorithms for finding O(congestion + dilation) packet routing schedules
– Leighton, Maggs, et al.
- 1999
|
|
53
|
A detailed simulation model of the HP 97560 disk drive
– Kotz, Toh, et al.
- 1994
|
|
51
|
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
– Frieze, Galbiati, et al.
- 1982
|
|
47
|
Routing and Admission Control in General Topology Networks with Poisson Arrivals
– Kamath, Palmon, et al.
- 1996
|
|
46
|
Distributed packet switching in arbitrary networks
– Rabani, Tardos
- 1996
|
|
46
|
The Efficiency of Greedy Routing in Hypercubes and Butterflies
– Stamoulis, Tsitsiklis
- 1994
|
|
38
|
Online load balancing and network flow
– Phillips, Westbrook
- 1993
|
|
