Filters








14 Hits in 6.0 sec

A Better Model for Task Assignment in Server Farms

Mor Harchol-Balter
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
Popular policies include Round-Robin assignment, Join-the-Shortest-Queue, Join-Queue-with-Least-Work, and so on.  ...  An age-old problem in the design of server farms is the choice of the task assignment policy. This is the algorithm that determines how to assign incoming jobs to servers.  ...  SIGMETRICS '16, June 14-18, 2016, Antibes Juan-Les-Pins, France. ACM ISBN 978-1-4503-4266-7/16/06.  ... 
doi:10.1145/2896377.2901900 dblp:conf/sigmetrics/Harchol-Balter16 fatcat:5gqihgp77zcifcr35453imwra4

Analyzing the Power Consumption of the Mobile Page Load

Yi Cao, Javad Nejati, Pavan Maguluri, Aruna Balasubramanian, Anshul Gandhi
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
This work was supported by the National Science Foundation through the grant CNS-1551909 and a Google Research Grant R2-2015-839.  ...  Acknowledgements We gratefully acknowledge the anonymous reviewers for their feedback.  ...  Figure 1 : 1 SIGMETRICS '16 June 14-18, 2016, Antibes Juan-Les-Pins, France c 2016 Copyright held by the owner/author(s). ACM ISBN 978-1-4503-4266-7/16/06.  ... 
doi:10.1145/2896377.2901491 dblp:conf/sigmetrics/CaoNMBG16 fatcat:47mhz6eurfhxlb7pxccch57tci

The Power of d Choices for Redundancy

Kristen Gardner, Samuel Zbarsky, Mor Harchol-Balter, Alan Scheller-Wolf
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
We propose a theoretical model of redundancy, the Redundancy-d system, in which each job sends redundant copies to d servers chosen uniformly at random.  ...  As soon as the first copy completes service, the job is considered complete, and all remaining copies are deleted.  ...  SIGMETRICS '16 June 14-18, 2016, Antibes Juan-Les-Pins, France c 2016 Copyright held by the owner/author(s). ACM ISBN 978-1-4503-4266-7/16/06.  ... 
doi:10.1145/2896377.2901497 dblp:conf/sigmetrics/GardnerZHS16 fatcat:datn3lysn5finghoubtonsfrpa

QoE Analysis of a Large-Scale Live Video Streaming Event

Adnan Ahmed, Zubair Shafiq, Amir Khakpour
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
We analyze Quality-of-Experience (QoE) for the event and note that a significant number of users suffer QoE impairments.  ...  Streaming video has received a lot of attention from industry and academia. In this work, we study the characteristics and challenges associated with large-scale live video delivery.  ...  Acknowledgement This material is based in part upon work supported by the National Science Foundation under Grant Number CNS-1464110.  ... 
doi:10.1145/2896377.2901504 dblp:conf/sigmetrics/AhmedSK16 fatcat:mz2sdkoarbbrbbqfav57nvgsvu

An Analysis of Load Imbalance in Scale-out Data Serving

Stanko Novakovic, Alexandros Daglis, Edouard Bugnion, Babak Falsafi, Boris Grot
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
and replication for the purpose of load balancing.  ...  This work shows that the trend towards extreme scale-out will further exacerbate the skew-induced load imbalance, and hence the overhead of migration and replication.  ...  This work has been partially funded by the Workloads and Server Architectures for Green Datacenters project of the Swiss National Science Foundation, the Nano-Tera YINS project, and the Scale-Out NUMA  ... 
doi:10.1145/2896377.2901501 dblp:conf/sigmetrics/NovakovicDBFG16 fatcat:dvoewdb6kve5jmo6hll2yej25i

Towards Multi-Resource Fair Allocation with Placement Constraints

