Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems最新文献_第3页

LTERadar: Towards LTE-Aware Wi-Fi Access Points LTERadar:面向支持lte的Wi-Fi接入点

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219649

C. Vlachou, Ioannis Pefkianakis, Kyu-Han Kim

引用次数: 10

Dynamic Proportional Sharing: A Game-Theoretic Approach 动态比例共享:一种博弈论方法

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219631

Rupert Freeman, S. Zahedi, Vincent Conitzer, Benjamin C. Lee

{"title":"Dynamic Proportional Sharing: A Game-Theoretic Approach","authors":"Rupert Freeman, S. Zahedi, Vincent Conitzer, Benjamin C. Lee","doi":"10.1145/3219617.3219631","DOIUrl":"https://doi.org/10.1145/3219617.3219631","url":null,"abstract":"Sharing computational resources amortizes cost and improves utilization and efficiency. When agents pool their resources, each becomes entitled to a portion of the shared pool. Static allocations in each round can guarantee entitlements and are strategy-proof, but efficiency suffers because allocations do not reflect variations in agents' demands for resources across rounds. Dynamic allocation mechanisms assign resources to agents across multiple rounds while guaranteeing agents their entitlements. Designing dynamic mechanisms is challenging, however, when agents are strategic and can benefit by misreporting their demands for resources. In this paper, we show that dynamic allocation mechanisms based on max-min fail to guarantee entitlements, strategy-proofness or both. We propose the flexible lending (FL) mechanism and show that it satisfies strategy-proofness and guarantees at least half of the utility from static allocations while providing an asymptotic efficiency guarantee. Our simulations with real and synthetic data show that the performance of the flexible lending mechanism is comparable to that of state-of-the-art mechanisms, providing agents with at least 0.98x, and on average 15x, of their utility from static allocations. Finally, we propose the T -period mechanism and prove that it satisfies strategy-proofness and guarantees entitlements for T łe 2.","PeriodicalId":210440,"journal":{"name":"Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116346026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 30

SOAP: One Clean Analysis of All Age-Based Scheduling Policies SOAP:对所有基于年龄的调度策略进行一个清晰的分析

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219632

Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf

引用次数: 12

Asymptotically Optimal Load Balancing Topologies 渐近最优负载均衡拓扑

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219674

Debankur Mukherjee, S. Borst, J. V. Leeuwaarden

{"title":"Asymptotically Optimal Load Balancing Topologies","authors":"Debankur Mukherjee, S. Borst, J. V. Leeuwaarden","doi":"10.1145/3219617.3219674","DOIUrl":"https://doi.org/10.1145/3219617.3219674","url":null,"abstract":"We consider a system of N ~servers inter-connected by some underlying graph topology~G N . Tasks with unit-mean exponential processing times arrive at the various servers as independent Poisson processes of rate lambda. Each incoming task is irrevocably assigned to whichever server has the smallest number of tasks among the one where it appears and its neighbors in G N . The above model arises in the context of load balancing in large-scale cloud networks and data centers, and has been extensively investigated in the case G N is a clique. Since the servers are exchangeable in that case, mean-field limits apply, and in particular it has been proved that for any lambda < 1, the fraction of servers with two or more tasks vanishes in the limit as N -> ınfty. For an arbitrary graph G N , mean-field techniques break down, complicating the analysis, and the queue length process tends to be worse than for a clique. Accordingly, a graph G N is said to be N -optimal or ∞N-optimal when the queue length process on G N is equivalent to that on a clique on an N -scale or ∞N-scale, respectively. We prove that if G N is an Erdos-Rényi random graph with average degree d(N), then with high probability it is N -optimal and ∞N-optimal if d(N) -> ınfty$ and d(N) / (∞N łog(N)) -> ınfty as N -> ınfty, respectively. This demonstrates that optimality can be maintained at N -scale and ∞N-scale while reducing the number of connections by nearly a factor N and ∞N/ łog(N) compared to a clique, provided the topology is suitably random. It is further shown that if G N contains Θ(N) bounded-degree nodes, then it cannot be N -optimal. In addition, we establish that an arbitrary graph G N is N -optimal when its minimum degree is N - o(N), and may not be N -optimal even when its minimum degree is c N + o(N) for any 0 < c < 1/2. Simulation experiments are conducted for various scenarios to corroborate the asymptotic results.","PeriodicalId":210440,"journal":{"name":"Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114984788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

On Resource Pooling and Separation for LRU Caching LRU缓存的资源池和分离研究

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219628

Jian Tan, Guocong Quan, Kaiyi Ji, N. Shroff

{"title":"On Resource Pooling and Separation for LRU Caching","authors":"Jian Tan, Guocong Quan, Kaiyi Ji, N. Shroff","doi":"10.1145/3219617.3219628","DOIUrl":"https://doi.org/10.1145/3219617.3219628","url":null,"abstract":"Caching systems using the Least Recently Used (LRU) principle have now become ubiquitous. A fundamental question for these systems is whether the cache space should be pooled together or divided to serve multiple flows of data item requests in order to minimize the miss probabilities. In this paper, we show that there is no straight yes or no answer to this question, and depends on complex combinations of critical factors, including, e.g., request rates, overlapped data items across different request flows, data item popularities and their sizes. To this end, we characterize the performance of multiple flows of data item requests under resource pooling and separation when the cache size is large. Analytically we show that it is asymptotically optimal to jointly serve multiple flows if their data item sizes and popularity distributions are similar, and their arrival rates do not differ significantly; the self-organizing property of LRU caching automatically optimizes the resource allocation among them asymptotically. Otherwise, separating these flows could be better, e.g., when data sizes vary significantly. We also quantify critical points beyond which resource pooling is better than separation for each of the flows when the overlapped data items exceed certain levels. These results provide new insights on the performance of caching systems.","PeriodicalId":210440,"journal":{"name":"Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems","volume":"706 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115119063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Degree of Queue Imbalance: Overcoming the Limitation of Heavy-traffic Delay Optimality in Load Balancing Systems 队列不平衡程度:克服负载均衡系统中大流量延迟最优性的限制

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219665

Xingyu Zhou, Fei Wu, Jian Tan, K. Srinivasan, N. Shroff

{"title":"Degree of Queue Imbalance: Overcoming the Limitation of Heavy-traffic Delay Optimality in Load Balancing Systems","authors":"Xingyu Zhou, Fei Wu, Jian Tan, K. Srinivasan, N. Shroff","doi":"10.1145/3219617.3219665","DOIUrl":"https://doi.org/10.1145/3219617.3219665","url":null,"abstract":"In this paper, we argue that heavy-traffic delay optimality is a coarse metric that does not necessarily imply good delay performance. Specifically, we show that any load balancing scheme is heavy-traffic delay optimal as long as it satisfies a fairly weak condition. This condition only requires that in the long-term the dispatcher favors, even slightly, shorter queues over longer queues. Hence, the empirical delay performance of heavy-traffic delay optimal schemes can range from very good (that of join-shortest-queue) to very bad (arbitrarily close to the performance of random routing). To overcome this limitation, we introduce a new metric called degree of queue imbalance, which measures the queue length difference between all the servers in steady-state. Given a heavy-traffic delay optimal load balancing scheme, we can characterize the resultant degree of queue imbalance. This, in turn, allows us to explicitly differentiate between good and poor load balancing schemes. Thus, this paper implies that good load balancing should not only be designed to be heavy-traffic delay optimal, but also have a low degree of queue imbalance.","PeriodicalId":210440,"journal":{"name":"Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122385250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Session details: Scheduling I 会话详细信息:调度

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3258589

Mor Harchol-Balter

引用次数: 0

Steady-state Approximations: Achievement Lecture 稳态近似:成就讲座

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3292040.3219618

J. Dai

引用次数: 2

State Dependent Control of Closed Queueing Networks 封闭排队网络的状态依赖控制

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219619

Siddhartha Banerjee, Yashodhan Kanoria, Pengyu Qian

{"title":"State Dependent Control of Closed Queueing Networks","authors":"Siddhartha Banerjee, Yashodhan Kanoria, Pengyu Qian","doi":"10.1145/3219617.3219619","DOIUrl":"https://doi.org/10.1145/3219617.3219619","url":null,"abstract":"We study the design of state dependent control for a closed queueing network model, inspired by shared transportation systems such as ridesharing. In particular, we focus on the design of assignment policies, wherein the platform can choose which supply unit to dispatch to meet an incoming customer request. The supply unit subsequently becomes available at the destination after dropping the customer. We consider the proportion of dropped demand in steady state as the performance measure. We propose a family of simple and explicit state dependent policies called Scaled MaxWeight (SMW) policies and prove that under the complete resource pooling (CRP) condition (analogous to a strict version of Hall's condition for bipartite matchings), any SMW policy induces an exponential decay of demand-dropping probability as the number of supply units scales to infinity. Furthermore, we show that there is an SMW policy that achieves the optimal exponent among all assignment policies, and analytically specify this policy in terms of the matrix of customer-request arrival rates. The optimal SMW policy protects structurally under-supplied locations.","PeriodicalId":210440,"journal":{"name":"Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128097634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 27

Delay Scaling in Many-Sources Wireless Networks without Queue State Information 无队列状态信息的多源无线网络中的延迟缩放

Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems Pub Date : 2018-06-12 DOI: 10.1145/3219617.3219626

S. Borst, Martin Zubeldia

{"title":"Delay Scaling in Many-Sources Wireless Networks without Queue State Information","authors":"S. Borst, Martin Zubeldia","doi":"10.1145/3219617.3219626","DOIUrl":"https://doi.org/10.1145/3219617.3219626","url":null,"abstract":"We examine a canonical scenario where several wireless data sources generate sporadic delay-sensitive messages that need to be transmitted to a common access point. The access point operates in a time-slotted fashion, and can instruct the various sources in each slot with what probability to transmit a message, if they have any. When several sources transmit simultaneously, the access point can detect a collision, but is unable to infer the identities of the sources involved. While the access point can use the channel activity observations to obtain estimates of the queue states at the various sources, it does not have any explicit queue length information otherwise. We explore the achievable delay performance in a regime where the number of sources n grows large while the relative load remains fixed. We establish that, under any medium access algorithm without queue state information, the average delay must be at least of the order of n slots when the load exceeds some threshold lambda* < 1. This demonstrates that bounded delay can only be achieved if a positive fraction of the system capacity is sacrificed. Furthermore, we introduce a scalable Two-Phase algorithm which achieves a delay upper bounded uniformly in n when the load is below e -1 , and a delay of the order of n slots when the load is between e -1 and 1. Additionally, this algorithm provides robustness against correlated source activity.","PeriodicalId":210440,"journal":{"name":"Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129558255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3