| Data center disaggregation: when and how much? | 0 | 0.34 | 2022 |
| First-come-first-served queues with multiple servers and customer classes. | 1 | 0.34 | 2019 |
| A Study of Systems with Multiple Operating Levels, Probabilistic Thresholds and Hysteresis. | 1 | 0.35 | 2018 |
| Multi-server preemptive priority queue with general arrivals and service times. | 1 | 0.34 | 2017 |
| Performance Evaluation of Cloud Computing Centers with General Arrivals and Service. | 10 | 0.57 | 2016 |
| Predicting the System Performance by Combining Calibrated Performance Models of its Components: A Preliminary Study. | 3 | 0.39 | 2016 |
| Breaking the dimensionality curse in multi-server queues. | 1 | 0.37 | 2016 |
| A Note on the Accuracy of Several Existing Approximations for M/Ph/m Queues | 3 | 0.47 | 2013 |
| A Recurrent Solution Of Ph/M/C/N-Like And Ph/M/C-Like Queues | 4 | 0.58 | 2012 |
| An approximate solution for Ph/Ph/1 and Ph/Ph/1/N queues | 0 | 0.34 | 2012 |
| A Tool for Solving Ph/M/c and Ph/M/c/N Queues | 0 | 0.34 | 2012 |
| Performance evaluation of a single node with general arrivals and service | 1 | 0.37 | 2011 |
| Preliminary Results on a Simple Approach to G/G/c-Like Queues | 3 | 0.41 | 2009 |
| Considerations in Workload Characterization for Parallel Access Volumes. | 1 | 0.42 | 2009 |
| Higher-order distributional properties in closed queueing networks | 3 | 0.42 | 2009 |
| A Note on the Effects of Service Time Distribution in the M/G/1 Queue | 1 | 0.35 | 2009 |
| Note sur les temps de service résiduels dans les systèmes type M/G/c | 0 | 0.34 | 2008 |
| A conditional probability approach to M/G/1-like queues | 6 | 0.52 | 2008 |
| Exploring landmark placement strategies for topology-based localization in wireless sensor networks | 7 | 0.63 | 2008 |
| Towards an automatic modeling tool for observed system behavior | 4 | 0.53 | 2007 |
| A model of periodic acknowledgement | 0 | 0.34 | 2003 |
| An Approach to Modeling FICON Channel Performance | 0 | 0.34 | 2003 |
| A note on SCSI bus waits | 1 | 0.39 | 2002 |
| Insight through simplicity | 0 | 0.34 | 2002 |
| A Study of Cached RAID5 I/O | 1 | 0.48 | 1994 |
| ASPECTS OF THE SOLUTION OF SOME MULTICLASS LOSS SYSTEMS | 2 | 0.46 | 1993 |
| Performance Benefits of Parallelism in Cached DASD Controllers | 0 | 0.34 | 1989 |
| Load imbalance in DASD dynamic reconnection | 0 | 0.34 | 1988 |
| Modeling DASDs and Disk Caches | 1 | 0.36 | 1986 |
| Equivalence And Decomposition In Queuing-Systems - A Unified Approach | 24 | 2.80 | 1985 |
| Efficient approximation for models of multiprogramming with shared domains | 7 | 0.60 | 1984 |
| Aspects of DASD Performance | 1 | 0.79 | 1983 |
| A study of dynamic reconnection | 3 | 4.18 | 1983 |
| Fast approximate solution of multiprogramming models | 15 | 1.34 | 1982 |
| A Study of a Mechanism for Controlling Multiprogrammed Memory in an Interacitve System | 2 | 0.82 | 1981 |
| Models Of Dasd Subsystems - Basic Model Of Reconnection | 12 | 4.07 | 1981 |
| Further results on equivalence and decomposition in queueing network models | 2 | 1.03 | 1980 |
| A scheme for a fault-tolerant virtual memory | 0 | 0.34 | 1980 |
| Overview of the ARCADE system | 1 | 0.43 | 1979 |
| Arcade — a system for research and education in computer architecture | 1 | 0.38 | 1978 |
| A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions | 5 | 0.83 | 1977 |
| A Study of a Page-On-Demand System | 2 | 2.41 | 1977 |
| A Model of a Virtual Memory System. | 3 | 0.63 | 1976 |
| A Model of a Time-Sharing System with two Classes of Processes | 3 | 0.58 | 1975 |
| Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system | 4 | 0.59 | 1974 |
| A model of a time sharing virtual memory system solved using equivalence and decomposition methods | 27 | 7.48 | 1974 |
| Gestion Optimale d'un Ordinateur Multiprogramme à Mémoire Virtuelle | 2 | 1.61 | 1973 |
