Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Daw A and Yom-Tov G. (2024). Asymmetries of Service: Interdependence and Synchronicity. SSRN Electronic Journal. 10.2139/ssrn.4736977.

    https://www.ssrn.com/abstract=4736977

  • Parnass G, Levtzion-Korach O, Peres R, Assaf M and Kuo Y. (2023). Estimating emergency department crowding with stochastic population models. PLOS ONE. 10.1371/journal.pone.0295130. 18:12. (e0295130).

    https://dx.plos.org/10.1371/journal.pone.0295130

  • Somashekar G, Delasay M and Gandhi A. (2023). Efficient and accurate Lyapunov function-based truncation technique for multi-dimensional Markov chains with applications to discriminatory processor sharing and priority queues. Performance Evaluation. 162:C. Online publication date: 1-Nov-2023.

    https://doi.org/10.1016/j.peva.2023.102356

  • Li Y, Zhai X, Wang R, Zhu J and Yao C. (2023). Accumulating Priority Queue for Charging of Unmanned Aerial Vehicles in Cognitive Radio Networks 2023 6th International Symposium on Autonomous Systems (ISAS). 10.1109/ISAS59543.2023.10164390. 979-8-3503-1615-5. (1-6).

    https://ieeexplore.ieee.org/document/10164390/

  • Quadri C, Ceselli A and Rossi G. (2023). Multi-user edge service orchestration based on Deep Reinforcement Learning. Computer Communications. 203:C. (30-47). Online publication date: 1-Apr-2023.

    https://doi.org/10.1016/j.comcom.2023.02.027

  • Nambiar S, Mayorga M and Liu Y. (2022). Routing and staffing in emergency departments: A multiclass queueing model with workload dependent service times. IISE Transactions on Healthcare Systems Engineering. 10.1080/24725579.2022.2100522. 13:1. (46-61). Online publication date: 2-Jan-2023.

    https://www.tandfonline.com/doi/full/10.1080/24725579.2022.2100522

  • Islam F, Petriu D and Woodside M. (2022). Focused Layered Performance Modelling by Aggregation. ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 7:2-4. (1-23). Online publication date: 31-Dec-2022.

    https://doi.org/10.1145/3549539

  • Somashekar G, Delasay M and Gandhi A. (2022). Truncating Multi-Dimensional Markov Chains With Accuracy Guarantee 2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS). 10.1109/MASCOTS56607.2022.00024. 978-1-6654-5580-0. (121-128).

    https://ieeexplore.ieee.org/document/10053761/

  • Borkar V and Pattathil S. (2017). Whittle indexability in egalitarian processor sharing systems. Annals of Operations Research. 10.1007/s10479-017-2622-0. 317:2. (417-437). Online publication date: 1-Oct-2022.

    https://link.springer.com/10.1007/s10479-017-2622-0

  • Bermejo B and Juiz C. (2022). A general method for evaluating the overhead when consolidating servers: performance degradation in virtual machines and containers. The Journal of Supercomputing. 78:9. (11345-11372). Online publication date: 1-Jun-2022.

    https://doi.org/10.1007/s11227-022-04318-5

  • Haviv M and Kerner Y. (2022). Queueing with priorities and standard service: Stoppable and unstoppable servers. Stochastic Models. 10.1080/15326349.2022.2066130. (1-12).

    https://www.tandfonline.com/doi/full/10.1080/15326349.2022.2066130

  • Pender J and Zhang E. Uniting simulation and machine learning for response time prediction in processor sharing queues. Proceedings of the Winter Simulation Conference. (1-12).

    /doi/10.5555/3522802.3522849

  • Pender J and Zhang E. (2021). Uniting Simulation and Machine Learning For Response Time Prediction In Processor Sharing Queues 2021 Winter Simulation Conference (WSC). 10.1109/WSC52266.2021.9715461. 978-1-6654-3311-2. (1-12).

    https://ieeexplore.ieee.org/document/9715461/

  • Ahmadi M, Golkarifard M, Movaghar A and Yousefi H. Processor Sharing Queues With Impatient Customers and State-Dependent Rates. IEEE/ACM Transactions on Networking. 10.1109/TNET.2021.3091189. 29:6. (2467-2477).

    https://ieeexplore.ieee.org/document/9494719/

  • Ayimba C, Casari P and Mancuso V. SQLR: Short-Term Memory Q-Learning for Elastic Provisioning. IEEE Transactions on Network and Service Management. 10.1109/TNSM.2021.3075619. 18:2. (1850-1869).

    https://ieeexplore.ieee.org/document/9416291/

  • Goldstein B and Fitsov V. (2021). Dual Mathematical Model for Calculating of Deep Packet Inspection 2021 28th Conference of Open Innovations Association (FRUCT). 10.23919/FRUCT50888.2021.9347547. 978-9-5269-2444-1. (127-133).

    https://ieeexplore.ieee.org/document/9347547/

  • Spinelli F and Mancuso V. Toward Enabled Industrial Verticals in 5G: A Survey on MEC-Based Approaches to Provisioning and Flexibility. IEEE Communications Surveys & Tutorials. 10.1109/COMST.2020.3037674. 23:1. (596-630).

    https://ieeexplore.ieee.org/document/9257498/

  • Ravi G, Miguel J and Lipasti M. (2020). SHASTA. ACM Transactions on Architecture and Code Optimization. 17:4. (1-26). Online publication date: 31-Dec-2021.

    https://doi.org/10.1145/3412375

  • Dai J and Harrison J. (2020). Processing Networks

    https://www.cambridge.org/core/product/identifier/9781108772662/type/book

  • Montes J, Thomaszewski B, Mudur S and Popa T. (2020). Computational design of skintight clothing. ACM Transactions on Graphics. 39:4. (105:1-105:12). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3386569.3392477

  • Mehta D, Sotnychenko O, Mueller F, Xu W, Elgharib M, Fua P, Seidel H, Rhodin H, Pons-Moll G and Theobalt C. (2020). XNect. ACM Transactions on Graphics. 39:4. (82:1-82:17). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3386569.3392410

  • Ye H, Kwan K, Su W and Fu H. (2020). ARAnimator. ACM Transactions on Graphics. 39:4. (83:1-83:12). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3386569.3392404

  • Guo H, Liu X, Yan D and Liu Y. (2020). Cut-enhanced PolyCube-maps for feature-aware all-hex meshing. ACM Transactions on Graphics. 39:4. (106:1-106:14). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3386569.3392378

  • Scully Z, Harchol-Balter M and Scheller-Wolf A. (2020). Simple Near-Optimal Scheduling for the M/G/1. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 4:1. (1-29). Online publication date: 27-May-2020.

    https://doi.org/10.1145/3379477

  • Torres-Jr P, García-Martínez A, Bagnulo M and Parente Ribeiro E. (2020). Bartolomeu. Computer Networks: The International Journal of Computer and Telecommunications Networking. 169:C. Online publication date: 14-Mar-2020.

    https://doi.org/10.1016/j.comnet.2020.107117

  • Vis P, Bekker R, van der Mei R and Núñez-Queija R. (2020). Heavy-traffic limits for Discriminatory Processor Sharing models with joint batch arrivals. Operations Research Letters. 48:2. (136-141). Online publication date: 1-Mar-2020.

    https://doi.org/10.1016/j.orl.2020.01.004

  • Guillemin F and Rodriguez V. (2020). On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue. Stochastic Models. 10.1080/15326349.2020.1730191. (1-23).

    https://www.tandfonline.com/doi/full/10.1080/15326349.2020.1730191

  • Marin A, Rossi S and Sottana M. (2020). Dynamic Resource Allocation in Fork-Join Queues. ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 5:1. (1-28). Online publication date: 7-Feb-2020.

    https://doi.org/10.1145/3372376

  • Zhu L, Casale G and Perez I. (2020). Fluid approximation of closed queueing networks with discriminatory processor sharing. Performance Evaluation. 10.1016/j.peva.2020.102094. (102094). Online publication date: 1-Feb-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0166531620300146

  • Goldstein B and Fitsov V. (2020). The Mathematical Model for Calculating Physical Entity of DPI Analyser. Distributed Computer and Communication Networks: Control, Computation, Communications. 10.1007/978-3-030-66242-4_30. (382-393).

    http://link.springer.com/10.1007/978-3-030-66242-4_30

  • Somashekar G, Delasay M and Gandhi A. (2019). Tighter Lyapunov Truncation for Multi-Dimensional Continuous Time Markov Chains with Known Moments. ACM SIGMETRICS Performance Evaluation Review. 47:2. (33-35). Online publication date: 4-Dec-2019.

    https://doi.org/10.1145/3374888.3374901

  • Gardner K and Stephens C. (2019). Smart Dispatching in Heterogeneous Systems. ACM SIGMETRICS Performance Evaluation Review. 47:2. (12-14). Online publication date: 4-Dec-2019.

    https://doi.org/10.1145/3374888.3374894

  • Fooladivanda D and Rosenberg C. (2019). Joint User Association and Resource Allocation in Heterogeneous Cellular Networks: Comparison of Two Modeling Approaches 2019 31st International Teletraffic Congress (ITC 31). 10.1109/ITC31.2019.00018. 978-0-9883045-7-4. (66-74).

    https://ieeexplore.ieee.org/document/8879433/

  • Vikhrova O, Pizzi S, Sinitsyn I, Molinaro A, Iera A, Samuylov K and Araniti G. An Analytic Approach for Resource Allocation of IoT Multicast Traffic. Proceedings of the ACM MobiHoc Workshop on Pervasive Systems in the IoT Era. (25-30).

    https://doi.org/10.1145/3331052.3332474

  • Robert P and Véber A. (2019). A scaling analysis of a star network with logarithmic weights. Stochastic Processes and their Applications. 10.1016/j.spa.2018.06.002. 129:5. (1749-1781). Online publication date: 1-May-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0304414918302746

  • Abdulshakoor A, Elmesalawy M and Khalaf G. (2019). Proportional Traffic Splitting for Efficient LTE-WLAN Aggregation in Multi-RAT Heterogeneous Networks 2019 36th National Radio Science Conference (NRSC). 10.1109/NRSC.2019.8734576. 978-1-7281-0753-0. (242-248).

    https://ieeexplore.ieee.org/document/8734576/

  • Mehta A, Lakew E, Tordsson J and Elmroth E. (2018). Utility-based Allocation of Industrial IoT Applications in Mobile Edge Clouds 2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC). 10.1109/PCCC.2018.8711075. 978-1-5386-6808-5. (1-10).

    https://ieeexplore.ieee.org/document/8711075/

  • Vasantam T, Mukhopadhyay A and Mazumdar R. (2018). The mean-field behavior of processor sharing systems with general job lengths under the SQ( ) policy . Performance Evaluation. 10.1016/j.peva.2018.09.010. Online publication date: 1-Oct-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S0166531618302761

  • Lakew E, Birke R, Perez J, Elmroth E and Chen L. (2018). SmallTail: Scaling Cores and Probabilistic Cloning Requests for Web Systems 2018 IEEE International Conference on Autonomic Computing (ICAC). 10.1109/ICAC.2018.00013. 978-1-5386-5139-1. (31-40).

    https://ieeexplore.ieee.org/document/8498124/

  • Avrachenkov K and Bodas T. (2018). On the equivalence between multiclass processor sharing and random order scheduling policies. ACM SIGMETRICS Performance Evaluation Review. 45:4. (2-6). Online publication date: 28-Aug-2018.

    https://doi.org/10.1145/3273996.3273998

  • Kim S. (2017). Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers. Mathematical Methods of Operations Research. 10.1007/s00186-017-0623-z. 87:3. (411-430). Online publication date: 1-Jun-2018.

    http://link.springer.com/10.1007/s00186-017-0623-z

  • Scully Z, Harchol-Balter M and Scheller-Wolf A. (2018). SOAP. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2:1. (1-30). Online publication date: 3-Apr-2018.

    https://doi.org/10.1145/3179419

  • Guillemin F and Slim F. (2018). Sojourn time in an M / M /1 processor sharing queue with permanent customers . Stochastic Models. 10.1080/15326349.2017.1392868. 34:1. (115-137). Online publication date: 2-Jan-2018.

    https://www.tandfonline.com/doi/full/10.1080/15326349.2017.1392868

  • Sacoto-Cabrera E, Sanchis-Cano A, Guijarro L, Vidal J, Pla V and Marsa-Maestre I. (2018). Strategic Interaction between Operators in the Context of Spectrum Sharing for 5G Networks. Wireless Communications & Mobile Computing. 2018. Online publication date: 1-Jan-2018.

    https://doi.org/10.1155/2018/4308913

  • Marin A, Rossi S and Sottana M. (2018). Biased Processor Sharing in Fork-Join Queues. Quantitative Evaluation of Systems. 10.1007/978-3-319-99154-2_17. (273-288).

    http://link.springer.com/10.1007/978-3-319-99154-2_17

  • Artail H, El Halabi A, Hachem A and Al-Akhrass L. (2017). A framework for identifying the linkability between Web servers for enhanced internet computing and E-commerce. Journal of Internet Services and Applications. 10.1186/s13174-016-0053-9. 8:1. Online publication date: 1-Dec-2017.

    http://jisajournal.springeropen.com/articles/10.1186/s13174-016-0053-9

  • Sagkriotis S, Roumeliotis A, Papafragkakis A and Panagopoulos A. (2017). The impact of the system state on energy‐efficient transmission of multiple users' flows on the uplink. Transactions on Emerging Telecommunications Technologies. 10.1002/ett.3235. 28:12. Online publication date: 1-Dec-2017.

    https://onlinelibrary.wiley.com/doi/10.1002/ett.3235

  • Haldar K and Mishra B. (2016). Mathematical model on vulnerability characterization and its impact on network epidemics. International Journal of System Assurance Engineering and Management. 10.1007/s13198-016-0441-3. 8:2. (378-392). Online publication date: 1-Jun-2017.

    http://link.springer.com/10.1007/s13198-016-0441-3

  • Zhen Q, van Leeuwaarden J and Knessl C. (2016). On the sojourn time distribution in a finite population Markovian processor sharing queue. IMA Journal of Applied Mathematics. 10.1093/imamat/hxw006. 82:1. (33-59). Online publication date: 1-Feb-2017.

    https://academic.oup.com/imamat/article-lookup/doi/10.1093/imamat/hxw006

  • NIIDA S, TSUGAWA S, SUGANUMA M and WAKAMIYA N. (2017). A Survey on Modeling of Human States in Communication Behavior. IEICE Transactions on Communications. 10.1587/transcom.2016PFI0010. E100.B:9. (1538-1546).

    https://www.jstage.jst.go.jp/article/transcom/E100.B/9/E100.B_2016PFI0010/_article

  • Motie M and Savla K. (2016). Throughput analysis of a horizontal traffic queue under safe car following models 2016 IEEE 55th Conference on Decision and Control (CDC). 10.1109/CDC.2016.7799312. 978-1-5090-1837-6. (6771-6776).

    http://ieeexplore.ieee.org/document/7799312/

  • Li J, Agrawal K, Elnikety S, He Y, Lee I, Lu C and McKinley K. (2016). Work stealing for interactive services to meet target latency. ACM SIGPLAN Notices. 51:8. (1-13). Online publication date: 9-Nov-2016.

    https://doi.org/10.1145/3016078.2851151

  • Faraci G, Lombardo A and Schembra G. (2016). An Analytical Model to Design Processor Sharing for SDN/NFV Nodes 2016 28th International Teletraffic Congress (ITC 28). 10.1109/ITC-28.2016.213. 978-0-9883-0451-2. (28-34).

    http://ieeexplore.ieee.org/document/7810732/

  • Doumiati S and Artail H. (2016). Analytical study of a service discovery system based on an LTE-A D2D implementation. Physical Communication. 19:C. (145-162). Online publication date: 1-Jun-2016.

    https://doi.org/10.1016/j.phycom.2016.01.004

  • Jain M, Shekhar C and Shukla S. (2016). A time-shared machine repair problem with mixed spares under N-policy. Journal of Industrial Engineering International. 10.1007/s40092-015-0136-4. 12:2. (145-157). Online publication date: 1-Jun-2016.

    http://link.springer.com/10.1007/s40092-015-0136-4

  • Thorsdottir H and Verloop I. (2016). Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines. Queueing Systems: Theory and Applications. 83:1-2. (29-55). Online publication date: 1-Jun-2016.

    https://doi.org/10.1007/s11134-016-9477-y

  • Subramaniam K, Govindan K, Jaiswal S and Das Sunkada Gopinath S. (2016). Minimum complexity APP prioritization by bandwidth apportioning in smart phones 2016 IEEE Wireless Communications and Networking Conference (WCNC). 10.1109/WCNC.2016.7564972. 978-1-4673-9814-5. (1-6).

    http://ieeexplore.ieee.org/document/7564972/

  • Izagirre A, Ayesta U and Verloop I. (2016). Sojourn Time Approximations for a Discriminatory Processor Sharing Queue. ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 1:1. (1-31). Online publication date: 31-Mar-2016.

    https://doi.org/10.1145/2812807

  • Li J, Agrawal K, Elnikety S, He Y, Lee I, Lu C and McKinley K. Work stealing for interactive services to meet target latency. Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. (1-13).

    https://doi.org/10.1145/2851141.2851151

  • Chis T and Harrison P. Higher response time moments for M/M/1 discriminatory processor sharing queues. Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools. (145-148).

    https://doi.org/10.4108/eai.14-12-2015.2262730

  • Bejan A, Gibbens R, Hancock R and Towsley D. Capacity bounds and robustness in multipath networks. Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools. (9-16).

    https://doi.org/10.4108/eai.14-12-2015.2262625

  • Faraci G, Lombardo A and Schembra G. (2016). A processor-sharing scheduling strategy for NFV nodes. Journal of Electrical and Computer Engineering. 2016. (1-1). Online publication date: 1-Jan-2016.

    https://doi.org/10.1155/2016/3583962

  • Anselmi J and Walton N. (2016). Decentralized Proportional Load Balancing. SIAM Journal on Applied Mathematics. 76:1. (391-410). Online publication date: 1-Jan-2016.

    https://doi.org/10.1137/140969361

  • Samouylov K, Sopin E and Gudkova I. (2016). Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals. Distributed Computer and Communication Networks. 10.1007/978-3-319-51917-3_36. (406-417).

    http://link.springer.com/10.1007/978-3-319-51917-3_36

  • Samouylov K, Naumov V, Sopin E, Gudkova I and Shorgin S. (2016). Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server. Analytical and Stochastic Modelling Techniques and Applications. 10.1007/978-3-319-43904-4_20. (284-297).

    http://link.springer.com/10.1007/978-3-319-43904-4_20

  • Jelenković P and Skiani E. (2015). Instability of sharing systems in the presence of retransmissions. Queueing Systems: Theory and Applications. 81:2-3. (171-202). Online publication date: 1-Nov-2015.

    https://doi.org/10.1007/s11134-015-9440-3

  • Li S, Maddah-Ali M and Avestimehr A. (2015). Coded MapReduce 2015 53rd Annual Allerton Conference on Communication, Control and Computing (Allerton). 10.1109/ALLERTON.2015.7447112. 978-1-5090-1824-6. (964-971).

    http://ieeexplore.ieee.org/document/7447112/

  • Izagirre A, Ayesta U and Verloop I. (2015). Interpolation approximations for the steady-state distribution in multi-class resource-sharing systems. Performance Evaluation. 91:C. (56-79). Online publication date: 1-Sep-2015.

    https://doi.org/10.1016/j.peva.2015.06.005

  • Sonenberg N, Au G and Taylor P. (2015). A queueing model for the capacity planning of a multi-phase human services process. International Journal of Systems Science: Operations & Logistics. 10.1080/23302674.2015.1015660. 2:3. (156-167). Online publication date: 3-Jul-2015.

    http://www.tandfonline.com/doi/full/10.1080/23302674.2015.1015660

  • Wamser F, Blenk A, Seufert M, Zinner T, Kellerer W and Tran-Gia P. (2015). Modelling and performance analysis of application-aware resource management. Networks. 25:4. (223-241). Online publication date: 1-Jul-2015.

    https://doi.org/10.1002/nem.1894

  • Lakew E, Klein C, Hernandez-Rodriguez F and Elmroth E. Performance-based service differentiation in clouds. Proceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing. (505-514).

    https://doi.org/10.1109/CCGrid.2015.145

  • Chan Y, Guo J, Wong E and Zukerman M. (2015). Performance analysis for overflow loss systems of processor-sharing queues IEEE INFOCOM 2015 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2015.7218518. 978-1-4799-8381-0. (1409-1417).

    http://ieeexplore.ieee.org/document/7218518/

  • Govindan K and Azad A. (2015). End-to-end service assurance in IoT MQTT-SN 2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC). 10.1109/CCNC.2015.7157991. 978-1-4799-6390-4. (290-296).

    http://ieeexplore.ieee.org/document/7157991/

  • Yu M, Tang Y and Wu W. (2014). Individually and socially optimal joining rules for an egalitarian processor-sharing queue under different information scenarios. Computers and Industrial Engineering. 78:C. (26-32). Online publication date: 1-Dec-2014.

    /doi/10.5555/2946149.2946237

  • Durango J, Dellkrantz M, Maggio M, Klein C, Papadopoulos A, Hernandez-Rodriguez F, Elmroth E and Arzen K. (2014). Control-theoretical load-balancing for cloud applications with brownout 2014 IEEE 53rd Annual Conference on Decision and Control (CDC). 10.1109/CDC.2014.7040221. 978-1-4673-6090-6. (5320-5327).

    http://ieeexplore.ieee.org/document/7040221/

  • Yu M, Tang Y and Wu W. (2014). Individually and socially optimal joining rules for an egalitarian processor-sharing queue under different information scenarios. Computers & Industrial Engineering. 10.1016/j.cie.2014.09.022. 78. (26-32). Online publication date: 1-Dec-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0360835214002897

  • Doncel J, Ayesta U, Brun O and Prabhu B. (2014). A resource-sharing game with relative priorities. Performance Evaluation. 10.1016/j.peva.2014.07.018. 79. (287-305). Online publication date: 1-Sep-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0166531614000819

  • Hougaard J, Moreno-Ternero J and Østerdal L. (2014). Assigning agents to a line. Games and Economic Behavior. 10.1016/j.geb.2014.02.011. 87. (539-553). Online publication date: 1-Sep-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0899825614000426

  • Jelenkovic P and Skiani E. (2014). Is sharing with retransmissions causing instabilities?. ACM SIGMETRICS Performance Evaluation Review. 42:1. (167-179). Online publication date: 20-Jun-2014.

    https://doi.org/10.1145/2637364.2592001

  • Jelenkovic P and Skiani E. Is sharing with retransmissions causing instabilities?. The 2014 ACM international conference on Measurement and modeling of computer systems. (167-179).

    https://doi.org/10.1145/2591971.2592001

  • Grani P and Bartolini S. (2014). Design Options for Optical Ring Interconnect in Future Client Devices. ACM Journal on Emerging Technologies in Computing Systems. 10:4. (1-25). Online publication date: 1-May-2014.

    https://doi.org/10.1145/2602155

  • Murray J, Lu T, Wettin P, Pande P and Shirazi B. (2014). Dual-Level DVFS-Enabled Millimeter-Wave Wireless NoC Architectures. ACM Journal on Emerging Technologies in Computing Systems. 10:4. (1-27). Online publication date: 1-May-2014.

    https://doi.org/10.1145/2600074

  • Bobba S, Zhang J, Gaillardon P, Wong H, Mitra S and Micheli G. (2014). System Level Benchmarking with Yield-Enhanced Standard Cell Library for Carbon Nanotube VLSI Circuits. ACM Journal on Emerging Technologies in Computing Systems. 10:4. (1-19). Online publication date: 1-May-2014.

    https://doi.org/10.1145/2600073

  • Izagirre A, Ayesta U and Verloop I. (2014). Sojourn time approximations in a multi-class time-sharing server IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2014.6848228. 978-1-4799-3360-0. (2786-2794).

    http://ieeexplore.ieee.org/document/6848228/

  • Kim S. (2014). Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers. Journal of the Korean Statistical Society. 10.1016/j.jkss.2013.04.001. 43:1. (105-118). Online publication date: 1-Mar-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S122631921300029X

  • Cheikh H, Doncel J, Brun O and Prabhu B. Predicting Response Times of Applications in Virtualized Environments. Proceedings of the 2014 IEEE 3rd Symposium on Network Cloud Computing and Applications (ncca 2014). (83-90).

    https://doi.org/10.1109/NCCA.2014.21

  • Shi Y and Lian Z. (2013). Equilibrium strategy of a processor-sharing system with discriminatory discipline 2013 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). 10.1109/IEEM.2013.6962537. 978-1-4799-0986-5. (877-881).

    http://ieeexplore.ieee.org/document/6962537/

  • Mariani G, Palermo G, Zaccaria V and Silvano C. (2013). Design-space exploration and runtime resource management for multicores. ACM Transactions on Embedded Computing Systems. 13:2. (1-27). Online publication date: 1-Sep-2013.

    https://doi.org/10.1145/2514641.2514647

  • Theodoropoulos D, Kuzmanov G and Gaydadjiev G. (2013). Custom architecture for multicore audio beamforming systems. ACM Transactions on Embedded Computing Systems. 13:2. (1-26). Online publication date: 1-Sep-2013.

    https://doi.org/10.1145/2514641.2514646

  • Zhang Y, Ren S, Chen S, Tan B, Lim E and Yong K. DifferCloudStor: Differentiated Quality of Service for Cloud Storage. IEEE Transactions on Magnetics. 10.1109/TMAG.2013.2256885. 49:6. (2451-2458).

    http://ieeexplore.ieee.org/document/6522250/

  • Kanizo Y, Raz D and Zlotnik A. Efficient use of geographically spread cloud resources. Proceedings of the 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing. (450-457).

    https://doi.org/10.1109/CCGrid.2013.18

  • Zhen Q and Knessl C. (2012). On spectral properties of finite population processor shared queues. Mathematical Methods of Operations Research. 10.1007/s00186-012-0421-6. 77:2. (147-176). Online publication date: 1-Apr-2013.

    http://link.springer.com/10.1007/s00186-012-0421-6

  • Lee W and Wang C. (2012). CONDITIONAL SOJOURN TIMES OF PROCESSOR-SHARING QUEUES. Probability in the Engineering and Informational Sciences. 10.1017/S0269964812000320. 27:01. (99-114). Online publication date: 1-Jan-2013.

    http://www.journals.cambridge.org/abstract_S0269964812000320

  • Biro J, Bérczes T, Kő̈rösi A, Heszberger Z and Sztrik J. (2013). Discriminatory Processor Sharing from Optimization Point of View. Analytical and Stochastic Modeling Techniques and Applications. 10.1007/978-3-642-39408-9_6. (67-80).

    http://link.springer.com/10.1007/978-3-642-39408-9_6

  • Wu Y, Bui L and Johari R. Heavy Traffic Approximation of Equilibria in Resource Sharing Games. IEEE Journal on Selected Areas in Communications. 10.1109/JSAC.2012.121212. 30:11. (2200-2209).

    http://ieeexplore.ieee.org/document/6354278/

  • Adams A, Jacobs D, Dolson J, Tico M, Pulli K, Talvala E, Ajdin B, Vaquero D, Lensch H, Horowitz M, Park S, Gelfand N, Baek J, Matusik W and Levoy M. (2012). The Frankencamera. Communications of the ACM. 55:11. (90-98). Online publication date: 1-Nov-2012.

    https://doi.org/10.1145/2366316.2366339

  • Wegner J, Sterling A, Guha R, Bender A, Faulon J, Hastings J, O'Boyle N, Overington J, Van Vlijmen H and Willighagen E. (2012). Cheminformatics. Communications of the ACM. 55:11. (65-75). Online publication date: 1-Nov-2012.

    https://doi.org/10.1145/2366316.2366334

  • Greengard S. (2012). On the digital trail. Communications of the ACM. 55:11. (19-21). Online publication date: 1-Nov-2012.

    https://doi.org/10.1145/2366316.2366323

  • Geller T. (2012). Control without controllers. Communications of the ACM. 55:11. (16-18). Online publication date: 1-Nov-2012.

    https://doi.org/10.1145/2366316.2366322

  • BALASUNDARAM P, RAMADOSS A and MUTHAIYA M. (2012). IE browser compatibility for web applications. ACM SIGWEB Newsletter. 2012:Autumn. (1-15). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2362631.2362636

  • Kim S, Bak J and Oh A. (2012). "Discovering emotion influence patterns in online social network conversations" by Suin Kim, JinYeong Bak, and Alice Oh, with Ching-man Au Yeung as coordinator. ACM SIGWEB Newsletter. 2012:Autumn. (1-6). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2362631.2362634

  • Agarwal P, Cheng S and Yi K. (2012). Range searching on uncertain data. ACM Transactions on Algorithms. 8:4. (1-17). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2344422.2344433

  • He M, Munro J and Satti S. (2012). Succinct ordinal trees based on tree covering. ACM Transactions on Algorithms. 8:4. (1-32). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2344422.2344432

  • Chan T. (2012). All-pairs shortest paths for unweighted undirected graphs in o(mn) time. ACM Transactions on Algorithms. 8:4. (1-17). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2344422.2344424

  • Walton N. (2012). Flow-level Convergence and Insensitivity for Multi-class Queueing Networks. Stochastic Systems. 10.1287/11-SSY025. 2:1. (115-148). Online publication date: 1-Jun-2012.

    http://pubsonline.informs.org/doi/10.1287/11-SSY025

  • Eberle H and Olesinski W. (2012). Classes of service for daisy chain interconnects 2012 IEEE 13th International Conference on High Performance Switching and Routing (HPSR). 10.1109/HPSR.2012.6260842. 978-1-4577-0833-6. (147-153).

    http://ieeexplore.ieee.org/document/6260842/

  • Artail H, Fawaz K and Ghandour A. (2012). A Proxy-Based Architecture for Dynamic Discovery and Invocation of Web Services from Mobile Devices. IEEE Transactions on Services Computing. 5:1. (99-115). Online publication date: 1-Jan-2012.

    https://doi.org/10.1109/TSC.2010.49

  • Hoshi K, Komatsu N and Takahashi Y. (2012). A Cost-Equation Analysis of General-Input General-Service Processor Sharing System. Operations Research Proceedings 2011. 10.1007/978-3-642-29210-1_82. (515-520).

    https://link.springer.com/10.1007/978-3-642-29210-1_82

  • Wu Y, Bui L and Johari R. Heavy traffic approximation of equilibria in resource sharing games. Proceedings of the 7th international conference on Internet and Network Economics. (351-362).

    https://doi.org/10.1007/978-3-642-25510-6_30

  • Hyytiä E, Virtamo J, Aalto S and Penttinen A. (2011). M/M/1-PS queue and size-aware task assignment. Performance Evaluation. 68:11. (1136-1148). Online publication date: 1-Nov-2011.

    https://doi.org/10.1016/j.peva.2011.07.011

  • Hyytiä E, Penttinen A, Aalto S and Virtamo J. Dispatching problem with fixed size jobs and processor sharing discipline. Proceedings of the 23rd International Teletraffic Congress. (190-197).

    /doi/10.5555/2043468.2043499

  • Oi H and Takahashi K. Performance Modeling of a Consolidated Java Application Server. Proceedings of the 2011 IEEE International Conference on High Performance Computing and Communications. (834-838).

    https://doi.org/10.1109/HPCC.2011.118

  • Giannoulakis I, Kontovasilis K and Mitrou N. (2011). Sojourn time distributions and time scale separation results for multiclass state-dependent processor sharing systems with a finite service pool and exponential service requirements. Performance Evaluation. 68:7. (586-613). Online publication date: 1-Jul-2011.

    https://doi.org/10.1016/j.peva.2011.03.008

  • Verloop I, Ayesta U and Núòez-Queija R. (2011). Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing. Operations Research. 59:3. (648-660). Online publication date: 1-May-2011.

    https://doi.org/10.1287/opre.1110.0914

  • HOSHI K, SHIKATA Y, TAKAHASHI Y and KOMATSU N. (2011). Mean Approximate Formulas for GI/G/1 Processor-Sharing System. IEICE Transactions on Communications. 10.1587/transcom.E94.B.2247. E94-B:8. (2247-2253).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/transcom/E94.B.2247?from=CrossRef

  • Verloop I, Ayesta U and Borst S. (2010). Monotonicity Properties for Multi-Class Queueing Systems. Discrete Event Dynamic Systems. 20:4. (473-509). Online publication date: 1-Dec-2010.

    https://doi.org/10.1007/s10626-009-0069-4

  • Albayrak S, Sivrikaya F, Toker A and Khan M. (2010). User-Centric Convergence in Telecom Networks. Fixed Mobile Convergence Handbook. 10.1201/EBK1420091700-3. (29-50). Online publication date: 13-Sep-2010.

    http://www.crcnetbase.com/doi/10.1201/EBK1420091700-3

  • Wang Y, Zukerman M, Addie R, Chan S and Harris R. (2010). A priority-based processor sharing model for TDM passive optical networks. IEEE Journal on Selected Areas in Communications. 28:6. (863-874). Online publication date: 1-Aug-2010.

    https://doi.org/10.1109/JSAC.2010.100811

  • Malchin C and Daduna H. (2010). Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model. Queueing Systems: Theory and Applications. 65:4. (385-421). Online publication date: 1-Aug-2010.

    https://doi.org/10.1007/s11134-010-9181-2

  • Tikhonenko O. (2010). Queuing system with processor sharing and limited resources. Automation and Remote Control. 71:5. (803-815). Online publication date: 1-May-2010.

    https://doi.org/10.1134/S0005117910050073

  • Zhen Q and Knessl C. (2009). Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. Mathematical Methods of Operations Research. 10.1007/s00186-009-0290-9. 71:2. (201-244). Online publication date: 1-Apr-2010.

    http://link.springer.com/10.1007/s00186-009-0290-9

  • Brandt A and Brandt M. (2016). Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing. Advances in Applied Probability. 10.1239/aap/1269611152. 42:01. (246-267). Online publication date: 1-Mar-2010.

    https://www.cambridge.org/core/product/identifier/S0001867800003992/type/journal_article

  • Brandt A and Brandt M. (2016). Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing. Advances in Applied Probability. 10.1017/S0001867800003992. 42:01. (246-267). Online publication date: 1-Mar-2010.

    https://www.cambridge.org/core/product/identifier/S0001867800003992/type/journal_article

  • Zhen Q and Knessl C. (2010). On Sojourn Times in the M/ M/1-PS Model, Conditioned on the Number of Other Users. Applied Mathematics Research eXpress. 10.1093/amrx/abq001.

    https://academic.oup.com/amrx/article-lookup/doi/10.1093/amrx/abq001

  • Brandt M and Brandt A. (2010). On sojourn times in M/GI systems under state-dependent processor sharing. Queueing Systems: Theory and Applications. 64:2. (167-201). Online publication date: 1-Feb-2010.

    https://doi.org/10.1007/s11134-009-9157-2

  • Toker A, Sivrikaya F, El Sayed N and Albayrak S. (2010). An Analytical Model for Dynamic Inter-Operator Resource Sharing in 4G Networks. Recent Trends in Wireless and Mobile Networks. 10.1007/978-3-642-14171-3_19. (229-240).

    http://link.springer.com/10.1007/978-3-642-14171-3_19

  • Li Q. (2010). Examples of Practical Applications. Constructive Computation in Stochastic Models with Applications. 10.1007/978-3-642-11492-2_7. (331-388).

    http://link.springer.com/10.1007/978-3-642-11492-2_7

  • Kelly F, Massoulié L and Walton N. (2009). Resource pooling in congested networks. Queueing Systems: Theory and Applications. 63:1-4. (165-194). Online publication date: 1-Dec-2009.

    https://doi.org/10.1007/s11134-009-9143-8

  • Hoekstra G, Mei R, Nazarathy Y and Zwart B. Optimal File Splitting for Wireless Networks with Concurrent Access. Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization. (189-203).

    https://doi.org/10.1007/978-3-642-10406-0_13

  • Verloop I, Ayesta U and Núñez-Queija R. (2009). Heavy-traffic analysis of the M/PH/1 discriminatory processor sharing queue with phase-dependent weights. ACM SIGMETRICS Performance Evaluation Review. 37:2. (42-44). Online publication date: 16-Oct-2009.

    https://doi.org/10.1145/1639562.1639577

  • Ayesta U and Mandjes M. (2008). Bandwidth-sharing networks under a diffusion scaling. Annals of Operations Research. 10.1007/s10479-008-0426-y. 170:1. (41-58). Online publication date: 1-Sep-2009.

    http://link.springer.com/10.1007/s10479-008-0426-y

  • Gupta V and Harchol-Balter M. (2009). Self-adaptive admission control policies for resource-sharing systems. ACM SIGMETRICS Performance Evaluation Review. 37:1. (311-322). Online publication date: 15-Jun-2009.

    https://doi.org/10.1145/2492101.1555385

  • Sandholm T and Lai K. (2009). MapReduce optimization using regulated dynamic prioritization. ACM SIGMETRICS Performance Evaluation Review. 37:1. (299-310). Online publication date: 15-Jun-2009.

    https://doi.org/10.1145/2492101.1555384

  • Harchol-Balter M, Scheller-Wolf A and Young A. (2009). Surprising results on task assignment in server farms with high-variability workloads. ACM SIGMETRICS Performance Evaluation Review. 37:1. (287-298). Online publication date: 15-Jun-2009.

    https://doi.org/10.1145/2492101.1555383

  • Qiu T, Ge Z, Lee S, Wang J, Zhao Q and Xu J. (2009). Modeling channel popularity dynamics in a large IPTV system. ACM SIGMETRICS Performance Evaluation Review. 37:1. (275-286). Online publication date: 15-Jun-2009.

    https://doi.org/10.1145/2492101.1555381

  • Gupta G, Sanghavi S and Shroff N. (2009). Node weighted scheduling. ACM SIGMETRICS Performance Evaluation Review. 37:1. (97-108). Online publication date: 15-Jun-2009.

    https://doi.org/10.1145/2492101.1555361

  • Gupta V and Harchol-Balter M. Self-adaptive admission control policies for resource-sharing systems. Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems. (311-322).

    https://doi.org/10.1145/1555349.1555385

  • Haviv M and van der Wal J. (2008). Mean sojourn times for phase-type discriminatory processor sharing systems. European Journal of Operational Research. 10.1016/j.ejor.2007.05.051. 189:2. (375-386). Online publication date: 1-Sep-2008.

    http://linkinghub.elsevier.com/retrieve/pii/S0377221707005267

  • Brandt A and Brandt M. (2008). Waiting times for M/M systems under state-dependent processor sharing. Queueing Systems: Theory and Applications. 59:3-4. (297-319). Online publication date: 1-Aug-2008.

    https://doi.org/10.1007/s11134-008-9086-5

  • Prasad R and Dovrolis C. Beyond the Model of Persistent TCP Flows. Proceedings of the 41st Annual Simulation Symposium (anss-41 2008). (121-130).

    https://doi.org/10.1109/ANSS-41.2008.16

  • Kherani A. (2008). Asymptotic properties of sojourn times in multiclass time-shared systems. Probability in the Engineering and Informational Sciences. 22:2. (231-259). Online publication date: 1-Mar-2008.

    https://doi.org/10.1017/S0269964808000144

  • Lian Z, Liu X and Liu L. (2008). Discriminatory Processor Sharing Queues and the DREB Method. Stochastic Models. 10.1080/15326340701826872. 24:1. (19-40). Online publication date: 1-Feb-2008.

    http://www.tandfonline.com/doi/abs/10.1080/15326340701826872

  • Kjær M, Kihl M and Robertsson A. (2008). Response–Time Control of a Processor–Sharing System using Virtualized Server Environments. IFAC Proceedings Volumes. 10.3182/20080706-5-KR-1001.00610. 41:2. (3612-3618).

    http://linkinghub.elsevier.com/retrieve/pii/S147466701639509X

  • Kim J and Kim B. (2008). Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals. Queueing Systems: Theory and Applications. 58:1. (57-64). Online publication date: 1-Jan-2008.

    https://doi.org/10.1007/s11134-007-9058-1

  • Ayesta U. (2016). A Unifying Conservation Law for Single-Server Queues. Journal of Applied Probability. 10.1239/jap/1197908826. 44:04. (1078-1087). Online publication date: 1-Dec-2007.

    https://www.cambridge.org/core/product/identifier/S0021900200003752/type/journal_article

  • Ayesta U. (2016). A Unifying Conservation Law for Single-Server Queues. Journal of Applied Probability. 10.1017/S0021900200003752. 44:04. (1078-1087). Online publication date: 1-Dec-2007.

    https://www.cambridge.org/core/product/identifier/S0021900200003752/type/journal_article

  • Zhen Q and Knessl C. (2007). Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. Queueing Systems: Theory and Applications. 57:4. (157-168). Online publication date: 1-Dec-2007.

    https://doi.org/10.1007/s11134-007-9054-5

  • Leino J. Approximating optimal load balancing policy in discriminatory processor sharing systems. Proceedings of the 2nd international conference on Performance evaluation methodologies and tools. (1-5).

    /doi/10.5555/1345263.1345369

  • Yashkov S and Yashkova A. (2007). Processor sharing. Automation and Remote Control. 68:9. (1662-1731). Online publication date: 1-Sep-2007.

    https://doi.org/10.1134/S0005117907090202

  • Hayel Y. Hierarchical game and bi-level optimization for controlling network usage via pricing. Proceedings of the 1st EuroFGI international conference on Network control and optimization. (257-265).

    /doi/10.5555/1762948.1762975

  • Leino J and Virtamo J. (2007). Determining the Moments of Queue-Length Distribution of Discriminatory Processor-Sharing Systems with Phase-Type Service Requirements 2007 Next Generation Internet Networks. 10.1109/NGI.2007.371217. 1-4244-0856-3. (205-208).

    http://ieeexplore.ieee.org/document/4231840/

  • Kim J and Kim B. (2007). The processor-sharing queue with bulk arrivals and phase-type services. Performance Evaluation. 10.1016/j.peva.2006.05.006. 64:4. (277-297). Online publication date: 1-May-2007.

    https://linkinghub.elsevier.com/retrieve/pii/S0166531606000459

  • Aalto S, Ayesta U, Borst S, Misra V and Núñez-Queija R. (2007). Beyond processor sharing. ACM SIGMETRICS Performance Evaluation Review. 34:4. (36-43). Online publication date: 1-Mar-2007.

    https://doi.org/10.1145/1243401.1243409

  • Hayel Y. Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing. Network Control and Optimization. 10.1007/978-3-540-72709-5_27. (257-265).

    http://link.springer.com/10.1007/978-3-540-72709-5_27

  • Lakshmikantha A, Srikant R and Beck C. (2006). Analysis of SIFT like Active Queue Management algorithms Proceedings of the 45th IEEE Conference on Decision and Control. 10.1109/CDC.2006.377074. 1-4244-0171-2. (1912-1917).

    http://ieeexplore.ieee.org/document/4177688/

  • Leino J and Virtamo J. An approximative method for calculating performance measures of Markov processes. Proceedings of the 1st international conference on Performance evaluation methodolgies and tools. (67-es).

    https://doi.org/10.1145/1190095.1190181

  • Padhy S and Kherani A. Tail equivalence for some time-shared systems. Proceedings of the 1st international conference on Performance evaluation methodolgies and tools. (37-es).

    https://doi.org/10.1145/1190095.1190142

  • Rom R, Sidi M and Tan H. (2006). Design and analysis of a class-aware recursive loop scheduler for class-based scheduling. Performance Evaluation. 63:9. (839-863). Online publication date: 1-Oct-2006.

    https://doi.org/10.1016/j.peva.2005.09.004

  • Berggren F and Litjens R. Performance analysis of access selection and transmit diversity in multi-access networks. Proceedings of the 12th annual international conference on Mobile computing and networking. (251-261).

    https://doi.org/10.1145/1161089.1161118

  • Potter P and Zukerman M. (2006). Analysis of a discrete multipriority queueing system involving a central shared processor serving many local queues. IEEE Journal on Selected Areas in Communications. 9:2. (194-202). Online publication date: 1-Sep-2006.

    https://doi.org/10.1109/49.68447

  • Egorova R, Zwart B and Boxma O. (2006). Sojourn Time Tails In The M/D/1 Processor Sharing Queue. Probability in the Engineering and Informational Sciences. 20:3. (429-446). Online publication date: 1-Jul-2006.

    https://doi.org/10.1017/S0269964806060268

  • Altman E, Avrachenkov K and Ayesta U. (2006). A survey on discriminatory processor sharing. Queueing Systems: Theory and Applications. 53:1-2. (53-63). Online publication date: 1-Jun-2006.

    https://doi.org/10.1007/s11134-006-7586-8

  • Borst S, Núñez-Queija R and Zwart B. (2006). Sojourn time asymptotics in processor-sharing queues. Queueing Systems: Theory and Applications. 53:1-2. (31-51). Online publication date: 1-Jun-2006.

    https://doi.org/10.1007/s11134-006-7585-9

  • Cheung S, Berg H and Boucherie R. (2006). Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue. Queueing Systems: Theory and Applications. 53:1-2. (7-18). Online publication date: 1-Jun-2006.

    https://doi.org/10.1007/s11134-006-7583-y

  • McGuffee J and Cabezas R. (2006). Starvation-proof priority round-robin queues for time-sharing systems. Journal of Computing Sciences in Colleges. 21:4. (253-258). Online publication date: 1-Apr-2006.

    /doi/10.5555/1127389.1127436

  • Li Q and Lin C. (2006). The M/G/1 processor-sharing queue with disasters. Computers & Mathematics with Applications. 51:6-7. (987-998). Online publication date: 1-Mar-2006.

    https://doi.org/10.1016/j.camwa.2005.10.012

  • Boxma O, Hegde N and Núñez-Queija R. (2006). Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues. AEU - International Journal of Electronics and Communications. 10.1016/j.aeue.2005.11.007. 60:2. (109-115). Online publication date: 1-Feb-2006.

    http://linkinghub.elsevier.com/retrieve/pii/S1434841105001822

  • Cheung S, van den Berg H and Boucherie R. (2005). Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues. Performance Evaluation. 62:1-4. (100-116). Online publication date: 1-Oct-2005.

    https://doi.org/10.1016/j.peva.2005.07.009

  • Verloop M, Borst S and Núñez-Queija R. (2005). Stability of size-based scheduling disciplines in resource-sharing networks. Performance Evaluation. 62:1-4. (247-262). Online publication date: 1-Oct-2005.

    https://doi.org/10.1016/j.peva.2005.07.008

  • Hayel Y and Tuffin B. Pricing for heterogeneous services at a discriminatory processor sharing queue. Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems. (816-827).

    https://doi.org/10.1007/11422778_66

  • Jain M, Sharma G and Shekhar C. (2005). Processor-shared service systems with queue-dependent processors. Computers and Operations Research. 32:3. (629-645). Online publication date: 1-Mar-2005.

    https://doi.org/10.1016/j.cor.2003.08.009

  • Tan Y, Moinzadeh K and Mookerjee V. (2005). Optimal Processing Policies for an e-Commerce Web Server. INFORMS Journal on Computing. 17:1. (99-110). Online publication date: 1-Jan-2005.

    https://doi.org/10.1287/ijoc.1030.0044

  • van Kessel G, Nunez-Queja R and Borst S. Differentiated bandwidth sharing with disparate flow sizes Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.. 10.1109/INFCOM.2005.1498528. 0-7803-8968-9. (2425-2435).

    http://ieeexplore.ieee.org/document/1498528/

  • Avrachenkov K, Ayesta U, Brown P and Nunez-Queija R. Discriminatory processor sharing revisited Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.. 10.1109/INFCOM.2005.1498310. 0-7803-8968-9. (784-795).

    http://ieeexplore.ieee.org/document/1498310/

  • Li Q, Lian Z and Liu L. (2005). An RG -Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue . Stochastic Models. 10.1081/STM-200056223. 21:2-3. (507-530). Online publication date: 1-Jan-2005.

    http://www.tandfonline.com/doi/abs/10.1081/STM-200056223

  • Kim J and Kim B. (2004). Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing. Performance Evaluation. 58:4. (341-365). Online publication date: 1-Dec-2004.

    https://doi.org/10.1016/j.peva.2004.05.005

  • van Kessel G, Núñez-Queija R and Borst S. (2004). Asymptotic regimes and approximations for discriminatory processor sharing. ACM SIGMETRICS Performance Evaluation Review. 32:2. (44-46). Online publication date: 1-Sep-2004.

    https://doi.org/10.1145/1035334.1035352

  • Raz D, Levy H and Avi-Itzhak B. A resource-allocation queueing fairness measure. Proceedings of the joint international conference on Measurement and modeling of computer systems. (130-141).

    https://doi.org/10.1145/1005686.1005704

  • Raz D, Levy H and Avi-Itzhak B. (2004). A resource-allocation queueing fairness measure. ACM SIGMETRICS Performance Evaluation Review. 32:1. (130-141). Online publication date: 1-Jun-2004.

    https://doi.org/10.1145/1012888.1005704

  • Jamjoom H, Chou C and Shin K. The impact of concurrency gains on the analysis and control of multi-threaded Internet services IEEE INFOCOM 2004. 10.1109/INFCOM.2004.1356971. 0-7803-8355-9. (827-837).

    http://ieeexplore.ieee.org/document/1356971/

  • Borst S, Boxma O, Morrison J and NúñEz Queija R. (2003). The equivalence between processor sharing and service in random order. Operations Research Letters. 31:4. (254-262). Online publication date: 1-Jul-2003.

    https://doi.org/10.1016/S0167-6377(03)00006-3

  • Baldwin R, Davis N, Midkiff S and Kobza J. (2003). Queueing network analysis. Journal of Systems and Software. 66:2. (99-117). Online publication date: 15-May-2003.

    https://doi.org/10.1016/S0164-1212(02)00068-7

  • Litjens R and Boucherie R. (2003). Elastic calls in an integrated services network. Performance Evaluation. 52:4. (193-220). Online publication date: 1-May-2003.

    https://doi.org/10.1016/S0166-5316(02)00191-8

  • MEDHI J. (2003). Network of Queues. Stochastic Models in Queueing Theory. 10.1016/B978-012487462-6/50005-9. (221-253).

    http://linkinghub.elsevier.com/retrieve/pii/B9780124874626500059

  • Pinto C and Lambert J. (2002). Risk of extreme events in the configuration of priority systems. Reliability Engineering & System Safety. 10.1016/S0951-8320(02)00018-2. 76:3. (265-271). Online publication date: 1-Jun-2002.

    http://linkinghub.elsevier.com/retrieve/pii/S0951832002000182

  • Núñez-Queija R. (2001). SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING. Stochastic Models. 10.1081/STM-100001400. 17:1. (61-92). Online publication date: 2-Apr-2001.

    http://www.tandfonline.com/doi/abs/10.1081/STM-100001400

  • Soetens T, De Cnodder S and Elloumi O. A relative bandwidth differentiated service for TCP micro-flows First IEEE/ACM International Symposium on Cluster Computing and the Grid. 10.1109/CCGRID.2001.923249. 0-7695-1010-8. (602-609).

    http://ieeexplore.ieee.org/document/923249/

  • Daduna H. (2001). Stochastic networks with product form equilibrium. Stochastic Processes: Theory and Methods. 10.1016/S0169-7161(01)19013-9. (309-364).

    http://linkinghub.elsevier.com/retrieve/pii/S0169716101190139

  • (2001). Appendix. Queueing Networks with Discrete Time Scale. 10.1007/3-540-44592-7_7. (121-123).

    http://link.springer.com/10.1007/3-540-44592-7_7

  • Dovrolis C, Stiliadis D and Ramanathan P. (1999). Proportional differentiated services. ACM SIGCOMM Computer Communication Review. 29:4. (109-120). Online publication date: 1-Oct-1999.

    https://doi.org/10.1145/316194.316211

  • Dovrolis C and Ramanathan P. (1999). A case for relative differentiated services and the proportional differentiation model. IEEE Network: The Magazine of Global Internetworking. 13:5. (26-34). Online publication date: 1-Sep-1999.

    https://doi.org/10.1109/65.793688

  • Dovrolis C, Stiliadis D and Ramanathan P. Proportional differentiated services. Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication. (109-120).

    https://doi.org/10.1145/316188.316211

  • Epema D. (1998). Decay-usage scheduling in multiprocessors. ACM Transactions on Computer Systems. 16:4. (367-415). Online publication date: 1-Nov-1998.

    https://doi.org/10.1145/292523.292535

  • (1998). An Approximate Analysis of a UNIX Macro Process Scheduler. INFORMS Journal on Computing. 10:3. (351-357). Online publication date: 1-Aug-1998.

    /doi/10.5555/2700613.2700623

  • Benhenni R. (1998). An Approximate Analysis of a UNIX Macro Process Scheduler. INFORMS Journal on Computing. 10.1287/ijoc.10.3.351. 10:3. (351-357). Online publication date: 1-Aug-1998.

    http://pubsonline.informs.org/doi/10.1287/ijoc.10.3.351

  • Brandt A and Brandt M. (1998). On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers. Mathematical Methods of Operations Research. 10.1007/BF01194397. 47:2. (181-220). Online publication date: 1-Jun-1998.

    http://link.springer.com/10.1007/BF01194397

  • Leeb H and Wegenkittl S. (1997). Inversive and linear congruential pseudorandom number generators in empirical tests. ACM Transactions on Modeling and Computer Simulation. 7:2. (272-286). Online publication date: 1-Apr-1997.

    https://doi.org/10.1145/249204.249208

  • Rao B and Ramakrishnan S. (1996). Queueing models for a single server LAN with processor sharing disciplines. Computing. 57:3. (225-244). Online publication date: 1-Nov-1996.

    https://doi.org/10.1007/BF02247407

  • Rege K and Sengupta B. (1996). Queue-Length Distribution for the Discriminatory Processor-Sharing Queue. Operations Research. 44:4. (653-657). Online publication date: 1-Aug-1996.

    https://doi.org/10.1287/opre.44.4.653

  • Epema D. An analysis of decay-usage scheduling in multiprocessors. Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems. (74-85).

    https://doi.org/10.1145/223587.223597

  • Epema D. (1995). An analysis of decay-usage scheduling in multiprocessors. ACM SIGMETRICS Performance Evaluation Review. 23:1. (74-85). Online publication date: 1-May-1995.

    https://doi.org/10.1145/223586.223597

  • Ramakrishnan S and Rao B. LAN file server performance: a processor sharing model IEEE Singapore International Conference on Networks and International Conference on Information Engineering '95. 10.1109/SICON.1995.526033. 0-7803-2579-6. (136-141).

    http://ieeexplore.ieee.org/document/526033/

  • Rege K and Sengupta B. (1994). A decomposition theorem and related results for the discriminatory processor sharing queue. Queueing Systems. 10.1007/BF01158767. 18:3-4. (333-351). Online publication date: 1-Sep-1994.

    http://link.springer.com/10.1007/BF01158767

  • Knessl C and Tier C. (1994). A processor-shared queue that models switching times. SIAM Journal on Applied Mathematics. 54:3. (854-875). Online publication date: 1-Jun-1994.

    https://doi.org/10.1137/S0036139992235068

  • Yang T and Li H. (1994). TheM/G/1 retrial queue with the server subject to starting failures. Queueing Systems. 10.1007/BF01158950. 16-16:1-2. (83-96). Online publication date: 1-Mar-1994.

    http://link.springer.com/10.1007/BF01158950

  • Knessl C and Tier C. (1992). A processor-shared queue that models switching times. SIAM Journal on Applied Mathematics. 52:3. (883-899). Online publication date: 1-Jun-1992.

    https://doi.org/10.1137/0152050

  • van Dijk N and Taylor P. (1992). An error bound for a continuous time approximation of discrete time servicing. Communications in Statistics. Stochastic Models. 10.1080/15326349208807245. 8:4. (651-664). Online publication date: 1-Jan-1992.

    http://www.tandfonline.com/doi/abs/10.1080/15326349208807245

  • Leung K. (1992). Performance Analysis of a Processor Sharing Policy with Interactive and Background Jobs. Performance of Distributed Systems and Integrated Communication Networks. 10.1016/B978-0-444-89404-5.50017-1. (189-207).

    https://linkinghub.elsevier.com/retrieve/pii/B9780444894045500171

  • Yashkov S. (1992). Mathematical problems in the theory of shared-processor systems. Journal of Soviet Mathematics. 10.1007/BF01097426. 58:2. (101-147). Online publication date: 1-Jan-1992.

    http://link.springer.com/10.1007/BF01097426

  • Morrison J. (1991). Asymptotic analysis of large closed queueing network with discriminatory processor sharing. Queueing Systems: Theory and Applications. 9:1-2. (191-214). Online publication date: 1-Oct-1991.

    https://doi.org/10.1007/BF01158797

  • Qin B, Sholl H and Ammar R. (1989). A model to predict the average response time of user programs. Performance Evaluation. 10:2. (93-101). Online publication date: 1-Oct-1989.

    https://doi.org/10.1016/0166-5316(89)90050-3

  • Foley R and Klutke G. (2016). Stationary increments in the accumulated work process in processor-sharing queues. Journal of Applied Probability. 10.2307/3214427. 26:03. (671-677). Online publication date: 1-Sep-1989.

    https://www.cambridge.org/core/product/identifier/S0021900200038298/type/journal_article

  • Foley R and Klutke G. (2016). Stationary increments in the accumulated work process in processor-sharing queues. Journal of Applied Probability. 10.1017/S0021900200038298. 26:03. (671-677). Online publication date: 1-Sep-1989.

    https://www.cambridge.org/core/product/identifier/S0021900200038298/type/journal_article

  • Lavenberg S. (1989). A perspective on queueing models of computer performance. Performance Evaluation. 10:1. (53-76). Online publication date: 1-Sep-1989.

    https://doi.org/10.1016/0166-5316(89)90005-9

  • Mitra D and Weiss A. (1989). A closed network with a discriminatory processor-sharing server. ACM SIGMETRICS Performance Evaluation Review. 17:1. (200-208). Online publication date: 1-Apr-1989.

    https://doi.org/10.1145/75372.75394

  • Mitra D and Weiss A. A closed network with a discriminatory processor-sharing server. Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. (200-208).

    https://doi.org/10.1145/75108.75394

  • Qin B and Ammar R. A model to estimate average response time of parallel programs [1989] Thirteenth Annual International Computer Software & Applications Conference. 10.1109/CMPSAC.1989.65059. 0-8186-1964-3. (67-74).

    http://ieeexplore.ieee.org/document/65059/

  • Pronios N and Polydoros A. Approximate methods for analyzing slotted random-access spread-spectrum networks IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?. 10.1109/INFCOM.1988.13007. 0-8186-0833-1. (916-923).

    http://ieeexplore.ieee.org/document/13007/

  • Krueger P and Livny M. A comparison of preemptive and non-preemptive load distributing [1988] Proceedings. The 8th International Conference on Distributed. 10.1109/DCS.1988.12509. 0-8186-0865-X. (123-130).

    http://ieeexplore.ieee.org/document/12509/

  • Avi-Itzhak B and Halfin S. (2016). Server sharing with a limited number of service positions and symmetric queues. Journal of Applied Probability. 10.2307/3214221. 24:04. (990-1000). Online publication date: 1-Dec-1987.

    https://www.cambridge.org/core/product/identifier/S0021900200116845/type/journal_article

  • Avi-Itzhak B and Halfin S. (2016). Server sharing with a limited number of service positions and symmetric queues. Journal of Applied Probability. 10.1017/S0021900200116845. 24:04. (990-1000). Online publication date: 1-Dec-1987.

    https://www.cambridge.org/core/product/identifier/S0021900200116845/type/journal_article

  • Pósafalvi A and Sztrik J. (1987). On the heterogeneous machine interference with limited server's availability. European Journal of Operational Research. 10.1016/S0377-2217(87)80175-3. 28:3. (321-328). Online publication date: 1-Mar-1987.

    http://linkinghub.elsevier.com/retrieve/pii/S0377221787801753

  • Vinyes-Sanz J and Riera-Garcia J. (1986). Waiting times in a transport protocol entity scheduler. ACM SIGCOMM Computer Communication Review. 16:5. (4-12). Online publication date: 1-Nov-1986.

    https://doi.org/10.1145/15706.15707

  • Chastek G and Kearns J. (1985). Efficient computation of optimal space-time performance curves for memory hierarchies. Performance Evaluation. 10.1016/0166-5316(85)90022-7. 5:4. (215-223). Online publication date: 1-Nov-1985.

    https://linkinghub.elsevier.com/retrieve/pii/0166531685900227

  • Cohen J and Boxma O. (2008). A SURVEY OF THE EVOLUTION OF QUEUEING THEORY. Statistica Neerlandica. 10.1111/j.1467-9574.1985.tb01134.x. 39:2. (143-158). Online publication date: 1-Jun-1985.

    https://onlinelibrary.wiley.com/doi/10.1111/j.1467-9574.1985.tb01134.x

  • Asare B and Foster F. (2016). Conditional response times in the M/G/1 processor-sharing system. Journal of Applied Probability. 10.2307/3213604. 20:04. (910-915). Online publication date: 1-Dec-1983.

    https://www.cambridge.org/core/product/identifier/S0021900200024232/type/journal_article

  • Asare B and Foster F. (2016). Conditional response times in the M/G/1 processor-sharing system. Journal of Applied Probability. 10.1017/S0021900200024232. 20:04. (910-915). Online publication date: 1-Dec-1983.

    https://www.cambridge.org/core/product/identifier/S0021900200024232/type/journal_article

  • Buzen J and Agrawal S. State space transformations in queueing network modeling. Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems. (55-69).

    https://doi.org/10.1145/800040.801395

  • WONG J, MOURA J and FIELD J. (1983). HIERARCHICAL MODELLING OF FILE TRANSFERS ON LOCAL AREA NETWORKS. Computer-Communication Networks. 10.1016/B978-0-08-031132-6.50009-X. (191-207).

    https://linkinghub.elsevier.com/retrieve/pii/B978008031132650009X

  • Wong J, Moura J and Field J. (1983). Hierarchical modelling of file transfers on local area networks. Computers & Electrical Engineering. 10.1016/0045-7906(83)90007-1. 10:3. (191-207). Online publication date: 1-Jan-1983.

    http://linkinghub.elsevier.com/retrieve/pii/0045790683900071

  • Jaiswal N. (1982). Performance evaluation studies for time-sharing computer systems. Performance Evaluation. 10.1016/0166-5316(82)90023-2. 2:4. (223-236). Online publication date: 1-Dec-1982.

    http://linkinghub.elsevier.com/retrieve/pii/0166531682900232

  • Brown T. (1982). Determination of the conditional response for quantum allocation algorithms. Journal of the ACM. 29:2. (448-460). Online publication date: 1-Apr-1982.

    https://doi.org/10.1145/322307.322318

  • Pentzaropoulos G. (1982). Computer performance modelling: an overview. Applied Mathematical Modelling. 10.1016/0307-904X(82)90015-4. 6:2. (74-80). Online publication date: 1-Apr-1982.

    https://linkinghub.elsevier.com/retrieve/pii/0307904X82900154

  • Kearns J, Meier C and Soffa M. (1982). The Performance Evaluation of Control Implementations. IEEE Transactions on Software Engineering. 8:2. (89-96). Online publication date: 1-Mar-1982.

    https://doi.org/10.1109/TSE.1982.234951

  • Bux W. (1981). Local-Area Subnetworks: A Performance Comparison. IEEE Transactions on Communications. 10.1109/TCOM.1981.1094893. 29:10. (1465-1473). Online publication date: 1-Oct-1981.

    http://ieeexplore.ieee.org/document/1094893/

  • Dukhovny I and Koenigsberg E. (2016). Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems. INFOR: Information Systems and Operational Research. 10.1080/03155986.1981.11731823. 19:3. (185-204). Online publication date: 1-Aug-1981.

    http://www.tandfonline.com/doi/full/10.1080/03155986.1981.11731823

  • Kleinrock L and Nilsson A. (1981). On Optimal Scheduling Algorithms for Time-Shared Systems. Journal of the ACM. 28:3. (477-486). Online publication date: 1-Jul-1981.

    https://doi.org/10.1145/322261.322266

  • Stahlknecht P. (1981). Einsatzmöglichkeiten von quantitativen Verfahren und OR-Modellen für das DV-Management. OR Spektrum. 10.1007/BF01720099. 3:2. (65-90). Online publication date: 1-Jun-1981.

    http://link.springer.com/10.1007/BF01720099

  • Lam S and Shankar A. (1981). A derivation of response time distributions for a multi-class feedback queueing systems. Performance Evaluation. 10.1016/0166-5316(81)90043-2. 1:1. (48-61). Online publication date: 1-Jan-1981.

    http://linkinghub.elsevier.com/retrieve/pii/0166531681900432

  • Lam S and Shankar A. (1980). Response time distributions for a multi-class queue with feedback. ACM SIGMETRICS Performance Evaluation Review. 9:2. (225-234). Online publication date: 1-Aug-1980.

    https://doi.org/10.1145/1009375.806167

  • Fayolle G, Mitrani I and Iasnogorodski R. (1980). Sharing a Processor Among Many Job Classes. Journal of the ACM. 27:3. (519-532). Online publication date: 1-Jul-1980.

    https://doi.org/10.1145/322203.322212

  • Lam S and Shankar A. Response time distributions for a multi-class queue with feedback. Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation. (225-234).

    https://doi.org/10.1145/800199.806167

  • Kruse W. (1979). Letter to the Editor-To the Editor. Operations Research. 27:4. (852-854). Online publication date: 1-Aug-1979.

    /doi/10.5555/3216519.3216520

  • (1979). Errata. Operations Research. 27:4. (854-854). Online publication date: 1-Aug-1979.

    https://doi.org/10.1287/opre.27.4.854

  • Bennett P and Foster D. Formulation of a Markovian model of the major processing delays of the VUCC DECsystem-1099. Proceedings of the 17th annual Southeast regional conference. (2-7).

    https://doi.org/10.1145/503506.503507

  • ALLEN A. (1978). QUEUEING THEORY MODELS OF COMPUTER SYSTEMS. Probability, Statistics, and Queueing Theory. 10.1016/B978-0-12-051050-4.50012-5. (234-270).

    https://linkinghub.elsevier.com/retrieve/pii/B9780120510504500125

  • Ruschitzka M and Fabry R. (1977). A unifying approach to scheduling. Communications of the ACM. 20:7. (469-477). Online publication date: 1-Jul-1977.

    https://doi.org/10.1145/359636.359643

  • Mitrani I and Hine J. (1977). Complete parameterized families of job scheduling strategies. Acta Informatica. 8:1. (61-73). Online publication date: 1-Mar-1977.

    /doi/10.5555/2696882.2696976

  • Mitrani I and Hine J. (1977). Complete parameterized families of job scheduling strategies. Acta Informatica. 10.1007/BF00276184. 8:1. (61-73). Online publication date: 1-Mar-1977.

    https://link.springer.com/10.1007/BF00276184

  • Bernstein A. (1976). Synthesizing a Response Function with a Feedback Scheduling Algorithm. SIAM Journal on Computing. 5:2. (309-317). Online publication date: 1-Jun-1976.

    https://doi.org/10.1137/0205025

  • Liu J and Milner J. Probabilistic models of inverted file information retrieval systems. Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation. (25-37).

    https://doi.org/10.1145/800200.806179

  • Coffman E and Mitrani I. Selecting a scheduling rule that meets pre-specified response time demands. Proceedings of the fifth ACM symposium on Operating systems principles. (187-191).

    https://doi.org/10.1145/800213.806536

  • Coffman E and Mitrani I. (1975). Selecting a scheduling rule that meets pre-specified response time demands. ACM SIGOPS Operating Systems Review. 9:5. (187-191). Online publication date: 1-Nov-1975.

    https://doi.org/10.1145/1067629.806536

  • O'Donovan T. (1975). Technical Note-The Queue M/G/1 When Jobs Are Scheduled within Generations. Operations Research. 23:4. (821-824). Online publication date: 1-Aug-1975.

    https://doi.org/10.1287/opre.23.4.821

  • Babad J. (1975). A Generalized Multi-Entrance Time-Sharing Priority Queue. Journal of the ACM. 22:2. (231-247). Online publication date: 1-Apr-1975.

    https://doi.org/10.1145/321879.321886

  • Peterson J and Bulgren W. Studies in Markov models of computer systems. Proceedings of the 1975 annual conference. (102-107).

    https://doi.org/10.1145/800181.810294

  • Chua Y and Bernstein A. (1974). Analysis of a Feedback Scheduler. SIAM Journal on Computing. 3:3. (159-176). Online publication date: 1-Sep-1974.

    https://doi.org/10.1137/0203012

  • Cook T. Schedule—constrained job scheduling in a multiprogrammed computer system. Proceedings of the 7th conference on Winter simulation - Volume 2. (675-685).

    https://doi.org/10.1145/800290.811326

  • Händler W and Spies P. (1974). Universelle Digital-Rechenanlagen. Taschenbuch der Informatik. 10.1007/978-3-642-65586-9_4. (118-241).

    http://link.springer.com/10.1007/978-3-642-65586-9_4

  • Uzgalis R. (1974). A short history of computer system modeling and measurements at the University of California, Los Angeles. Rechnerstrukturen und Betriebsprogrammierung. 10.1007/3-540-06815-5_135. (138-163).

    http://link.springer.com/10.1007/3-540-06815-5_135

  • Browne J, Chandy K, Hogarth J and Lee C. (1973). The Effect on Throughput of Multiprocessing in a Multiprogramming Environment. IEEE Transactions on Computers. 22:8. (728-735). Online publication date: 1-Aug-1973.

    https://doi.org/10.1109/TC.1973.5009151

  • Pack C. (1973). The effects of multiplexing on a computer-communications system. Communications of the ACM. 16:3. (161-168). Online publication date: 1-Mar-1973.

    https://doi.org/10.1145/361972.361991

  • Graham R. (1973). Performance prediction. Software Engineering. 10.1007/3-540-07168-7_83. (395-463).

    http://link.springer.com/10.1007/3-540-07168-7_83

  • Losapio N and Bulgren W. Simulation of dispatching algorithms in a multiprogramming environment. Proceedings of the ACM annual conference - Volume 2. (903-913).

    https://doi.org/10.1145/800194.805879

  • Bowdon E. Network computer modeling. Proceedings of the ACM annual conference - Volume 1. (254-264).

    https://doi.org/10.1145/800193.569927

  • Kleinrock L and Muntz R. (1972). Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System. Journal of the ACM. 19:3. (464-482). Online publication date: 1-Jul-1972.

    https://doi.org/10.1145/321707.321717

  • Blatny J, Clark S and Rourke T. (1972). On the optimization of performance of time-sharing systems by simulation. Communications of the ACM. 15:6. (411-420). Online publication date: 1-Jun-1972.

    https://doi.org/10.1145/361405.361406

  • Sakata M, Noguchi S and Oizumi J. (1971). An Analysis of the M/G/1 Queue Under Round-Robin Scheduling. Operations Research. 19:2. (371-385). Online publication date: 1-Apr-1971.

    https://doi.org/10.1287/opre.19.2.371

  • Nielsen N. (1971). An analysis of some time-sharing techniques. Communications of the ACM. 14:2. (79-90). Online publication date: 1-Feb-1971.

    https://doi.org/10.1145/362515.362559

  • Dudick A and Pack C. Round robin scheduling in a computer communications system with finite swap time and statistically multiplexed arrivals. Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems. (58-64).

    https://doi.org/10.1145/800281.811054

  • Teichroew D. (1971). Problem Statement Languages in MIS. Management-Informationssysteme. 10.1007/978-3-663-05183-1_14. (251-282).

    http://link.springer.com/10.1007/978-3-663-05183-1_14

  • Kleinrock L, Muntz R and Rodemich E. (2006). The processor‐sharing queueing model for time‐shared systems with bulk arrivals. Networks. 10.1002/net.3230010103. 1:1. (1-13). Online publication date: 1-Jan-1971.

    https://onlinelibrary.wiley.com/doi/10.1002/net.3230010103

  • Fuchs E and Jackson P. (1970). Estimates of distributions of random variables for certain computer communications traffic models. Communications of the ACM. 13:12. (752-757). Online publication date: 1-Dec-1970.

    https://doi.org/10.1145/362814.362830

  • Kleinrock L. (1970). Swap-Time Considerations in Time-Shared Systems. IEEE Transactions on Computers. 19:6. (534-540). Online publication date: 1-Jun-1970.

    https://doi.org/10.1109/T-C.1970.222971

  • Kleinrock L. A contiuum of time-sharing scheduling algorithms. Proceedings of the May 5-7, 1970, spring joint computer conference. (453-458).

    https://doi.org/10.1145/1476936.1477006

  • Chang W. (1970). Single-server queuing processes in computing systems. IBM Systems Journal. 9:1. (36-71). Online publication date: 1-Mar-1970.

    https://doi.org/10.1147/sj.91.0036

  • Coffman E, Muntz R and Trotter H. (1970). Waiting Time Distributions for Processor-Sharing Systems. Journal of the ACM. 17:1. (123-130). Online publication date: 1-Jan-1970.

    https://doi.org/10.1145/321556.321568

  • Gurk H and Minker J. (1970). Storage Requirements for Information Handling Centers. Journal of the ACM. 17:1. (65-77). Online publication date: 1-Jan-1970.

    https://doi.org/10.1145/321556.321563

  • Shemer J and Heying D. Performance modeling and empirical measurements in a system designed for batch and time-sharing users. Proceedings of the November 18-20, 1969, fall joint computer conference. (17-26).

    https://doi.org/10.1145/1478559.1478562

  • Fuchs E and Jackson P. Estimates of distributions of random variables for certain computer communications traffic models. Proceedings of the first ACM symposium on Problems in the optimization of data communications systems. (205-230).

    https://doi.org/10.1145/800165.805244

  • Coffman E and Muntz R. Models of Pure time-sharing disciplines for resource allocation. Proceedings of the 1969 24th national conference. (217-228).

    https://doi.org/10.1145/800195.805934

  • Coffman E. (2013). Markov chain analyses of multiprogrammed computer systems. Naval Research Logistics Quarterly. 10.1002/nav.3800160203. 16:2. (175-197). Online publication date: 1-Jun-1969.

    https://onlinelibrary.wiley.com/doi/10.1002/nav.3800160203

  • Coffman E and Kleinrock L. (1968). Feedback Queueing Models for Time-Shared Systems. Journal of the ACM. 15:4. (549-576). Online publication date: 1-Oct-1968.

    https://doi.org/10.1145/321479.321483

  • Iazeolla G. (1968). Sistemi a partizione-di-tempo: Sviluppo teorico di un algoritmo di servizio con priorità. Calcolo. 10.1007/BF02576110. 5:2. (251-275). Online publication date: 1-Jun-1968.

    http://link.springer.com/10.1007/BF02576110

  • Coffman E and Kleinrock L. Computer scheduling methods and their countermeasures. Proceedings of the April 30--May 2, 1968, spring joint computer conference. (11-21).

    https://doi.org/10.1145/1468075.1468078

  • Iazeolla G. (1968). Sulla trasformazione di un elaboratore in n elaboratori virtuali. Calcolo. 10.1007/BF02576098. 5:S1. (591-602). Online publication date: 1-Mar-1968.

    http://link.springer.com/10.1007/BF02576098

  • HAAG J. (1968). A Macroscopic Model of an Interactive Computing System. Interactive Systems for Experimental Applied Mathematics. 10.1016/B978-0-12-395608-8.50032-3. (284-285).

    https://linkinghub.elsevier.com/retrieve/pii/B9780123956088500323

  • Kleinrock L and Coffman E. (1967). Distribution of attained service in time-shared systems. Journal of Computer and System Sciences. 1:3. (287-298). Online publication date: 1-Oct-1967.

    https://doi.org/10.1016/S0022-0000(67)80020-5

  • Haag J. A macroscopic model of an interactive computing system. Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium. (284-285).

    https://doi.org/10.1145/2402536.2402567

  • Schulman F. Hardware measurement device for IBM system/360 time sharing evaluation. Proceedings of the 1967 22nd national conference. (103-109).

    https://doi.org/10.1145/800196.805980

  • Estrin G and Kleinrock L. Measures, models and measurements for time-shared computer utilities. Proceedings of the 1967 22nd national conference. (85-96).

    https://doi.org/10.1145/800196.805978