Wei Wang, Baochun Li, Ben Liang, Jun Li
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
It remains unclear how multi-resource fair sharing is defined and achieved in the presence of placement constraints.  ...  However, an increasing number of datacenter jobs specify placement constraints and can only run on a particular class of machines meeting specific hardware/software requirements (e.g., GPUs or a particular  ...  Figure 1 : 1 An example of a TSF allocation. '16 June 14-18, 2016, Antibes Juan-Les-Pins, France c 2016 Copyright held by the owner/author(s).  ... 
doi:10.1145/2896377.2901493 dblp:conf/sigmetrics/WangLLL16 fatcat:n3kboaagbnea5d24pl34atlfte

Joint Data Purchasing and Data Placement in a Geo-Distributed Data Market

Xiaoqi Ren, Palma London, Juba Ziani, Adam Wierman
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
However, we give a provably optimal algorithm for the case of a data market made up of a single data center, and then generalize the structure from the single data center setting and propose Datum, a near-optimal  ...  We show that the joint problem of data purchasing and data placement within a cloud data market is NP-hard in general.  ...  It highlights that Datum provides near-optimal performance (within 1.6% of optimal) in realistic settings via a polynomial-time algorithm that is provably optimal in the case of a data cloud running on  ... 
doi:10.1145/2896377.2901486 dblp:conf/sigmetrics/RenLZW16 fatcat:vobxqvf6cnh4xfigsmmaotu7iy

Safe Randomized Load-Balanced Switching by Diffusing Extra Loads

Sen Yang, Bill Lin, Jun Xu
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
Unfortunately, this method of load-balancing can lead to instability, depending on the mix of flow sizes and durations in the group of flows that gets randomly assigned to route through the same intermediate  ...  Randomized load-balancing of application flows by means of hashing on the packet header is a well-known simple solution to this packet reordering problem in which all packets belonging to the same application  ...  SIGMETRICS '16 June 14-18, 2016, Antibes Juan-Les-Pins, France tectures that can scale well in both size and speed, provide throughput guarantees, achieve low latency, and maintain packet ordering.  ... 
doi:10.1145/2896377.2901480 dblp:conf/sigmetrics/YangLX16 fatcat:3geib4lsxrachdz3nqwnzkwuge

Unsupervised Clustering Under Temporal Feature Volatility in Network Stack Fingerprinting

Zain Shamsi, Dmitri Loguinov
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
To address this issue, we propose algorithms and models to automatically generate signatures in the presence of noise, with a focus on stack fingerprinting, which is a research area that aims to discover  ...  Armed with this framework, we construct a database with 420 network stacks, label the signatures, develop a robust classifier for this database, and fingerprint 66M visible webservers on the Internet.  ...  , Antibes Juan-Les-Pins, France c ⃝ 2016 ACM. ISBN 978-1-4503-4266-7/16/06. . . $15.00 DOI: http://dx.doi.org/10.1145/2896377.2901449 Table 1 : 1 Database dimensions.  ... 
doi:10.1145/2896377.2901449 dblp:conf/sigmetrics/ShamsiL16 fatcat:r7wzxcyw3jgmhdwfgc7qsukyg4

Reducing Latency Through Page-aware Management of Web Objects by Content Delivery Networks

Shankaranarayanan Puzhavakath Narayanan, Yun Seong Nam, Ashiwan Sivakumar, Balakrishnan Chandrasekaran, Bruce Maggs, Sanjay Rao
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
The key idea is that the objects in a web page that have the largest impact on page latency should be served out of the closest or fastest caches in the hierarchy.  ...  Using anonymized server logs provided by the CDN, we show the feasibility of reducing capacity and staleness misses of critical objects by 60% with minimal increase in overall miss rates, and bandwidth  ...  June 14-18, 2016, Antibes Juan-Les-Pins, France c 2016 ACM.  ... 
doi:10.1145/2896377.2901472 dblp:conf/sigmetrics/NarayananNSCMR16 fatcat:kgokxtuxtvhwlj7bjzoz4add2m

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Daniel Cullina, Negar Kiyavash
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
Pedarsani and Grossglauser provided an achievability result of this type. Their result establishes the scaling dependence of the threshold on the number of vertices.  ...  For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs.  ...  ACKNOWLEDGEMENTS This work was in part supported by supported by MURI grant ARMY W911NF-15-1-0479 and NSF grant CCF 10-54937 -CAREER.  ... 
doi:10.1145/2896377.2901460 dblp:conf/sigmetrics/CullinaK16 fatcat:a6kxafgci5hwlgnbug4ob33brq

Social Clicks

Maksym Gabielkov, Arthi Ramachandran, Augustin Chaintreau, Arnaud Legout
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
While this has led to multiple assumptions on the diffusion of information, each assumption was designed or validated while ignoring actual clicks.  ...  We present a large scale, unbiased study of social clicksthat is also the first data of its kind-gathering a month of web visits to online resources that are located in 5 leading news domains and that  ...  , Antibes Juan-Les-Pins, France ACM ISBN 978-1-4503-4266-7/16/06. . . $15.00 DOI: http://dx.doi.org/10.1145/2896377.2901462 bbc.in huff.to cnn.it nyti.ms fxn.ws # URLs 13.14k 12.38k 6.39k 5.60k  ... 
doi:10.1145/2896377.2901462 dblp:conf/sigmetrics/GabielkovRCL16 fatcat:pyku3c65mrhlhkmg4supbpgbme

Exploiting Core Criticality for Enhanced GPU Performance

Adwait Jog, Onur Kayiran, Ashutosh Pattnaik, Mahmut T. Kandemir, Onur Mutlu, Ravishankar Iyer, Chita R. Das
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
The key idea is to use the fraction of critical requests in the memory request buffer to switch between scheduling policies optimized for criticality and locality.  ...  Based on this observation, this paper introduces a new memory scheduler, called (C)ritica(L)ity (A)ware (M)emory (S)cheduler (CLAMS), which takes into account the latency-tolerance of the cores that generate  ...  Adwait Jog also acknowledges the start-up grant from College of William and Mary.  ... 
doi:10.1145/2896377.2901468 dblp:conf/sigmetrics/JogKPKMID16 fatcat:4v7mltwobfaibcwrva7mbefvva

Generalized Threshold-Based Epidemics in Random Graphs

Michele Garetto, Emilio Leonardi, Giovanni Luca Torrisi
2016 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16  
Such process, originally studied on regular structures, has been recently investigated also in the context of random graphs, where it can serve as a simple model for a wide variety of cascades, such as  ...  We validate our results running simulation on both synthetic and real graphs.  ...  , France. c 2016 ACM.  ... 
doi:10.1145/2896377.2901455 dblp:conf/sigmetrics/GarettoLT16 fatcat:zfjoii2syjb2fbg5xjtvfq333m