Mor Harchol-Balter  Home/Search
Context
Related
| cmu.edu/~harchol/Thesi...mythesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~harchol/Thesis/thesis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Network Analysis Without Exponentiality Assumptions by Mor Harchol-Balter Doctor of Philosophy in Computer Science University of California at Berkeley Professor Manuel Blum, Chair Theoretical analysis of networks often relies on exponentiality assumptions which are unrealistic but necessary for mathematical tractability. In some cases these assumptions are inconsequential, but in others their adoption may lead to invalid results. (Update)
Similar documents (at the sentence level):
15.5%: Exploiting Process Lifetime Distributions for Dynamic Load .. - Harchol-Balter, Downey (1996) (Correct)
Active bibliography (related documents): More All
2.0: Bounding Delays in Packet-Routing Networks - Harchol-Balter, Wolfe (1995) (Correct)
1.5: In Network of Queues, M/M/1 Can Outperform M/D/1 - Harchol-Balter, Wolfe (1994) (Correct)
0.7: ? - Harchol-Balter, Wolfe (1994) (Correct)
Similar documents based on text: More All
0.4: Determining Performance of a Wafer Fabrication Facility by.. - Phojanamongkolkij (Correct)
0.3: Couplings and Asymptotic Exponentiality of Exit Times - Brassesco, Olivieri, Vares (1998) (Correct)
0.3: On the Prequential Approach for Testing Exponentiality - Aroui (Correct)
BibTeX entry: (Update)
@misc{ harchol-balter-network,
author = "Mor Harchol-Balter",
title = "Network Analysis Without Exponentiality Assumptions",
url = "citeseer.ist.psu.edu/493361.html" }
Citations (may not include all citations):692 the selfsimilar nature of Ethernet traffic - Leland, Taqqu et al. - 1994
579 Self-similarity in world wide web traffic: Evidence and caus.. - Crovella, Bestavros - 1996
566 Condor - a hunter of idle workstations (context) - Litzkow, Livny et al. - 1988
367 Computer Architecture A Quantitative Approach (context) - Hennessy, Patterson - 1990
334 Operating System Concepts (context) - Silberschatz, Peterson et al. - 1994
331 Stochastic Processes (context) - Ross - 1983
266 Adaptive load sharing in homogeneous distributed systems (context) - Eager, Lazowska et al. - 1986
248 Lottery scheduling: Flexible proportionalshare resource mana.. - Waldspurger, Weihl - 1994
241 Transparent process migration: Design alternatives and the s.. - Douglis, Ousterhout - 1991
160 Introduction to Probability Models (context) - Ross - 1989
145 Universal schemes for parallel communication (context) - Valiant, Brebner - 1981
143 Stochastic Modeling and the Theory of Queues (context) - Wolff - 1989
140 Experiences with the Amoeba distributed operating system - Tanenbaum, adn et al. - 1990
134 A scheme for fast parallel communication (context) - Valiant - 1982
123 Preemptable remote execution facilities for the V-System (context) - Theimer, Lantz et al. - 1985
109 Load-balancing heuristics and process behavior (context) - Leland, Ott - 1986
101 Introduction to Queueing Networks (context) - Walrand - 1989
93 Designing a process migration facility: The Charlotte experi.. - Artsy, Finkel - 1989
86 Experience with the Condor distributed batch system (context) - Litzkow, Livny - 1990
85 Attacking the process migration bottleneck (context) - Zayas - 1987
84 Universal packet routing algorithms (context) - Leighton, Maggs et al. - 1988
79 Analysis of an ATM buffer with self-similar (context) - Likhanov, Tsybakov et al. - 1995
76 The limited performance benefits of migrating active process.. (context) - Eager, Lazowska et al. - 1988
73 Mpvm: A migration transparent version of pvm - Casas, Clark et al. - 1995
69 Average case analysis of greedy routing algorithms on arrays (context) - Leighton - 1990
66 The influence of different workload descriptions on a heuris.. - Kunz - 1991
63 Stochastic Models of Manufacturing Systems (context) - Buzacott, Shanthikumar - 1993
62 Utopia: a load-sharing facility for large heterogeneous dist.. - Zhou, Wang et al. - 1993
59 An introduction to mathematical statistics and its applicati.. (context) - Larsen, Marx - 1986
57 Efficient schemes for parallel communication (context) - Upfal - 1984
56 Methods for message routing in parallel machines (context) - Leighton - 1992
54 Job-shop-like queueing systems (context) - Jackson - 1963
49 Queueing Systems Volume II: Computer Applications (context) - Kleinrock - 1976
46 Randomized routing on fat-trees - Greenberg, Leiserson - 1985
45 The efficiency of greedy routing in hypercubes and butterfli.. (context) - Stamoulis, Tsitsiklis - 1994
44 Networks of waiting lines (context) - Jackson - 1957
43 Load balancing in homogeneous broadcast distributed systems (context) - Livny, Melman - 1982
42 Fast algorithms for bitserial routing on a hypercube - Aiello, Leighton et al. - 1990
42 and mixed networks of queues with different classes of custo.. (context) - Baskett, Chandy et al. - 1975
40 Personal Communication (context) - Shanthikumar - 1996
40 A comparison of preemptive and non-preemptive load distribut.. (context) - Krueger, Livny - 1988
40 Adaptive load sharing in heterogeneous distributed systems (context) - Mirchandaney, Towsley et al. - 1990
33 Greedy dynamic routing on arrays - Kahale, Leighton - 1995
32 Bounds on greedy routing algorithm for array networks - Mitzenmacher - 1994
31 A stable distributed scheduling algorithm (context) - Bryant, Finkel - 1981
30 Location independent remote execution in NEST (context) - Agrawal, Ezzet - 1987
29 Adaptive optimal load balancing in a nonhomogeneous multiser.. (context) - Bonomi, Kumar - 1990
26 Proces migration DEMOMP (context) - Miller, in et al. - 1983
25 The generalized packet routing problem (context) - Peleg, Upfal - 1987
25 Performance studies for dynamic load balancing in distribute.. (context) - Zhou - 1987
24 Randomized parallel communication (context) - Aleliunas - 1982
24 The greedy load sharing algorithm (context) - Chowdhury - 1990
23 Networks of queues with customers of different types (context) - Kelly - 1975
22 Personal Communication (context) - Prouty - 1996
21 and robust extension of operating system functionality (context) - Vahdat, Ghormley et al. - 1994
21 Analysis of three dynamic distributed loadbalancing strategi.. (context) - Casavant, Kuhl - 1987
20 LSBATCH: A distributed load sharing batch system - Wang, Zhou et al. - 1993
19 Average delay in queues with non-stationary Poisson arrivals (context) - Ross - 1978
18 the sojourn time of sessions at an ATM buffer with long-rang.. (context) - Anantharam - 1995
17 Dynamic load balancing in a distributed system using a sende.. (context) - Ha'c, Jin - 1990
14 RHODOS--a testbed for studying design issues in distributed .. (context) - Gerrity, Goscinski et al. - 1991
13 Optimality of a two-phase strategy for routing in interconne.. (context) - Valiant - 1983
12 The probability of load balancing success in a homogeneous n.. (context) - Rommel - 1991
12 A measurement study of load balancing performance (context) - Zhou, Ferrari - 1987
11 Personal Communication (context) - Walrand - 1994
11 Dynamic load balancing using task-transfer probabilites (context) - Evans, Butt - 1993
11 an intelligent load sharing filter (context) - Svensson - 1990
11 Load sharing in distributed systems (context) - Wang, Morris - 1985
10 Extremal properties of the fifo discipline in queueing netwo.. (context) - Righter, Shanthikumar - 1992
9 MOSIX Distributed Operating SystemLoad Balancing UNIX (context) - Guday, Richard et al. - 1993
9 Imbedding gradient estimators in load balancing algorithms (context) - Pulidas, Towsley et al. - 1988
8 Locus operating system (context) - Thiel - 1991
8 Performance prediction of distributed load balancing on mult.. (context) - Ahmad, Ghafoor et al. - 1991
7 Personal Communication (context) - Braverman - 1995
7 Continuous routing and batch routing on the hypercube (context) - Chang, Simon - 1986
7 The limited performance benefits of migrating active process.. (context) - Downey, Harchol-Balter et al. - 1995
7 Open queueing systems in light traffic (context) - Reiman, Simon - 1989
6 The effect of service time regularity on system performance (context) - Wolff - 1977
6 Personal Communication (context) - Ferrari - 1994
6 Personal Communication (context) - Kleinrock - 1994
5 An analysis of decay-usage scheduling in multiprocessors (context) - Epema - 1995
4 Comparison conjectures about the M=G=s queue (context) - Whitt - 1983
4 Determining a computing center environment (context) - Rosin - 1965
4 The effect of variability in the GI=G=s queue (context) - Whitt - 1980
4 Load Distribution: Implementation for the Mach Microkernel (context) - Milojicic - 1993
4 Towards a better understanding of pure packet routing (context) - Borodin - 1993
4 Minimizing delays in the GI=G=1 queue (context) - Whitt - 1984
4 Light traffic limits of sojourn time distributions in markov.. (context) - Reiman, Simon - 1988
3 Personal Communication (context) - Vahdat - 1995
3 Processor-ring communication: A tight asymptotic bound on pa.. - Coffman, Kahale et al. - 1995
3 A performance comparison of adaptive and static load balanci.. (context) - Zhang, Hakozaki et al. - 1995
2 Bounding delays in packet-routing networks - Harchol-Balter, Wolfe - 1995
2 A state-aggregation method for analyzing dynamic load-balanc.. (context) - Lin, Raghavendra - 1993
1 The Berkeley Interactive Statistics System (context) - Norton - 1988
1 Upper bound on the average delay in arbitrary interconnectio.. (context) - Ziv, Bruck
1 Is queueing theory dead (context) - Koenigsberg - 1991
1 Bounding delays in packet-routing networks with light traffi.. - Harchol-Balter - 1995
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC