Asynchronous Optimization over Weakly Coupled Renewal Systems

References

• Altman E (1999) Constrained Markov Decision Processes (Chapman and Hall/CRC Press, Boca Raton, FL).Google Scholar
• Bertsekas D (2009) Convex Optimization Theory (Athena Scientific, Nashua, NH).Google Scholar
• Bertsekas DP (2001) Dynamic Programming and Optimal Control, 2nd ed., Vol. 1 (Athena Scientific, Nashua, NH).Google Scholar
• Bertsekas DP, Tsitsiklis JN (1997) Parallel and Distributed Computation: Numerical Methods (Athena Scientific, Nashua, NH).Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Google Scholar
• Boyd S, Ghosh A, Prabhakar B, Shah D (2006) Randomized gossip algorithms. IEEE/ACM Trans. Inform. Theory 52(6):2508–2530.Google Scholar
• Durrett R (2013) Probability: Theory and Examples, 4th ed. (Cambridge University Press, New York).Google Scholar
• Fox B (1966) Markov renewal programming by linear fractional programming. SIAM J. Appl. Math. 14(6):1418–1432.Google Scholar
• Gandhi A, Doroudi S, Harchol-Balter M, Scheller-Wolf A (2013) Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. Proc. 2013 ACM SIGMETRICS (ACM, New York), 153–166.Google Scholar
• Li C, Neely MJ (2014) Solving convex optimization with side constraints in a multi-class queue by adaptive cμ. Queueing Systems 77(3):331–372.Google Scholar
• Neely MJ (2010) Stochastic Network Optimization with Application to Communication and Queueing Systems (Morgan & Claypool, San Rafael, CA).Google Scholar
• Neely MJ (2012a) Asynchronous control for coupled Markov decision systems. Proc. 2102 IEEE Inform. Theory Workshop (ITW) (IEEE, Piscataway, NJ), 287–291.Google Scholar
• Neely MJ (2012b) Asynchronous scheduling for energy optimality in systems with multiple servers. Proc. 46th Annual Conf. Inform. Sci. Systems (CISS) (IEEE, Piscataway, NJ), 1–6.Google Scholar
• Neely MJ (2013) Dynamic optimization and learning for renewal systems. IEEE Trans. Automatic Control 58(1):32–46.Google Scholar
• Peng Z, Xu Y, Yan M, Yin W (2016) ARock: An algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38(5):A2851–A2879.Google Scholar
• Rockafellar RT (2015) Convex Analysis (Princeton University Press, Princeton, NJ).Google Scholar
• Ross S (2002) Introduction to Probability Models, 8th ed. (Academic Press, Burlington, MA).Google Scholar
• Schaible S (1983) Fractional programming. Zeitschrift Oper. Res. 27(1):39–54.Google Scholar
• Srivastava K, Nedic A (2011) Distributed asynchronous constrained stochastic optimization. IEEE J. Selected Topics Signal Processing 5(4):772–790.Google Scholar
• Wei X, Neely MJ (2017) Data center server provision: Distributed asynchronous control for coupled renewal systems. IEEE/ACM Trans. Networking 25(4):2180–2194.Google Scholar
• Yao DD (2002) Dynamic scheduling via polymatroid optimization. Calzarossa MC, Tucci S, eds. Proc. Performance Evaluation Complex Systems: Techniques Tools: Performance 2002 Tutorial Lectures (Springer, Berlin), 89–113.Google Scholar