[1]

Artalejo J.R., Gomez-Correl A., He Q.M., Markovian arrivals in stochastic modelling: a survey and some new results, Statistics and Operations Research Transactions, 2010, 34, 2, 101–144. Google Scholar

[2]

Baccelli F., Makowski A.M., Shwartz A., The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds, Adv. Appl. Prob., 1989, 21, 629–660, CrossrefGoogle Scholar

[3]

Bladt M., Nielsen B. F., Matrix-Exponential Distributions in Applied Probability, Probability Theory and Stochastic Modelling, 81, Springer US, Boston, MA, 2017, CrossrefGoogle Scholar

[4]

Chakravarthy S.R., The batch Markovian arrival process: A review and future work, In: A. Krishnamoorthy et al.(Eds.), Advances in Probability Theory and Stochastic Processes, Notable Publications Inc., NJ, 2001, 21–39. Google Scholar

[5]

Chakravarthy S.R., Markovian arrival processes. In: Wiley Encyclopedia of Operations Research and Management Science, Published Online: 15 JUN 2010, CrossrefGoogle Scholar

[6]

Chernov I., Nikitina N., Optimal Quorum for a Reliable Desktop Grid, In: Proceedings of the Second International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2015), CEUR Workshop Proceedings, Vol-1502, 2015, 31–36. Google Scholar

[7]

Furht B., Escalante A.(Eds), Handbook of Cloud Computing, Springer, New York, USA, 2010, . CrossrefGoogle Scholar

[8]

Gardner K., Zbarsky Z., Doroudi S., Harchol-Balter M., Hyytiä E., Scheller-Wolf A., Queueing with redundant requests: exact analysis, Queueing Syst., 2016, 83, 227–259, CrossrefWeb of ScienceGoogle Scholar

[9]

Gardner K., Harchol-Balter M., Scheller-Wolf A., Van Houdt B., A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size, IEEE/ACM Transactions on Networking, 2017, PP, 99, 1–15, CrossrefWeb of ScienceGoogle Scholar

[10]

Rama Murthy Garimella, Rumyantsev A. On An Exact Solution Of The Rate Matrix Of Quasi-Birth-Death Process With Small Number Of Phases, In: ECMS 2017 Proceedings. European Council for Modeling and Simulation, 2017, 713–719, CrossrefGoogle Scholar

[11]

Graham A., Kronecker Products and Matrix Calculus with Applications, Ellis Horwood, Chichester, UK, 1981. Google Scholar

[12]

He Qi-Ming, Fundamentals of Matrix-Analytic Methods, Springer, New York, 2014, CrossrefGoogle Scholar

[13]

Heien E. M., Anderson D. P., Hagihara K. Batches with Unreliable Workers in Volunteer Computing Environments, Journal of Grid Computing, 2009, 7, 4, 501–518, CrossrefWeb of ScienceGoogle Scholar

[14]

Ivashko E., Enterprise Desktop Grids, In: Proceedings of the Second International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2015), CEUR Workshop Proceedings, Vol-1502, 2015, 16–21. Google Scholar

[15]

Joshi G., Soljanin E., Wornell G., Efficient replication of queued tasks for latency reduction in cloud systems, In: Proceedings of 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015, 107–114, CrossrefGoogle Scholar

[16]

Joshi G., Soljanin E., Wornell G., Efficient redundancy techniques for latency reduction in cloud systems, arXiv:1508.03599 [cs.DC], Aug. 2015. Google Scholar

[17]

Joshi G., Solijanin E., and Wornell G., Queues with redundancy: Latency-Cost analysis, Performance Evaluation Review, 2015, 43, 2, 54–56, CrossrefGoogle Scholar

[18]

Joshi G., Efficient Redundancy Techniques to Reduce Delay in Cloud Systems, Ph.D. Thesis, MIT, June 2016. Google Scholar

[19]

Kelton W.D., Sadowski R.P., Swets N.B., Simulation with ARENA, Fifth ed., McGraw-Hill, New York, 2010. Google Scholar

[20]

Kim C., Agrawala A.K., Analysis of the fork-join queue, IEEE Trans. Comput., 1989, 38(2), 1041–1053, CrossrefGoogle Scholar

[21]

