| 2007 |
|---|
| 42 | | Feng Zhang,
Lester Lipsky:
Modelling Restricted Processor Sharing in a Computer System with Non-Exponential Service Times.
Computers and Their Applications 2007: 325-330 |
| 41 | | Marwan S. Sleiman,
Lester Lipsky:
Multi-tier data access and hierarchical memory optimization.
ISCA PDCS 2007: 30-35 |
| 40 | EE | Kannikar Siriwong,
Lester Lipsky,
Reda A. Ammar:
Study of Bursty Internet Traffic.
NCA 2007: 53-60 |
| 39 | | Feng Zhang,
Lester Lipsky:
An Analytical Model for Computer Systems with Non-Exponential Service Times and Memory Thrashing Overhead.
PDPTA 2007: 144-150 |
| 2006 |
|---|
| 38 | | Marwan S. Sleiman,
Lester Lipsky,
Kishori M. Konwar:
Performance modeling of hierarchical memories.
CAINE 2006: 54-59 |
| 37 | | Kishori M. Konwar,
Lester Lipsky,
Marwan S. Sleiman:
Moments of Memory Access Time for Systems With Hierarchical Memories.
Computers and Their Applications 2006: 103-109 |
| 36 | EE | Marwan S. Sleiman,
Lester Lipsky,
Robert Sheahan:
Dynamic resource allocation of computer clusters with probabilistic workloads.
IPDPS 2006 |
| 35 | | Feng Zhang,
Lester Lipsky:
Modelling Restricted Processor Sharing.
PDPTA 2006: 353-359 |
| 34 | EE | Robert Sheahan,
Lester Lipsky,
Pierre M. Fiorini,
Søren Asmussen:
On the completion time distribution for tasks that must restart from the beginning if a failure occurs.
SIGMETRICS Performance Evaluation Review 34(3): 24-26 (2006) |
| 2005 |
|---|
| 33 | EE | Robert Sheahan,
Lester Lipsky,
Pierre M. Fiorini:
The Effect of Different Failure Recovery Procedures on the Distribution of Task Completion Times.
IPDPS 2005 |
| 32 | | Kannikar Siriwong,
Lester Lipsky,
Reda A. Ammar:
Multiple Hop Jitter Controlled Quality of Service with Measurement Based Admission Control.
ISCA PDCS 2005: 135-140 |
| 31 | EE | Sarah Tasneem,
Lester Lipsky,
Reda A. Ammar,
Howard A. Sholl:
Using Residual Times to Meet Deadlines in M/G/C Queues.
NCA 2005: 128-138 |
| 30 | EE | Ahmed M. Mohamed,
Lester Lipsky,
Reda A. Ammar:
Modeling parallel and distributed systems with finite workloads.
Perform. Eval. 60(1-4): 303-325 (2005) |
| 29 | EE | Pierre M. Fiorini,
Robert Sheahan,
Lester Lipsky:
On unreliable computing systems when heavy-tails appear as a result of the recovery procedure.
SIGMETRICS Performance Evaluation Review 33(2): 15-17 (2005) |
| 2004 |
|---|
| 28 | EE | Ahmed M. Mohamed,
Lester Lipsky,
Reda A. Ammar:
ABSTRACT: Many Applications of Mobile Ad Hoc.
ICPADS 2004: 513-520 |
| 27 | EE | Ahmed M. Mohamed,
Lester Lipsky,
Reda A. Ammar:
Modeling Parallel and Distributed Systems with Finite Workloads.
IPDPS 2004 |
| 26 | | Ahmed M. Mohamed,
Lester Lipsky,
Reda A. Ammar:
Analytical Performance Analysis for Parallel and Distributed Systems with Non-Exponential Service Centers.
ISCA PDCS 2004: 172-177 |
| 25 | EE | Imad Antonios,
Lester Lipsky:
On the Relationship Between Packet Size and Router Performance for Heavy-Tailed Traffic.
NCA 2004: 235-242 |
| 2003 |
|---|
| 24 | | Ahmed M. Mohamed,
Lester Lipsky,
Reda A. Ammar:
Performance Modeling of a Cluster of Workstations.
Communications in Computing 2003: 227-233 |
| 23 | | Ahmed M. Mohamed,
Reda A. Ammar,
Lester Lipsky:
Efficient Data Allocation for a Cluster of Workstations.
ISCA PDCS 2003: 99-104 |
| 22 | EE | Imad Antonios,
Lester Lipsky:
A Performance Model and Analysis of Heterogeneous Traffic with Heavy Tails.
NCA 2003: 367-373 |
| 21 | EE | Ahmed M. Mohamed,
Lester Lipsky,
Reda A. Ammar:
Transient Model for Jackson Networks and Its Approximation.
OPODIS 2003: 198-209 |
| 20 | | Saira Kazmi,
Lester Lipsky:
Analytic Performance Model of P Fault-Prone Parallel Processors Running N Deterministically Distributed Tasks.
PDPTA 2003: 1339-1345 |
| 19 | | Pierre M. Fiorini,
Lester Lipsky:
Availability Versus Performance.
PDPTA 2003: 1352-1358 |
| 18 | | Robert W. Rowan,
Pierre M. Fiorini,
Lester Lipsky:
Assessing the Performability of Computing Systems Subject to Failure and Repair Using Non-Exponentially Distributed Task Times.
PDPTA 2003: 1363-1372 |
| 2002 |
|---|
| 17 | EE | Gehan Weerasinghe,
Imad Antonios,
Lester Lipsky:
A Generalized Analytic Performance Model of Distributed Systems that Perform N Tasks Using P Fault-Prone Processors.
IPDPS 2002 |
| 2001 |
|---|
| 16 | | Gehan Weerasinghe,
Lester Lipsky:
A distributed fault-tolerant asynchronous algorithm for performing N tasks.
Computers and Their Applications 2001: 69-73 |
| 15 | EE | Lester Lipsky,
Manfred R. Jobmann,
Michael Greiner,
Hans-Peter Schwefel:
Comparison of the Analytic N-Burst Model with Other Approximations to Telecommunications Traffic.
NCA 2001: 122-132 |
| 14 | EE | Gehan Weerasinghe,
Imad Antonios,
Lester Lipsky:
An Analytic Performance Model of Parallel Systems that Perform N Tasks Using P Processors That Can Fail.
NCA 2001: 310-319 |
| 13 | | Hans-Peter Schwefel,
Lester Lipsky:
Impact of aggregated, self-similar ON/OFF traffic on delay in stationary queueing models (extended version).
Perform. Eval. 43(4): 203-221 (2001) |
| 1998 |
|---|
| 12 | | Pierre M. Fiorini,
Yiping Ding,
Lester Lipsky:
On Modeling and Characterizing 'Self-Similar' Data Traffic.
Int. CMG Conference 1998: 874-885 |
| 1997 |
|---|
| 11 | EE | Mark Crovella,
Lester Lipsky:
Long-Lasting Transient Conditions in Simulations with Heavy-Tailed Workloads.
Winter Simulation Conference 1997: 1005-1012 |
| 1996 |
|---|
| 10 | | Yiping Ding,
Tao Zhang,
Lester Lipsky:
On The Performance Of Parallel Computers: Order Statistics, Amdahl's Law and Their Applications.
Int. CMG Conference 1996: 408-419 |
| 9 | | Lester Lipsky:
Modelling Telecommunications Systems That Have Power-Tail (Bursty, Chaotic, Heavy-Tail, Self-Similar, etc.) Traffic.
Int. CMG Conference 1996: 532-553 |
| 1990 |
|---|
| 8 | EE | Lester Lipsky,
Dilip Tagare,
Edward Bigos:
Evaluation of Queuing System Parameters Using Linear Algebraic Queuing Theory - an Implementation.
SIGSMALL/PC Symposium 1990: 199-204 |
| 1989 |
|---|
| 7 | | Lester Lipsky,
Sharad C. Seth:
Signal Probabilities in AND-OR Trees.
IEEE Trans. Computers 38(11): 1558-1563 (1989) |
| 1986 |
|---|
| 6 | EE | Appie van de Liefvoort,
Lester Lipsky:
A matrix-algebraic solution to two Km servers in a loop.
J. ACM 33(1): 207-223 (1986) |
| 1983 |
|---|
| 5 | | Sharad C. Seth,
Lester Lipsky:
A Simplified Method to Calculate Failure Times in Fault-Tolerant Systems.
IEEE Trans. Computers 32(8): 754-760 (1983) |
| 1980 |
|---|
| 4 | | Lester Lipsky:
A Study of Time Sharing Systems Considered as Queueing Networks of Exponential Servers.
Comput. J. 23(4): 290-297 (1980) |
| 1978 |
|---|
| 3 | | Lester Lipsky,
James D. Church:
Surveyor's Forum: Putting Costs Through Effectively: Author's Reply.
ACM Comput. Surv. 10(1): 83-84 (1978) |
| 1977 |
|---|
| 2 | | Lester Lipsky:
Comparison of Performance Measurements of a Computer System with a Queueing Model.
International Computing Symposium 1977: 461-466 |
| 1 | | Lester Lipsky,
James D. Church:
Applications of a Queueing Network Model for a Computer System.
ACM Comput. Surv. 9(3): 205-221 (1977) |
