\n \n \n
\n
\n\n \n \n \n \n \n \n Predicting vehicular travel times by modeling heterogeneous influences between arterial roads.\n \n \n \n \n\n\n \n Achar, A.; Sarangan, V.; Regikumar, R.; and Sivasubramaniam, A.\n\n\n \n\n\n\n
CoRR, abs/1711.05767. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{achar_predicting_2017,\n\ttitle = {Predicting vehicular travel times by modeling heterogeneous influences between arterial roads},\n\tvolume = {abs/1711.05767},\n\turl = {http://arxiv.org/abs/1711.05767},\n\tjournal = {CoRR},\n\tauthor = {Achar, Avinash and Sarangan, Venkatesh and Regikumar, Rohith and Sivasubramaniam, Anand},\n\tyear = {2017}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Incentive design for demand-response based on building constraints: a utility perspective.\n \n \n \n \n\n\n \n Kandhway, K.; Vasan, A.; Nagarathinam, S.; Sarangan, V.; and Sivasubramaniam, A.\n\n\n \n\n\n\n In
Proceedings of the 4th ACM International Conference on Systems for Energy-Efficient Built Environments, BuildSys 2017, Delft, The Netherlands, November 08-09, 2017, pages 29:1–29:10, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{kandhway_incentive_2017,\n\ttitle = {Incentive design for demand-response based on building constraints: a utility perspective},\n\turl = {https://doi.org/10.1145/3137133.3137142},\n\tdoi = {10.1145/3137133.3137142},\n\tbooktitle = {Proceedings of the 4th {ACM} {International} {Conference} on {Systems} for {Energy}-{Efficient} {Built} {Environments}, {BuildSys} 2017, {Delft}, {The} {Netherlands}, {November} 08-09, 2017},\n\tauthor = {Kandhway, Kundan and Vasan, Arunchandar and Nagarathinam, Srinarayana and Sarangan, Venkatesh and Sivasubramaniam, Anand},\n\tyear = {2017},\n\tpages = {29:1--29:10}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Cracks Under Pressure? Burst Prediction in Water Networks Using Dynamic Metrics.\n \n \n \n \n\n\n \n Kaushik, G.; Manimaran, A.; Vasan, A.; Sarangan, V.; and Sivasubramaniam, A.\n\n\n \n\n\n\n In
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 4694–4700, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{kaushik_cracks_2017,\n\ttitle = {Cracks {Under} {Pressure}? {Burst} {Prediction} in {Water} {Networks} {Using} {Dynamic} {Metrics}},\n\turl = {http://aaai.org/ocs/index.php/IAAI/IAAI17/paper/view/14356},\n\tbooktitle = {Proceedings of the {Thirty}-{First} {AAAI} {Conference} on {Artificial} {Intelligence}, {February} 4-9, 2017, {San} {Francisco}, {California}, {USA}.},\n\tauthor = {Kaushik, Gollakota and Manimaran, Abinaya and Vasan, Arunchandar and Sarangan, Venkatesh and Sivasubramaniam, Anand},\n\tyear = {2017},\n\tpages = {4694--4700}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Right-Sizing Geo-distributed Data Centers for Availability and Latency.\n \n \n \n \n\n\n \n Narayanan, I.; Kansal, A.; and Sivasubramaniam, A.\n\n\n \n\n\n\n In
37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5-8, 2017, pages 230–240, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{narayanan_right-sizing_2017,\n\ttitle = {Right-{Sizing} {Geo}-distributed {Data} {Centers} for {Availability} and {Latency}},\n\turl = {https://doi.org/10.1109/ICDCS.2017.118},\n\tdoi = {10.1109/ICDCS.2017.118},\n\tbooktitle = {37th {IEEE} {International} {Conference} on {Distributed} {Computing} {Systems}, {ICDCS} 2017, {Atlanta}, {GA}, {USA}, {June} 5-8, 2017},\n\tauthor = {Narayanan, Iyswarya and Kansal, Aman and Sivasubramaniam, Anand},\n\tyear = {2017},\n\tpages = {230--240}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Rain or Shine? - Making Sense of Cloudy Reliability Data.\n \n \n \n \n\n\n \n Narayanan, I.; Sharma, B.; Wang, D.; Govindan, S.; Caulfield, L.; Sivasubramaniam, A.; Kansal, A.; Liu, J.; Khessib, B.; and Vaid, K.\n\n\n \n\n\n\n In
37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5-8, 2017, pages 218–229, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{narayanan_rain_2017,\n\ttitle = {Rain or {Shine}? - {Making} {Sense} of {Cloudy} {Reliability} {Data}},\n\turl = {https://doi.org/10.1109/ICDCS.2017.103},\n\tdoi = {10.1109/ICDCS.2017.103},\n\tbooktitle = {37th {IEEE} {International} {Conference} on {Distributed} {Computing} {Systems}, {ICDCS} 2017, {Atlanta}, {GA}, {USA}, {June} 5-8, 2017},\n\tauthor = {Narayanan, Iyswarya and Sharma, Bikash and Wang, Di and Govindan, Sriram and Caulfield, Laura and Sivasubramaniam, Anand and Kansal, Aman and Liu, Jie and Khessib, Badriddine and Vaid, Kushagra},\n\tyear = {2017},\n\tpages = {218--229}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Exploring the impact of memory block permutation on performance of a crossbar ReRAM main memory.\n \n \n \n \n\n\n \n Ramezani, M.; Elyasi, N.; Arjomand, M.; Kandemir, M. T.; and Sivasubramaniam, A.\n\n\n \n\n\n\n In
2017 IEEE International Symposium on Workload Characterization, IISWC 2017, Seattle, WA, USA, October 1-3, 2017, pages 167–176, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{ramezani_exploring_2017,\n\ttitle = {Exploring the impact of memory block permutation on performance of a crossbar {ReRAM} main memory},\n\turl = {https://doi.org/10.1109/IISWC.2017.8167774},\n\tdoi = {10.1109/IISWC.2017.8167774},\n\tbooktitle = {2017 {IEEE} {International} {Symposium} on {Workload} {Characterization}, {IISWC} 2017, {Seattle}, {WA}, {USA}, {October} 1-3, 2017},\n\tauthor = {Ramezani, Morteza and Elyasi, Nima and Arjomand, Mohammad and Kandemir, Mahmut T. and Sivasubramaniam, Anand},\n\tyear = {2017},\n\tpages = {167--176}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n HL-PCM: MLC PCM Main Memory with Accelerated Read.\n \n \n \n \n\n\n \n Arjomand, M.; Jadidi, A.; Kandemir, M. T.; Sivasubramaniam, A.; and Das, C. R.\n\n\n \n\n\n\n
IEEE Trans. Parallel Distrib. Syst., 28(11): 3188–3200. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{arjomand_hl-pcm:_2017,\n\ttitle = {{HL}-{PCM}: {MLC} {PCM} {Main} {Memory} with {Accelerated} {Read}},\n\tvolume = {28},\n\turl = {https://doi.org/10.1109/TPDS.2017.2705125},\n\tdoi = {10.1109/TPDS.2017.2705125},\n\tnumber = {11},\n\tjournal = {IEEE Trans. Parallel Distrib. Syst.},\n\tauthor = {Arjomand, Mohammad and Jadidi, Amin and Kandemir, Mahmut T. and Sivasubramaniam, Anand and Das, Chita R.},\n\tyear = {2017},\n\tpages = {3188--3200}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Evaluating energy storage for a multitude of uses in the datacenter.\n \n \n \n \n\n\n \n Narayanan, I.; Wang, D.; Mamun, A. A.; Sivasubramaniam, A.; Fathy, H. K.; and James, S.\n\n\n \n\n\n\n In
2017 IEEE International Symposium on Workload Characterization, IISWC 2017, Seattle, WA, USA, October 1-3, 2017, pages 12–21, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{narayanan_evaluating_2017,\n\ttitle = {Evaluating energy storage for a multitude of uses in the datacenter},\n\turl = {https://doi.org/10.1109/IISWC.2017.8167752},\n\tdoi = {10.1109/IISWC.2017.8167752},\n\tbooktitle = {2017 {IEEE} {International} {Symposium} on {Workload} {Characterization}, {IISWC} 2017, {Seattle}, {WA}, {USA}, {October} 1-3, 2017},\n\tauthor = {Narayanan, Iyswarya and Wang, Di and Mamun, Abdullah Al and Sivasubramaniam, Anand and Fathy, Hosam K. and James, Sean},\n\tyear = {2017},\n\tpages = {12--21}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Qantifying The Impact of Electric Vehicles On The Electric Grid: A Simulation Based Case-Study.\n \n \n \n \n\n\n \n Ramanujam, A.; Sankaranarayanan, P.; Vasan, A.; Jayaprakash, R.; Sarangan, V.; and Sivasubramaniam, A.\n\n\n \n\n\n\n In
Proceedings of the Eighth International Conference on Future Energy Systems, e-Energy 2017, Shatin, Hong Kong, China, May 16-19, 2017, pages 228–233, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{ramanujam_qantifying_2017,\n\ttitle = {Qantifying {The} {Impact} of {Electric} {Vehicles} {On} {The} {Electric} {Grid}: {A} {Simulation} {Based} {Case}-{Study}},\n\turl = {https://doi.org/10.1145/3077839.3077854},\n\tdoi = {10.1145/3077839.3077854},\n\tbooktitle = {Proceedings of the {Eighth} {International} {Conference} on {Future} {Energy} {Systems}, e-{Energy} 2017, {Shatin}, {Hong} {Kong}, {China}, {May} 16-19, 2017},\n\tauthor = {Ramanujam, Arvind and Sankaranarayanan, Pandeeswari and Vasan, Arun and Jayaprakash, Rajesh and Sarangan, Venkatesh and Sivasubramaniam, Anand},\n\tyear = {2017},\n\tpages = {228--233}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Characterizing diverse handheld apps for customized hardware acceleration.\n \n \n \n \n\n\n \n Rengasamy, P. V.; Zhang, H.; Nachiappan, N. C.; Zhao, S.; Sivasubramaniam, A.; Kandemir, M. T.; and Das, C. R.\n\n\n \n\n\n\n In
2017 IEEE International Symposium on Workload Characterization, IISWC 2017, Seattle, WA, USA, October 1-3, 2017, pages 187–196, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{rengasamy_characterizing_2017,\n\ttitle = {Characterizing diverse handheld apps for customized hardware acceleration},\n\turl = {https://doi.org/10.1109/IISWC.2017.8167776},\n\tdoi = {10.1109/IISWC.2017.8167776},\n\tbooktitle = {2017 {IEEE} {International} {Symposium} on {Workload} {Characterization}, {IISWC} 2017, {Seattle}, {WA}, {USA}, {October} 1-3, 2017},\n\tauthor = {Rengasamy, Prasanna Venkatesh and Zhang, Haibo and Nachiappan, Nachiappan Chidambaram and Zhao, Shulin and Sivasubramaniam, Anand and Kandemir, Mahmut T. and Das, Chita R.},\n\tyear = {2017},\n\tpages = {187--196}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Race-to-sleep + content caching + display caching: a recipe for energy-efficient video streaming on handhelds.\n \n \n \n \n\n\n \n Zhang, H.; Rengasamy, P. V.; Zhao, S.; Nachiappan, N. C.; Sivasubramaniam, A.; Kandemir, M. T.; Iyer, R.; and Das, C. R.\n\n\n \n\n\n\n In
Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2017, Cambridge, MA, USA, October 14-18, 2017, pages 517–531, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{zhang_race--sleep_2017,\n\ttitle = {Race-to-sleep + content caching + display caching: a recipe for energy-efficient video streaming on handhelds},\n\turl = {https://doi.org/10.1145/3123939.3123948},\n\tdoi = {10.1145/3123939.3123948},\n\tbooktitle = {Proceedings of the 50th {Annual} {IEEE}/{ACM} {International} {Symposium} on {Microarchitecture}, {MICRO} 2017, {Cambridge}, {MA}, {USA}, {October} 14-18, 2017},\n\tauthor = {Zhang, Haibo and Rengasamy, Prasanna Venkatesh and Zhao, Shulin and Nachiappan, Nachiappan Chidambaram and Sivasubramaniam, Anand and Kandemir, Mahmut T. and Iyer, Ravi and Das, Chita R.},\n\tyear = {2017},\n\tpages = {517--531}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Using Burstable Instances in the Public Cloud: Why, When and How?.\n \n \n \n \n\n\n \n Wang, C.; Urgaonkar, B.; Nasiriani, N.; and Kesidis, G.\n\n\n \n\n\n\n
POMACS, 1(1): 11:1–11:28. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{wang_using_2017,\n\ttitle = {Using {Burstable} {Instances} in the {Public} {Cloud}: {Why}, {When} and {How}?},\n\tvolume = {1},\n\turl = {https://doi.org/10.1145/3084448},\n\tdoi = {10.1145/3084448},\n\tnumber = {1},\n\tjournal = {POMACS},\n\tauthor = {Wang, Cheng and Urgaonkar, Bhuvan and Nasiriani, Neda and Kesidis, George},\n\tyear = {2017},\n\tpages = {11:1--11:28}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Resource Accounting of Shared IT Resources in Multi-Tenant Clouds.\n \n \n \n \n\n\n \n Tak, B.; Kwon, Y.; and Urgaonkar, B.\n\n\n \n\n\n\n
IEEE Trans. Services Computing, 10(2): 302–315. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{tak_resource_2017,\n\ttitle = {Resource {Accounting} of {Shared} {IT} {Resources} in {Multi}-{Tenant} {Clouds}},\n\tvolume = {10},\n\turl = {https://doi.org/10.1109/TSC.2015.2453980},\n\tdoi = {10.1109/TSC.2015.2453980},\n\tnumber = {2},\n\tjournal = {IEEE Trans. Services Computing},\n\tauthor = {Tak, Byung-Chul and Kwon, Youngjin and Urgaonkar, Bhuvan},\n\tyear = {2017},\n\tpages = {302--315}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Exploiting Spot and Burstable Instances for Improving the Cost-efficacy of In-Memory Caches on the Public Cloud.\n \n \n \n \n\n\n \n Wang, C.; Urgaonkar, B.; Gupta, A.; Kesidis, G.; and Liang, Q.\n\n\n \n\n\n\n In
Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, Belgrade, Serbia, April 23-26, 2017, pages 620–634, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{wang_exploiting_2017,\n\ttitle = {Exploiting {Spot} and {Burstable} {Instances} for {Improving} the {Cost}-efficacy of {In}-{Memory} {Caches} on the {Public} {Cloud}},\n\turl = {https://doi.org/10.1145/3064176.3064220},\n\tdoi = {10.1145/3064176.3064220},\n\tbooktitle = {Proceedings of the {Twelfth} {European} {Conference} on {Computer} {Systems}, {EuroSys} 2017, {Belgrade}, {Serbia}, {April} 23-26, 2017},\n\tauthor = {Wang, Cheng and Urgaonkar, Bhuvan and Gupta, Aayush and Kesidis, George and Liang, Qianlin},\n\tyear = {2017},\n\tpages = {620--634}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Per-Server Dominant-Share Fairness (PS-DSF): A multi-resource fair allocation mechanism for heterogeneous servers.\n \n \n \n \n\n\n \n Khamse-Ashari, J.; Lambadaris, I.; Kesidis, G.; Urgaonkar, B.; and Zhao, Y. Q.\n\n\n \n\n\n\n In
IEEE International Conference on Communications, ICC 2017, Paris, France, May 21-25, 2017, pages 1–7, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{khamse-ashari_per-server_2017,\n\ttitle = {Per-{Server} {Dominant}-{Share} {Fairness} ({PS}-{DSF}): {A} multi-resource fair allocation mechanism for heterogeneous servers},\n\turl = {https://doi.org/10.1109/ICC.2017.7996727},\n\tdoi = {10.1109/ICC.2017.7996727},\n\tbooktitle = {{IEEE} {International} {Conference} on {Communications}, {ICC} 2017, {Paris}, {France}, {May} 21-25, 2017},\n\tauthor = {Khamse-Ashari, Jalal and Lambadaris, Ioannis and Kesidis, George and Urgaonkar, Bhuvan and Zhao, Yiqiang Q.},\n\tyear = {2017},\n\tpages = {1--7}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient and fair scheduling of placement constrained threads on heterogeneous multi-processors.\n \n \n \n \n\n\n \n Khamse-Ashari, J.; Kesidis, G.; Lambadaris, I.; Urgaonkar, B.; and Zhao, Y. Q.\n\n\n \n\n\n\n In
2017 IEEE Conference on Computer Communications Workshops, INFOCOM Workshops, Atlanta, GA, USA, May 1-4, 2017, pages 48–53, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{khamse-ashari_efficient_2017,\n\ttitle = {Efficient and fair scheduling of placement constrained threads on heterogeneous multi-processors},\n\turl = {https://doi.org/10.1109/INFCOMW.2017.8116351},\n\tdoi = {10.1109/INFCOMW.2017.8116351},\n\tbooktitle = {2017 {IEEE} {Conference} on {Computer} {Communications} {Workshops}, {INFOCOM} {Workshops}, {Atlanta}, {GA}, {USA}, {May} 1-4, 2017},\n\tauthor = {Khamse-Ashari, Jalal and Kesidis, George and Lambadaris, Ioannis and Urgaonkar, Bhuvan and Zhao, Yiqiang Q.},\n\tyear = {2017},\n\tpages = {48--53}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Multicommodity games in public-cloud markets considering subadditive resource demands.\n \n \n \n \n\n\n \n Kesidis, G.; Nasiriani, N.; Shan, Y.; Urgaonkar, B.; and Lambadaris, I.\n\n\n \n\n\n\n In
2017 IEEE Conference on Computer Communications Workshops, INFOCOM Workshops, Atlanta, GA, USA, May 1-4, 2017, pages 654–658, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{kesidis_multicommodity_2017,\n\ttitle = {Multicommodity games in public-cloud markets considering subadditive resource demands},\n\turl = {https://doi.org/10.1109/INFCOMW.2017.8116454},\n\tdoi = {10.1109/INFCOMW.2017.8116454},\n\tbooktitle = {2017 {IEEE} {Conference} on {Computer} {Communications} {Workshops}, {INFOCOM} {Workshops}, {Atlanta}, {GA}, {USA}, {May} 1-4, 2017},\n\tauthor = {Kesidis, George and Nasiriani, Neda and Shan, Yuquan and Urgaonkar, Bhuvan and Lambadaris, Ioannis},\n\tyear = {2017},\n\tpages = {654--658}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Competition and Peak-Demand Pricing in Clouds Under Tenants' Demand Response.\n \n \n \n \n\n\n \n Kesidis, G.; Shanbhag, U. V.; Nasiriani, N.; and Urgaonkar, B.\n\n\n \n\n\n\n In
25th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS 2017, Banff, AB, Canada, September 20-22, 2017, pages 244–254, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{kesidis_competition_2017,\n\ttitle = {Competition and {Peak}-{Demand} {Pricing} in {Clouds} {Under} {Tenants}' {Demand} {Response}},\n\turl = {https://doi.org/10.1109/MASCOTS.2017.24},\n\tdoi = {10.1109/MASCOTS.2017.24},\n\tbooktitle = {25th {IEEE} {International} {Symposium} on {Modeling}, {Analysis}, and {Simulation} of {Computer} and {Telecommunication} {Systems}, {MASCOTS} 2017, {Banff}, {AB}, {Canada}, {September} 20-22, 2017},\n\tauthor = {Kesidis, George and Shanbhag, Uday V. and Nasiriani, Neda and Urgaonkar, Bhuvan},\n\tyear = {2017},\n\tpages = {244--254}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Using Burstable Instances in the Public Cloud: Why, When and How?.\n \n \n \n \n\n\n \n Wang, C.; Urgaonkar, B.; Nasiriani, N.; and Kesidis, G.\n\n\n \n\n\n\n In
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05 - 09, 2017, pages 56, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{wang_using_2017-1,\n\ttitle = {Using {Burstable} {Instances} in the {Public} {Cloud}: {Why}, {When} and {How}?},\n\turl = {https://doi.org/10.1145/3078505.3078591},\n\tdoi = {10.1145/3078505.3078591},\n\tbooktitle = {Proceedings of the 2017 {ACM} {SIGMETRICS} / {International} {Conference} on {Measurement} and {Modeling} of {Computer} {Systems}, {Urbana}-{Champaign}, {IL}, {USA}, {June} 05 - 09, 2017},\n\tauthor = {Wang, Cheng and Urgaonkar, Bhuvan and Nasiriani, Neda and Kesidis, George},\n\tyear = {2017},\n\tpages = {56}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n An Empirical Analysis of Amazon EC2 Spot Instance Features Affecting Cost-effective Resource Procurement.\n \n \n \n \n\n\n \n Wang, C.; Liang, Q.; and Urgaonkar, B.\n\n\n \n\n\n\n In
Proceedings of the 8th ACM/SPEC on International Conference on Performance Engineering, ICPE 2017, L'Aquila, Italy, April 22-26, 2017, pages 63–74, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{wang_empirical_2017,\n\ttitle = {An {Empirical} {Analysis} of {Amazon} {EC}2 {Spot} {Instance} {Features} {Affecting} {Cost}-effective {Resource} {Procurement}},\n\turl = {https://doi.org/10.1145/3030207.3030210},\n\tdoi = {10.1145/3030207.3030210},\n\tbooktitle = {Proceedings of the 8th {ACM}/{SPEC} on {International} {Conference} on {Performance} {Engineering}, {ICPE} 2017, {L}'{Aquila}, {Italy}, {April} 22-26, 2017},\n\tauthor = {Wang, Cheng and Liang, Qianlin and Urgaonkar, Bhuvan},\n\tyear = {2017},\n\tpages = {63--74}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient max-min and proportional fair constrained multiresource scheduling.\n \n \n \n \n\n\n \n Kesidis, G.; Shan, Y.; Wang, Y.; Urgaonkar, B.; Khamse-Ashari, J.; and Lambadaris, I.\n\n\n \n\n\n\n
CoRR, abs/1705.06102. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{kesidis_efficient_2017,\n\ttitle = {Efficient max-min and proportional fair constrained multiresource scheduling},\n\tvolume = {abs/1705.06102},\n\turl = {http://arxiv.org/abs/1705.06102},\n\tjournal = {CoRR},\n\tauthor = {Kesidis, George and Shan, Yuquan and Wang, Yujia and Urgaonkar, Bhuvan and Khamse-Ashari, Jalal and Lambadaris, Ioannis},\n\tyear = {2017}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n An Efficient and Fair Multi-Resource Allocation Mechanism for Heterogeneous Servers.\n \n \n \n \n\n\n \n Khamse-Ashari, J.; Lambadaris, I.; Kesidis, G.; Urgaonkar, B.; and Zhao, Y. Q.\n\n\n \n\n\n\n
CoRR, abs/1712.10114. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{khamse-ashari_efficient_2017-1,\n\ttitle = {An {Efficient} and {Fair} {Multi}-{Resource} {Allocation} {Mechanism} for {Heterogeneous} {Servers}},\n\tvolume = {abs/1712.10114},\n\turl = {http://arxiv.org/abs/1712.10114},\n\tjournal = {CoRR},\n\tauthor = {Khamse-Ashari, Jalal and Lambadaris, Ioannis and Kesidis, George and Urgaonkar, Bhuvan and Zhao, Yiqiang Q.},\n\tyear = {2017}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n WorkloadCompactor: reducing datacenter cost while providing tail latency SLO guarantees.\n \n \n \n \n\n\n \n Zhu, T.; Kozuch, M. A.; and Harchol-Balter, M.\n\n\n \n\n\n\n In
Proceedings of the 2017 Symposium on Cloud Computing, SoCC 2017, Santa Clara, CA, USA, September 24-27, 2017, pages 598–610, 2017. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{zhu_workloadcompactor:_2017,\n\ttitle = {{WorkloadCompactor}: reducing datacenter cost while providing tail latency {SLO} guarantees},\n\turl = {https://doi.org/10.1145/3127479.3132245},\n\tdoi = {10.1145/3127479.3132245},\n\tbooktitle = {Proceedings of the 2017 {Symposium} on {Cloud} {Computing}, {SoCC} 2017, {Santa} {Clara}, {CA}, {USA}, {September} 24-27, 2017},\n\tauthor = {Zhu, Timothy and Kozuch, Michael A. and Harchol-Balter, Mor},\n\tyear = {2017},\n\tpages = {598--610}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n