Latouche G., Ramaswami V., Introduction to matrix analytic methods in stochastic modeling, SIAM, 1999, CrossrefGoogle Scholar

[22]

Lucantoni D., Meier-Hellstern K.S., Neuts M.F., A single-server queue with server vacations and a class of nonrenewal arrival processes, Advances in Applied Probability, 1990, 22, 676–705, CrossrefGoogle Scholar

[23]

Lucantoni D.M., New results on the single server queue with a batch Markovian arrival process, Stochastic Models, 1991, 7, 1–46. CrossrefGoogle Scholar

[24]

Marcus M., Minc H., A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston, MA, 1964. Google Scholar

[25]

Mell P., Grance T., The NIST Definition of Cloud Computing, Special publication 800-145, National Institute of Standards and Technology: U.S. Department of Commerce, 2011, CrossrefGoogle Scholar

[26]

Murugesan S., Bojanova I., Encyclopedia of cloud computing, John Wiley & Sons, Ltd., UK, 2016. Google Scholar

[27]

Nelson R., Tantawi A.N., Approximate analysis of fork/join synchronization in parallel queues, IEEE Trans. Comput., 1988, 37, 6, 739–743, CrossrefGoogle Scholar

[28]

Neuts M.F., A versatile Markovian point process, Journal of Applied Probability, 1979, 16, 764–779, CrossrefGoogle Scholar

[29]

Neuts M.F., Matrix-geometric solutions in stochastic models: An algorithmic approach, The Johns Hopkins University Press, Baltimore, MD, 1981. Google Scholar

[30]

Neuts M.F., Structured stochastic matrices of *M*/*G*/1 type and their applications, Marcel Dekker, NY, 1989. Google Scholar

[31]

Neuts M.F., Models based on the Markovian arrival process, IEICE Transactions on Communications, 1992, E75B, 1255–1265. Google Scholar

[32]

Neuts M.F., Algorithmic Probability: A collection of problems, Chapman and Hall, NY, 1995.Google Scholar

[33]

Nouman Durrani M., Shamsi J. A., Volunteer computing: requirements, challenges, and solutions, Journal of Network and Computer Applications, 2014, 39, 369–380, CrossrefWeb of ScienceGoogle Scholar

[34]

Qiu Z., Perez J.F., Harrison P.G., Tackling latency via replication in distributed systems, In: Proceedings of ICPE’16, March 12-18, 2016, Delft, Netherlands, 2016, CrossrefGoogle Scholar

[35]

Rood B., Lewis M.J., Grid Resource Availability Prediction-Based Scheduling and Task Replication, Journal of Grid Computing, 7, 2009, 479–500, CrossrefWeb of ScienceGoogle Scholar

[36]

Rumyantsev A., Chakravarthy S. R., Split-Merge Model of Workunit Replication in Distributed Computing, In: Proceedings of the Third International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2017), CEUR Workshop Proceedings, Vol. 1973, 2017, 27–34. Google Scholar

[37]

Squillante M. S., Zhang Y., Sivasubramaniam A., Gautam N., Generalized parallel-server fork-join queues with dynamic task scheduling, Annals of Operations Research, 2008, 160, 227–255. Web of ScienceCrossrefGoogle Scholar

[38]

Steeb W-H., Hardy Y., Matrix Calculus and Kronecker Product, World Scientific Publishing, Singapore, 2011. Google Scholar

[39]

Thomasian A., Analysis of Fork/Join and Related Queueing Systems, ACM Comput. Surv., 2014, 47, 2, Article 17, 71 p., http://dx.doi.org/10.1145/2628913 Web of Science

[40]

Voas J., Zhang J., Cloud computing: New wine or just a new bottle? IEEE ITPro, 2009, 15–17.Google Scholar

[41]

Vulimiri A., Godfrey P.B., Mittal R., Sherry J., Ratnasamy S., Shenker S., Low latency via redundancy, In: Proceedings of CoNEXT’13, Santa Barbara, California, USA, 2013, 283–294, CrossrefGoogle Scholar

## Comments (0)

General note:By using the comment function on degruyter.com you agree to our Privacy Statement. A respectful treatment of one another is important to us. Therefore we would like to draw your attention to our House Rules.