default search action
Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 2
Volume 2, Number 1, March 2018
- Shenglin Zhang, Ying Liu, Weibin Meng, Zhiling Luo, Jiahao Bu, Sen Yang, Peixian Liang, Dan Pei, Jun Xu, Yuzhi Zhang, Yu Chen, Hui Dong, Xianping Qu, Lei Song:
PreFix: Switch Failure Prediction in Datacenter Networks. 2:1-2:29 - Rupert Freeman, Seyed Majid Zahedi, Vincent Conitzer, Benjamin C. Lee:
Dynamic Proportional Sharing: A Game-Theoretic Approach. 3:1-3:36 - Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. 4:1-4:26 - Jian Tan, Guocong Quan, Kaiyi Ji, Ness B. Shroff:
On Resource Pooling and Separation for LRU Caching. 5:1-5:31 - Mohammad A. Islam, Luting Yang, Kiran Ranganath, Shaolei Ren:
Why Some Like It Loud: Timing Power Attacks in Multi-tenant Data Centers Using an Acoustic Side Channel. 6:1-6:33 - Santiago Duran, Ina Maria Verloop:
Asymptotic Optimal Control of Markov-Modulated Restless Bandits. 7:1-7:25 - Zhaowei Tan, Yuanjie Li, Qianru Li, Zhehui Zhang, Zhehan Li, Songwu Lu:
Supporting Mobile VR in LTE Networks: How Close Are We? 8:1-8:31 - Saba Ahmadian, Onur Mutlu, Hossein Asadi:
ECI-Cache: A High-Endurance and Cost-Efficient I/O Caching Scheme for Virtualized Platforms. 9:1-9:34 - Eliav Buchnik, Edith Cohen:
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity. 10:1-10:19 - Qingkai Liang, Eytan H. Modiano:
Minimizing Queue Length Regret Under Adversarial Network Models. 11:1-11:32 - Xiaohan Wei, Hao Yu, Michael J. Neely:
Online Learning in Weakly Coupled Markov Decision Processes: A Convergence Time Study. 12:1-12:38 - Donggyu Yun, Alexandre Proutière, Sumyeong Ahn, Jinwoo Shin, Yung Yi:
Multi-armed Bandit with Additional Observations. 13:1-13:22 - Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden:
Asymptotically Optimal Load Balancing Topologies. 14:1-14:29 - Arjun Anand, Gustavo de Veciana:
A Whittle's Index Based Approach for QoE Optimization in Wireless Networks. 15:1-15:39 - Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
SOAP: One Clean Analysis of All Age-Based Scheduling Policies. 16:1-16:30 - Pengfei Zheng, Benjamin C. Lee:
Hound: Causal Learning for Datacenter-scale Straggler Diagnosis. 17:1-17:36 - Bo Jiang, Philippe Nain, Don Towsley, Saikat Guha:
On a Class of Stochastic Multilayer Networks. 18:1-18:25 - Vlad Nitu, Aram Kocharyan, Hannas Yaya, Alain Tchana, Daniel Hagimont, Hrachya V. Astsatryan:
Working Set Size Estimation Techniques in Virtualized Environments: One Size Does not Fit All. 19:1-19:22 - Xingyu Zhou, Fei Wu, Jian Tan, Kannan Srinivasan, Ness B. Shroff:
Degree of Queue Imbalance: Overcoming the Limitation of Heavy-traffic Delay Optimality in Load Balancing Systems. 21:1-21:41 - Kausik Subramanian, Loris D'Antoni, Aditya Akella:
Synthesis of Fault-Tolerant Distributed Router Configurations. 22:1-22:26
Volume 2, Number 2, June 2018
- Adam Wierman, Aditya Akella:
Message from the Editors. 23:1 - Lin Yang, Lei Deng, Mohammad Hassan Hajiesmaili, Cheng Tan, Wing Shing Wong:
An Optimal Algorithm for Online Non-Convex Learning. 25:1-25:25 - Mowei Wang, Yong Cui, Shihan Xiao, Xin Wang, Dan Yang, Kai Chen, Jun Zhu:
Neural Network Meets DCN: Traffic-driven Topology Adaptation with Deep Learning. 26:1-26:25 - Tim Hellemans, Benny Van Houdt:
On the Power-of-d-choices with Least Loaded Server Selection. 27:1-27:22 - Oleksii Oleksenko, Dmitrii Kuvaiskii, Pramod Bhatotia, Pascal Felber, Christof Fetzer:
Intel MPX Explained: A Cross-layer Analysis of the Intel MPX System Stack. 28:1-28:30 - Giulia Fanti, Shaileshh Bojja Venkatakrishnan, Surya Bakshi, Bradley Denby, Shruti Bhargava, Andrew Miller, Pramod Viswanath:
Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees. 29:1-29:35 - Thibault Séjourné, Samitha Samaranayake, Siddhartha Banerjee:
The Price of Fragmentation in Mobility-on-Demand Services. 30:1-30:26 - Jessica Hoffmann, Constantine Caramanis:
The Cost of Uncertainty in Curing Epidemics. 31:1-31:33 - Daniel S. Berger, Nathan Beckmann, Mor Harchol-Balter:
Practical Bounds on Optimal Caching with Variable Object Sizes. 32:1-32:38 - Christina Vlachou, Ioannis Pefkianakis, Kyu-Han Kim:
LTERadar: Towards LTE-Aware Wi-Fi Access Points. 33:1-33:31 - Sem C. Borst, Martin Zubeldia:
Delay Scaling in Many-Sources Wireless Networks without Queue State Information. 34:1-34:45 - Akshay Jain, Mahmoud Khairy, Timothy G. Rogers:
A Quantitative Evaluation of Contemporary GPU Simulation Methodology. 35:1-35:28 - Mohammad Sadegh Talebi, Alexandre Proutière:
Learning Proportionally Fair Allocations with Low Regret. 36:1-36:31
Volume 2, Number 3, December 2018
- Yixin Luo, Saugata Ghose, Yu Cai, Erich F. Haratsch, Onur Mutlu:
Improving 3D NAND Flash Memory Lifetime by Tolerating Early Retention Loss and Process Variation. 37:1-37:48 - Saugata Ghose, Abdullah Giray Yaglikçi, Raghav Gupta, Donghyuk Lee, Kais Kudrolli, William X. Liu, Hasan Hassan, Kevin K. Chang, Niladrish Chatterjee, Aditya Agrawal, Mike O'Connor, Onur Mutlu:
What Your DRAM Power Models Are Not Telling You: Lessons from a Detailed Experimental Study. 38:1-38:41 - Xulong Tang, Ashutosh Pattnaik, Onur Kayiran, Adwait Jog, Mahmut Taylan Kandemir, Chita R. Das:
Quantifying Data Locality in Dynamic Parallelism in GPUs. 39:1-39:24 - Anish Agarwal, Muhammad Jehangir Amjad, Devavrat Shah, Dennis Shen:
Model Agnostic Time Series Analysis via Matrix Estimation. 40:1-40:39 - Xingyu Zhou, Jian Tan, Ness B. Shroff:
Heavy-traffic Delay Optimality in Pull-based Load Balancing Systems: Necessary and Sufficient Conditions. 41:1-41:33 - Xulong Tang, Mahmut Taylan Kandemir, Hui Zhao, Myoungsoo Jung, Mustafa Karaköy:
Computing with Near Data. 42:1-42:30 - Florin Ciucu, Felix Poloczek:
Two Extensions of Kingman's GI/G/1 Bound. 43:1-43:33
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.