default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLester Lipsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j23]Hans-Peter Schwefel, Imad Antonios
, Lester Lipsky:
On the Calculation of Time Alignment Errors in Data Management Platforms for Distribution Grid Data. Sensors 21(20): 6903 (2021)
2010 – 2019
- 2019
- [c47]Imad Antonios, Hans-Peter Schwefel, Lester Lipsky:
Approximation of the Time Alignment Error for Measurements in Electricity Grids. EDCC 2019: 153-158 - 2018
- [c46]Hans-Peter Schwefel, Imad Antonios, Lester Lipsky:
Impact of time interval alignment on data quality in electricity grids. SmartGridComm 2018: 1-7 - 2017
- [j22]Hans-Peter Schwefel, Imad Antonios, Lester Lipsky:
Understanding the relationship between network traffic correlation and queueing behavior: A review based on the N-Burst ON/OFF model. Perform. Evaluation 115: 68-91 (2017) - 2015
- [j21]Pierre M. Fiorini, Lester Lipsky:
Exact Analysis of Some Split-Merge Queues. SIGMETRICS Perform. Evaluation Rev. 43(2): 51-53 (2015) - 2014
- [c45]Søren Asmussen, Lester Lipsky, Stephen Thompson:
Checkpointing in Failure Recovery in Computing and Data Transmission. ASMTA 2014: 253-272 - 2013
- [c44]Lester Lipsky, Daniel P. Lopresti, George Nagy:
Optimal policy for labeling training samples. DRR 2013: 865809 - [c43]Xian Chen, Lester Lipsky, Kyoungwon Suh, Bing Wang, Wei Wei:
Session lengths and IP address usage of smartphones in a university campus WiFi network: Characterization and analytical models. IPCCC 2013: 1-9 - 2012
- [j20]Pierre M. Fiorini, Lester Lipsky:
Search marketing traffic and performance models. Comput. Stand. Interfaces 34(6): 517-526 (2012) - 2010
- [j19]Sarah Tasneem, Reda A. Ammar, Lester Lipsky, Howard A. Sholl:
Improvement of Real-Time Job Completion Using Residual Time-Based (RTB) Scheduling. Int. J. Comput. Their Appl. 17(3): 117-132 (2010) - [j18]Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howard A. Sholl:
A Residual Time Based Scheduling: Performance Modeling in M/G/C Queueing Applications. J. Softw. Eng. Appl. 3(8): 746-755 (2010) - [c42]Derek Doran, Lester Lipsky, Steve Thompson:
Cost-Based Optimization of Buffer Size in M/G/1/N Systems under Different Service-Time Distributions. NCA 2010: 28-35 - [c41]Imad Antonios, Reetu Dhar, Feng Zhang, Lester Lipsky:
A Performance Model of Gossip-Based Update Propagation. NCA 2010: 125-131
2000 – 2009
- 2009
- [c40]Sarah Tasneem, Reda A. Ammar, Lester Lipsky, Howard A. Sholl:
Performance Enhancement of Web Server System. CATA 2009: 1-6 - [c39]Feng Zhang, Lester Lipsky, Sarah Tasneem, Steve Thompson:
Comparison of Strategies for Serving Two Streams of Jobs. CATA 2009: 111-116 - [c38]Steve Thompson, Lester Lipsky, Sarah Tasneem, Feng Zhang:
Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead. NCA 2009: 60-65 - [c37]Feng Zhang, Sarah Tasneem, Lester Lipsky, Steve Thompson:
Analysis of round-robin variants: favoring newly arrived jobs. SpringSim 2009 - 2008
- [j17]Søren Asmussen, Pierre M. Fiorini, Lester Lipsky, Tomasz Rolski, Robert Sheahan:
Asymptotic Behavior of Total Times for Jobs That Must Start Over if a Failure Occurs. Math. Oper. Res. 33(4): 932-944 (2008) - 2007
- [c36]Marwan S. Sleiman, Lester Lipsky:
Multi-tier data access and hierarchical memory optimization. PDCS 2007: 30-35 - [c35]Feng Zhang, Lester Lipsky:
Modelling Restricted Processor Sharing in a Computer System with Non-Exponential Service Times. CATA 2007: 325-330 - [c34]Kannikar Siriwong, Lester Lipsky, Reda A. Ammar:
Study of Bursty Internet Traffic. NCA 2007: 53-60 - [c33]Feng Zhang, Lester Lipsky:
An Analytical Model for Computer Systems with Non-Exponential Service Times and Memory Thrashing Overhead. PDPTA 2007: 144-150 - 2006
- [j16]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 Perform. Evaluation Rev. 34(3): 24-26 (2006) - [c32]Marwan S. Sleiman, Lester Lipsky, Kishori M. Konwar:
Performance modeling of hierarchical memories. CAINE 2006: 54-59 - [c31]Kishori M. Konwar, Lester Lipsky, Marwan S. Sleiman:
Moments of Memory Access Time for Systems With Hierarchical Memories. CATA 2006: 103-109 - [c30]Marwan S. Sleiman, Lester Lipsky, Robert Sheahan:
Dynamic resource allocation of computer clusters with probabilistic workloads. IPDPS 2006 - [c29]Feng Zhang, Lester Lipsky:
Modelling Restricted Processor Sharing. PDPTA 2006: 353-359 - 2005
- [j15]Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar:
Modeling parallel and distributed systems with finite workloads. Perform. Evaluation 60(1-4): 303-325 (2005) - [j14]Pierre M. Fiorini, Robert Sheahan, Lester Lipsky:
On unreliable computing systems when heavy-tails appear as a result of the recovery procedure. SIGMETRICS Perform. Evaluation Rev. 33(2): 15-17 (2005) - [c28]Kannikar Siriwong, Lester Lipsky, Reda A. Ammar:
Multiple Hop Jitter Controlled Quality of Service with Measurement Based Admission Control. PDCS 2005: 135-140 - [c27]Robert Sheahan, Lester Lipsky, Pierre M. Fiorini:
The Effect of Different Failure Recovery Procedures on the Distribution of Task Completion Times. IPDPS 2005 - [c26]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 - 2004
- [c25]Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar:
Analytical Performance Analysis for Parallel and Distributed Systems with Non-Exponential Service Centers. PDCS 2004: 172-177 - [c24]Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar:
ABSTRACT: Many Applications of Mobile Ad Hoc. ICPADS 2004: 513-520 - [c23]Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar:
Modeling Parallel and Distributed Systems with Finite Workloads. IPDPS 2004 - [c22]Imad Antonios, Lester Lipsky:
On the Relationship Between Packet Size and Router Performance for Heavy-Tailed Traffic. NCA 2004: 235-242 - 2003
- [j13]Pierre M. Fiorini, Lester Lipsky:
Availability versus Performance. Int. J. Comput. 2(1): 98-105 (2003) - [c21]Ahmed M. Mohamed, Reda A. Ammar, Lester Lipsky:
Efficient Data Allocation for a Cluster of Workstations. PDCS 2003: 99-104 - [c20]Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar:
Performance Modeling of a Cluster of Workstations. Communications in Computing 2003: 227-233 - [c19]Imad Antonios, Lester Lipsky:
A Performance Model and Analysis of Heterogeneous Traffic with Heavy Tails. NCA 2003: 367-373 - [c18]Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar:
Transient Model for Jackson Networks and Its Approximation. OPODIS 2003: 198-209 - [c17]Saira Kazmi, Lester Lipsky:
Analytic Performance Model of P Fault-Prone Parallel Processors Running N Deterministically Distributed Tasks. PDPTA 2003: 1339-1345 - [c16]Pierre M. Fiorini, Lester Lipsky:
Availability Versus Performance. PDPTA 2003: 1352-1358 - [c15]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
- [c14]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
- [j12]Hans-Peter Schwefel, Lester Lipsky:
Impact of aggregated, self-similar ON/OFF traffic on delay in stationary queueing models (extended version). Perform. Evaluation 43(4): 203-221 (2001) - [c13]Gehan Weerasinghe, Lester Lipsky:
A distributed fault-tolerant asynchronous algorithm for performing N tasks. CATA 2001: 69-73 - [c12]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 - [c11]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
1990 – 1999
- 1999
- [j11]Michael Greiner, Manfred R. Jobmann, Lester Lipsky:
The Importance of Power-Tail Distributions for Modeling Queueing Systems. Oper. Res. 47(2): 313-326 (1999) - 1998
- [c10]Pierre M. Fiorini, Yiping Ding, Lester Lipsky:
On Modeling and Characterizing 'Self-Similar' Data Traffic. Int. CMG Conference 1998: 874-885 - 1997
- [c9]Mark Crovella, Lester Lipsky:
Long-Lasting Transient Conditions in Simulations with Heavy-Tailed Workloads. WSC 1997: 1005-1012 - 1996
- [c8]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 - [c7]Lester Lipsky:
Modelling Telecommunications Systems That Have Power-Tail (Bursty, Chaotic, Heavy-Tail, Self-Similar, etc.) Traffic. Int. CMG Conference 1996: 532-553 - 1993
- [j10]Lester Lipsky:
Book review: Introduction to Computer System Performance Evaluation by Krishna Kant (McGraw-Hill, 1992). SIGMETRICS Perform. Evaluation Rev. 21(2): 7-9 (1993) - [j9]Aby Tehranipour, Lester Lipsky:
A comparison of three switching schemes in isotropic networks with noisy channels. IEEE Trans. Commun. 41(5): 782-792 (1993) - 1992
- [c6]Lester Lipsky, Shard Garg, Mary Ann Robbert:
The effect of power-tail distributions on response times in time-sharing computer systems. SAC 1992: 719-723 - 1991
- [c5]Yiping Ding, Howard A. Sholl, Lester Lipsky:
Approximations of the mean resequencing waiting time in M/GI/c systems. ICDCS 1991: 28-35 - 1990
- [c4]Lester Lipsky, Dilip Tagare, Edward Bigos:
Evaluation of Queuing System Parameters Using Linear Algebraic Queuing Theory - an Implementation. SIGSMALL/PC Symposium 1990: 199-204
1980 – 1989
- 1989
- [j8]Lester Lipsky, Sharad C. Seth:
Signal Probabilities in AND-OR Trees. IEEE Trans. Computers 38(11): 1558-1563 (1989) - [c3]Reda A. Ammar, Howard A. Sholl, Bin Qin, Lester Lipsky, Jose Munoz:
An architecture assessment environment for massively parallel computations. SMC 1989: 600-605 - [c2]Haiping Yang, Lester Lipsky:
The approximation of density functions for use in queueing theory. SMC 1989: 612-617 - 1986
- [j7]Appie van de Liefvoort, Lester Lipsky:
A matrix-algebraic solution to two Km servers in a loop. J. ACM 33(1): 207-223 (1986) - 1985
- [j6]Lester Lipsky:
Explicit Solutions of M/G/C/ /N-type Queueing Loops with Generalizations. Oper. Res. 33(4): 911-927 (1985) - 1983
- [j5]Sharad C. Seth, Lester Lipsky:
A Simplified Method to Calculate Failure Times in Fault-Tolerant Systems. IEEE Trans. Computers 32(8): 754-760 (1983) - 1982
- [j4]J. L. Carroll, Appie van de Liefvoort, Lester Lipsky:
Solutions of M/G/1//N-type Loops with Extensions to M/G/1 and GI/M/1 Queues. Oper. Res. 30(3): 490-514 (1982) - 1980
- [j3]Lester Lipsky:
A Study of Time Sharing Systems Considered as Queueing Networks of Exponential Servers. Comput. J. 23(4): 290-297 (1980)
1970 – 1979
- 1978
- [j2]Lester Lipsky, James D. Church:
Surveyor's Forum: Putting Costs Through Effectively: Author's Reply. ACM Comput. Surv. 10(1): 83-84 (1978) - 1977
- [j1]Lester Lipsky, James D. Church:
Applications of a Queueing Network Model for a Computer System. ACM Comput. Surv. 9(3): 205-221 (1977) - [c1]Lester Lipsky:
Comparison of Performance Measurements of a Computer System with a Queueing Model. International Computing Symposium 1977: 461-466
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
