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