A Case for Performance-Centric Network Allocation
|
|
- Archibald Sutton
- 5 years ago
- Views:
Transcription
1 A Case for Performance-Centric Network Allocation Gautam Kumar, Mosharaf Chowdhury, Sylvia Ratnasamy, Ion Stoica UC Berkeley
2 Datacenter Applications
3 3 Data Parallelism Applications execute in several computation stages and require transfer of data between these stages (communication). J J * R Computation in a stage is split across multiple nodes. R M R M M R Network has an important role to play, 33% of the running time in Facebook traces. (Orchestra, SIGCOMM 2011) M R Map Reduce M J Join (*RoPE, NSDI 2012)
4 4 Data Parallelism Users, often, do not know what network support they require. Final execution graph created by the framework. Frameworks know more, provide certain communication primitives. e.g., Shuffle, Broadcast etc.
5 5 Scope Private clusters running data parallel applications. Little concern for adversarial behavior. Application level inefficiencies dealt extrinsically.
6 Current Proposals
7 7 Explicit Accounting Virtual cluster based network reservations. (Oktopus, SIGCOMM 2011) Time-varying network reservations. (SIGCOMM 2012) DRAWBACK: Exact network requirements often not known; non work-conserving.
8 8 Fairness-Centric Flow level fairness or Per-Flow. (TCP) Fairness with respect to the sources. (Seawall, NSDI 2012) Proportionality in terms of total number of VMs. (FairCloud, SIGCOMM 2012) DRAWBACK: Gives little guidance to developers about the performance they can expect while scaling their applications.
9 9 In this work... A new perspective to share the network amongst data-parallel applications performance-centric allocations: enabling users to reason about the performance of their applications when they scale them up. enabling applications to effectively parallelize to preserve the intuitive mapping between scale-up and speed-up. Contrast / relate performance-centric proposals with fairness-centric proposals.
10 Performance-Centric Allocations
11 11 Types of Transfers* Shuffle /2 Broadcast (*Orchestra, SIGCOMM 2011)
12 12 Scaling up the application Shuffle Broadcast X Scale UP 2X Scale UP /2 /2 Total Data = 2 Total Data = 4
13 13 Performance-Centric Allocations Understand the support that the application needs from the network to effectively parallelize. At a sweet spot framework knows application s network requirements.
14 14 Shuffle-only clusters A m 2 2 A r t Am t As t Ar B m /2 B r B m /2 B r t Bm t Bs t Br
15 15 Shuffle-only Clusters Per-Flow Proportional A m 2 2 α A r A m 2 2 α A r t Am t As = 2/α t Ar t Am t As = 2/α t Ar B m /2 α B r B m /2 α/2 B r B m /2 t Am /2 t Bs = /2α = t As /4 t Ar /2 t B < t A /2 B r B m /2 t Am /2 t Bs = /α = t As /2 t Ar /2 t B = t A /2 B r
16 16 Broadcast-only Clusters A m 2 2 A r t Am t As t Ar B m B r B m B r t Bm t Bs t Br
17 17 Broadcast-only Clusters Proportional Per-Flow A m 2 2 α A r A m 2 2 α A r t Am t As = 2/α t Ar t Am t As = 2/α t Ar B m α/2 B r B m α B r B m t Am /2 t Bs = 2/α = t As t Ar /2 t B > t A /2 B r B m t Am /2 t Bs = /α = t As /2 t Ar /2 t B = t A /2 B r
18 18 Recap Speed Up TCP in shuffle gives more than requisite speed-up and thus hurts performance of small jobs. Proportionality achieves the right balance. Degree of Parallelism TCP (Shuffle) Prop. (Shuffle) TCP. (Broadcast) Prop. (Broadcast) Proportionality in broadcast limits parallelism. TCP achieves the right balance.
19 19 Complexity of a transfer x N -transfer if x is the factor by which the amount of data transferred increases when a scale up of N is done, x [1, N]. Shuffle is a 1 N -transfer and broadcast is an N N - transfer. Performance-centric allocations encompass x.
20 Heterogeneous Frameworks and Congested Resources
21 21 A m B m 2G 2G 2G 2G 500Mbps 2Gb to send 500Mbps 2Gb to send Both finish in 4s A r B r Share given based on the complexity of the transfer. 2X Scale UP 0.5G A m 1G A r ~333Mbps 2Gb to send A m 1G 0.5G A r 1G B m 1G B r The job completion time of both jobs degrades uniformly in the event of contention. ~666Mbps 4Gb to send B m 1G B 1G r Both finish in 6s
22 22 Network Parallelism Isolation between the speed-up due to the scale-up for the application and the performance degradation due to finite resources. y (α) X y N y : new running time after a scale-up of N y : old running time α : degradation due to limited resources
23 Summary
24 24 Understand performance-centric allocations and their relationship with fairness-centric proposals. Proportionality is the performance-centric approach for shuffle-only clusters. Breaks down for broadcasts, per-flow is the performancecentric approach for broadcast-only clusters. An attempt to a performance-centric proposal for heterogeneous transfers. Understand what happens when resources get congested.
25 Future Work
26 26 A more rigorous formulation. Some questions to be answered: different N 1 and N 2 on both sides of the stage etc. Analytical and experimental evaluation of the policies. Whether redistribution of completion time or total savings.
27 Thank you
An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters Mehrnoosh Shafiee, and Javad Ghaderi Electrical Engineering Department Columbia University arxiv:704.0857v
More informationScheduling Coflows in Datacenter Networks: Improved Bound for Total Weighted Completion Time
1 1 2 Scheduling Coflows in Datacenter Networs: Improved Bound for Total Weighted Completion Time Mehrnoosh Shafiee and Javad Ghaderi Abstract Coflow is a recently proposed networing abstraction to capture
More informationBeyond the Stars: Revisiting Virtual Cluster Embeddings
Beyond the Stars: Revisiting Virtual Cluster Embeddings Matthias Rost Technische Universität Berlin August 8, 207, Aalborg University Joint work with Carlo Fuerst, Stefan Schmid Published in ACM SIGCOMM
More informationHow to Optimally Allocate Resources for Coded Distributed Computing?
1 How to Optimally Allocate Resources for Coded Distributed Computing? Qian Yu, Songze Li, Mohammad Ali Maddah-Ali, and A. Salman Avestimehr Department of Electrical Engineering, University of Southern
More informationAn Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
IEEE/ACM TRANSACTIONS ON NETWORKING An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters Mehrnoosh Shafiee, Student Member, IEEE, and Javad Ghaderi, Member, IEEE
More informationCongestion Control In The Internet Part 1: Theory. JY Le Boudec 2018
Congestion Control In The Internet Part 1: Theory JY Le Boudec 2018 1 Contents 1. What is the problem; congestion collapse 2. Efficiency versus Fairness 3. Definitions of fairness 4. Additive Increase
More informationHow to deal with uncertainties and dynamicity?
How to deal with uncertainties and dynamicity? http://graal.ens-lyon.fr/ lmarchal/scheduling/ 19 novembre 2012 1/ 37 Outline 1 Sensitivity and Robustness 2 Analyzing the sensitivity : the case of Backfilling
More informationOptimizing Coflow Completion Times with Utility Max-Min Fairness
IEEE INFOCOM 06 - The 5th Annual IEEE International Conference on Computer Communications Optimizing Coflow Completion Times with Utility Ma-Min Fairness Li Chen Wei Cui Baochun Li Bo Li University of
More informationMin Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min
JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science
More informationFair Division on the Hubble Space Telescope (repo: bkerr) Brandon Kerr and Jordana Kerr. Project Description
Fair Division on the Hubble Space Telescope (repo: bkerr) Brandon Kerr and Jordana Kerr Project Description We mapped the intricacies of scheduling jobs for the Hubble Space Telescope to fair division
More informationAteneo de Manila, Philippines
Ideal Flow Based on Random Walk on Directed Graph Ateneo de Manila, Philippines Background Problem: how the traffic flow in a network should ideally be distributed? Current technique: use Wardrop s Principle:
More informationSMS Support in Tally.CRM Table of Contents
SMS Support in Tally.CRM Table of Contents 1. Introduction / Objective... 2 2. Steps to enable/configure Preferred Mobile Number... 2 i. For you as Admin or Owner of the Business... 2 ii. For your Support
More informationA Different Kind of Flow Analysis. David M Nicol University of Illinois at Urbana-Champaign
A Different Kind of Flow Analysis David M Nicol University of Illinois at Urbana-Champaign 2 What Am I Doing Here??? Invite for ICASE Reunion Did research on Peformance Analysis Supporting Supercomputing
More informationEnhance & Explore: an Adaptive Algorithm to Maximize the Utility of Wireless Networks
Enhance & Explore: an Adaptive Algorithm to Maximize the Utility of Wireless Networks Julien Herzen joint work with Adel Aziz, Ruben Merz, Seva Shneer and Patrick Thiran September 5th, 2011 1/20 Context
More informationOn the Capacity of Distributed Antenna Systems Lin Dai
On the apacity of Distributed Antenna Systems Lin Dai ity University of Hong Kong JWIT 03 ellular Networs () Base Station (BS) Growing demand for high data rate Multiple antennas at the BS side JWIT 03
More informationCS276 Homework 1: ns-2
CS276 Homework 1: ns-2 Erik Peterson October 28, 2006 1 Part 1 - Fairness between TCP variants 1.1 Method After learning ns-2, I wrote a script (Listing 3) that runs a simulation of one or two tcp flows
More informationFundamental Tradeoff between Computation and Communication in Distributed Computing
Fundamental Tradeoff between Computation and Communication in Distributed Computing Songze Li, Mohammad Ali Maddah-Ali, and A. Salman Avestimehr Department of Electrical Engineering, University of Southern
More informationTCP over Cognitive Radio Channels
1/43 TCP over Cognitive Radio Channels Sudheer Poojary Department of ECE, Indian Institute of Science, Bangalore IEEE-IISc I-YES seminar 19 May 2016 2/43 Acknowledgments The work presented here was done
More informationReview Of Topics. Review: Induction
Review Of Topics Asymptotic notation Solving recurrences Sorting algorithms Insertion sort Merge sort Heap sort Quick sort Counting sort Radix sort Medians/order statistics Randomized algorithm Worst-case
More informationPIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control
PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control Saurabh Jain Joint work with Dr. Dmitri Loguinov June 21, 2007 1 Agenda Introduction Analysis of RCP QI-RCP PIQI-RCP Comparison Wrap
More informationScheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling
Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationThese are special traffic patterns that create more stress on a switch
Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually
More informationIMPROVING BANDWIDTH ALLOCATION IN CLOUD COMPUTING ENVIRONMENTS VIA "BANDWIDTH AS A SERVICE" PARTITIONING SCHEME. Anthony Amaro Jr
IMPROVING BANDWIDTH ALLOCATION IN CLOUD COMPUTING ENVIRONMENTS VIA "BANDWIDTH AS A SERVICE" PARTITIONING SCHEME by Anthony Amaro Jr A thesis submitted to the Graduate College of Texas State University
More informationTHE STATE OF CONTEMPORARY COMPUTING SUBSTRATES FOR OPTIMIZATION METHODS. Benjamin Recht UC Berkeley
THE STATE OF CONTEMPORARY COMPUTING SUBSTRATES FOR OPTIMIZATION METHODS Benjamin Recht UC Berkeley MY QUIXOTIC QUEST FOR SUPERLINEAR ALGORITHMS Benjamin Recht UC Berkeley Collaborators Slides extracted
More informationIntroduction to Embedded Systems
Introduction to Embedded Systems Edward A. Lee & Sanjit A. Seshia UC Berkeley EECS 124 Spring 2008 Copyright 2008, Edward A. Lee & Sanjit A. Seshia, All rights reserved Lecture 7: Modeling Modal Behavior,
More informationScheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling
Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out
More informationAn Optimal Index Policy for the Multi-Armed Bandit Problem with Re-Initializing Bandits
An Optimal Index Policy for the Multi-Armed Bandit Problem with Re-Initializing Bandits Peter Jacko YEQT III November 20, 2009 Basque Center for Applied Mathematics (BCAM), Bilbao, Spain Example: Congestion
More informationFairness and Optimal Stochastic Control for Heterogeneous Networks
λ 91 λ 93 Fairness and Optimal Stochastic Control for Heterogeneous Networks sensor network wired network wireless 9 8 7 6 5 λ 48 λ 42 4 3 0 1 2 λ n R n U n Michael J. Neely (USC) Eytan Modiano (MIT) Chih-Ping
More information6.852: Distributed Algorithms Fall, Class 10
6.852: Distributed Algorithms Fall, 2009 Class 10 Today s plan Simulating synchronous algorithms in asynchronous networks Synchronizers Lower bound for global synchronization Reading: Chapter 16 Next:
More informationOptimal Insurance of Search Risk
Optimal Insurance of Search Risk Mikhail Golosov Yale University and NBER Pricila Maziero University of Pennsylvania Guido Menzio University of Pennsylvania and NBER November 2011 Introduction Search and
More informationRevenue Maximization in a Cloud Federation
Revenue Maximization in a Cloud Federation Makhlouf Hadji and Djamal Zeghlache September 14th, 2015 IRT SystemX/ Telecom SudParis Makhlouf Hadji Outline of the presentation 01 Introduction 02 03 04 05
More informationChe-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University
Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.
More informationUsing R for Iterative and Incremental Processing
Using R for Iterative and Incremental Processing Shivaram Venkataraman, Indrajit Roy, Alvin AuYoung, Robert Schreiber UC Berkeley and HP Labs UC BERKELEY Big Data, Complex Algorithms PageRank (Dominant
More informationVariance Reduction and Ensemble Methods
Variance Reduction and Ensemble Methods Nicholas Ruozzi University of Texas at Dallas Based on the slides of Vibhav Gogate and David Sontag Last Time PAC learning Bias/variance tradeoff small hypothesis
More informationCyclops Tensor Framework
Cyclops Tensor Framework Edgar Solomonik Department of EECS, Computer Science Division, UC Berkeley March 17, 2014 1 / 29 Edgar Solomonik Cyclops Tensor Framework 1/ 29 Definition of a tensor A rank r
More informationMegaMIMO: Scaling Wireless Throughput with the Number of Users. Hariharan Rahul, Swarun Kumar and Dina Katabi
MegaMIMO: Scaling Wireless Throughput with the Number of Users Hariharan Rahul, Swarun Kumar and Dina Katabi There is a Looming Wireless Capacity Crunch Given the trends in the growth of wireless demand,
More informationDynamic Proportional Sharing: A Game-Theoretic Approach
Dynamic Proportional Sharing: A Game-Theoretic Approach ABSTRACT Ensuring user entitlements in computing systems with scarce and commonly preferred resources requires time sharing. We allocate resources
More informationNotes on BAN Logic CSG 399. March 7, 2006
Notes on BAN Logic CSG 399 March 7, 2006 The wide-mouthed frog protocol, in a slightly different form, with only the first two messages, and time stamps: A S : A, {T a, B, K ab } Kas S B : {T s, A, K ab
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationSocial and Technological Network Analysis: Spatial Networks, Mobility and Applications
Social and Technological Network Analysis: Spatial Networks, Mobility and Applications Anastasios Noulas Computer Laboratory, University of Cambridge February 2015 Today s Outline 1. Introduction to spatial
More informationScheduling for Efficiency and Fairness in Systems with Redundancy
Scheduling for Efficiency and Fairness in Systems with Redundancy Kristen Gardner 1, Mor Harchol-Balter 1, Esa Hyytiä, Rhonda Righter 3 April 1, 17 CMU-CS-17-19 School of Computer Science Carnegie Mellon
More informationTime Synchronization
Massachusetts Institute of Technology Lecture 7 6.895: Advanced Distributed Algorithms March 6, 2006 Professor Nancy Lynch Time Synchronization Readings: Fan, Lynch. Gradient clock synchronization Attiya,
More informationCPU Scheduling Exercises
CPU Scheduling Exercises NOTE: All time in these exercises are in msec. Processes P 1, P 2, P 3 arrive at the same time, but enter the job queue in the order presented in the table. Time quantum = 3 msec
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Markov Models Instructors: Dan Klein and Pieter Abbeel --- University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to
More informationTheoretical Analysis of Performances of TCP/IP Congestion Control Algorithm with Different Distances
Theoretical Analysis of Performances of TCP/IP Congestion Control Algorithm with Different Distances Tsuyoshi Ito and Mary Inaba Department of Computer Science, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,
More informationCCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays
CCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays Konstantin Avrachenkov INRIA Sophia Antipolis France Email: k.avrachenkov@sophia.inria.fr Peter Jacko BCAM Basque Center for Applied
More informationOptimal Insurance of Search Risk
Optimal Insurance of Search Risk Mikhail Golosov Yale University and NBER Pricila Maziero University of Pennsylvania Guido Menzio University of Pennsylvania and NBER May 27, 2011 Introduction Search and
More informationMidterm Exam 1 (Solutions)
EECS 6 Probability and Random Processes University of California, Berkeley: Spring 07 Kannan Ramchandran February 3, 07 Midterm Exam (Solutions) Last name First name SID Name of student on your left: Name
More informationtransportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study explored
ABSTRACT: Demand supply system are the three core clusters of transportation research in policy making for addressing mobility problems, infrastructure and functionality issues in urban areas. This study
More informationCooperation Speeds Surfing: Use Co-Bandit!
Cooperation Speeds Surfing: Use Co-Bandit! Anuja Meetoo Appavoo, Seth Gilbert, and Kian-Lee Tan Department of Computer Science, National University of Singapore {anuja, seth.gilbert, tankl}@comp.nus.edu.sg
More informationUtility, Fairness and Rate Allocation
Utility, Fairness and Rate Allocation Laila Daniel and Krishnan Narayanan 11th March 2013 Outline of the talk A rate allocation example Fairness criteria and their formulation as utilities Convex optimization
More informationReducing Noisy-Neighbor Impact with a Fuzzy Affinity- Aware Scheduler
Reducing Noisy-Neighbor Impact with a Fuzzy Affinity- Aware Scheduler L U I S T O M Á S A N D J O H A N T O R D S S O N D E PA R T M E N T O F C O M P U T I N G S C I E N C E U M E Å U N I V E R S I T
More informationCS 188: Artificial Intelligence Fall Recap: Inference Example
CS 188: Artificial Intelligence Fall 2007 Lecture 19: Decision Diagrams 11/01/2007 Dan Klein UC Berkeley Recap: Inference Example Find P( F=bad) Restrict all factors P() P(F=bad ) P() 0.7 0.3 eather 0.7
More informationYuval Ishai Technion
Winter School on, Israel 30/1/2011-1/2/2011 Yuval Ishai Technion 1 Several potential advantages Unconditional security Guaranteed output and fairness Universally composable security This talk: efficiency
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014.
EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014 Midterm Exam 1 Last name First name SID Rules. DO NOT open the exam until instructed
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 16: Bayes Nets IV Inference 3/28/2011 Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew Moore Announcements
More informationPlanning Softproviding Meat User Documentation
Great ideas are always simple Softproviding simply makes them happen. Planning Softproviding Meat User Documentation Version: 1.00 Date: 24 August 2017 Release: v5.50 Softproviding AG Riehenring 175 CH-4058
More informationInformation Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results
Information Theory Lecture 10 Network Information Theory (CT15); a focus on channel capacity results The (two-user) multiple access channel (15.3) The (two-user) broadcast channel (15.6) The relay channel
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationModule 16 : Line Integrals, Conservative fields Green's Theorem and applications. Lecture 48 : Green's Theorem [Section 48.
Module 16 : Line Integrals, Conservative fields Green's Theorem and applications Lecture 48 : Green's Theorem [Section 48.1] Objectives In this section you will learn the following : Green's theorem which
More informationCS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions
CS 598RM: Algorithmic Game Theory, Spring 2017 1. Answer the following. Practice Exam Solutions Agents 1 and 2 are bargaining over how to split a dollar. Each agent simultaneously demands share he would
More informationTheoretical Cryptography, Lecture 10
Theoretical Cryptography, Lecture 0 Instructor: Manuel Blum Scribe: Ryan Williams Feb 20, 2006 Introduction Today we will look at: The String Equality problem, revisited What does a random permutation
More informationCS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 11: Ironing and Approximate Mechanism Design in Single-Parameter Bayesian Settings
CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 11: Ironing and Approximate Mechanism Design in Single-Parameter Bayesian Settings Instructor: Shaddin Dughmi Outline 1 Recap 2 Non-regular
More informationLectures 1&2: Introduction to Secure Computation, Yao s and GMW Protocols
CS 294 Secure Computation January 19, 2016 Lectures 1&2: Introduction to Secure Computation, Yao s and GMW Protocols Instructor: Sanjam Garg Scribe: Pratyush Mishra 1 Introduction Secure multiparty computation
More informationEvent Operators: Formalization, Algorithms, and Implementation Using Interval- Based Semantics
Department of Computer Science and Engineering University of Texas at Arlington Arlington, TX 76019 Event Operators: Formalization, Algorithms, and Implementation Using Interval- Based Semantics Raman
More informationToday s Agenda: 1) Why Do We Need To Measure The Memory Component? 2) Machine Pool Memory / Best Practice Guidelines
Today s Agenda: 1) Why Do We Need To Measure The Memory Component? 2) Machine Pool Memory / Best Practice Guidelines 3) Techniques To Measure The Memory Component a) Understanding Your Current Environment
More informationUC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara
Operating Systems Christopher Kruegel Department of Computer Science http://www.cs.ucsb.edu/~chris/ Many processes to execute, but one CPU OS time-multiplexes the CPU by operating context switching Between
More informationPhotosynthesis Extended Study
Photosynthesis Extended Study H2.2.9 Syllabus -- Objectives Explain the role of ATP Explain the production of ATP from ADP Explain the role of NADP+ in trapping & transferring electrons & H ions. Explain
More informationFair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks
Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks Pierre Coucheney, Corinne Touati, Bruno Gaujal INRIA Alcatel-Lucent, LIG Infocom 2009 Pierre Coucheney (INRIA)
More informationSynchronous Reactive Systems
Synchronous Reactive Systems Stephen Edwards sedwards@synopsys.com Synopsys, Inc. Outline Synchronous Reactive Systems Heterogeneity and Ptolemy Semantics of the SR Domain Scheduling the SR Domain 2 Reactive
More informationEpistemic Protocols for Distributed Gossiping
CWI, Amsterdam Based on joint work with Wiebe van der Hoek and Davide Grossi Your slot is divided into 20 minutes for your talk and 5 minutes for possible discussions and for switching the speaker. Pope
More informationConstrained Private Mechanisms for Count Data
Constrained Private Mechanisms for Count Data Graham Cormode g.cormode@warwick.ac.uk Tejas Kulkarni (ATI/Warwick) Divesh Srivastava (AT&T) 1 Private Data Release Many problems require collection of aggregate
More informationOn Stabilizing Departures in Overlay Networks
On Stabilizing Departures in Overlay Networks Dianne Foreback 1, Andreas Koutsopoulos 2, Mikhail Nesterenko 1, Christian Scheideler 2, and Thim Strothmann 2 1 Kent State University 2 University of Paderborn
More informationRouting Games : From Altruism to Egoism
: From Altruism to Egoism Amar Prakash Azad INRIA Sophia Antipolis/LIA University of Avignon. Joint work with Eitan Altman, Rachid El-Azouzi October 9, 2009 1 / 36 Outline 1 2 3 4 5 6 7 2 / 36 General
More informationFLAME Flexible Lightweight Active Measurement Environment
FLAME Flexible Lightweight Active Measurement Environment Marcos L. Kirszenblatt Thiago B. Cardozo Artur Ziviani Antônio Tadeu A. Gomes National Laboratory for Scientific Computing (LNCC) {marcoslk,thiagoc,ziviani,atagomes}@lncc.br
More informationRAID+: Deterministic and Balanced Data Distribution for Large Disk Enclosures
RAID+: Deterministic and Balanced Data Distribution for Large Disk Enclosures Guangyan Zhang, Zican Huang, Xiaosong Ma SonglinYang, Zhufan Wang, Weimin Zheng Tsinghua University Qatar Computing Research
More informationOnline Appendix for Asymptotically Optimal Prior-Free Clock Auctions
Online Appendix for Asymptotically Optimal Prior-Free Clock Auctions Simon Loertscher and Leslie M. Marx January 16, 2019 Online Appendix: Alternative clock auctions In this appendix we describe two alternative
More informationTall-and-skinny! QRs and SVDs in MapReduce
A 1 A 2 A 3 Tall-and-skinny! QRs and SVDs in MapReduce Yangyang Hou " Purdue, CS Austin Benson " Stanford University Paul G. Constantine Col. School. Mines " Joe Nichols U. of Minn James Demmel " UC Berkeley
More informationParallel Particle Filter in Julia
Parallel Particle Filter in Julia Gustavo Goretkin December 12, 2011 1 / 27 First a disclaimer The project in a sentence. workings 2 / 27 First a disclaimer First a disclaimer The project in a sentence.
More informationDominating Set. Chapter 7
Chapter 7 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationCS425: Algorithms for Web Scale Data
CS425: Algorithms for Web Scale Data Most of the slides are from the Mining of Massive Datasets book. These slides have been modified for CS425. The original slides can be accessed at: www.mmds.org Challenges
More informationPhotosynthesis Extended Study
Photosynthesis Extended Study 2 stages of Photosynthesis (HL) Photosynthesis Light Stage Dark Stage Light Stage (HL) Takes place in the grana of the chloroplast Involves the very fast movement of electrons
More informationDefinition Existence CG vs Potential Games. Congestion Games. Algorithmic Game Theory
Algorithmic Game Theory Definitions and Preliminaries Existence of Pure Nash Equilibria vs. Potential Games (Rosenthal 1973) A congestion game is a tuple Γ = (N,R,(Σ i ) i N,(d r) r R) with N = {1,...,n},
More informationDatabases. DBMS Architecture: Hashing Techniques (RDBMS) and Inverted Indexes (IR)
Databases DBMS Architecture: Hashing Techniques (RDBMS) and Inverted Indexes (IR) References Hashing Techniques: Elmasri, 7th Ed. Chapter 16, section 8. Cormen, 3rd Ed. Chapter 11. Inverted indexing: Elmasri,
More informationPre-Processing of Dynamic Networks * Its Impact on Observed Communities and Other Analytics
Pre-Processing of Dynamic Networks * Its Impact on Observed Communities and Other nalytics Sofus. Macskassy Data Scientist, Facebook Unifying Theory and Experiment for Large-Scale Networks Simons Institute
More informationChapter 4. Greedy Algorithms. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 4 Greedy Algorithms Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 4.1 Interval Scheduling Interval Scheduling Interval scheduling. Job j starts at s j and
More informationChapter 4. A simple method for solving first order equations numerically
Chapter 4. A simple method for solving first order equations numerically We shall discuss a simple numerical method suggested in the introduction, where it was applied to the second order equation associated
More informationState-dependent and Energy-aware Control of Server Farm
State-dependent and Energy-aware Control of Server Farm Esa Hyytiä, Rhonda Righter and Samuli Aalto Aalto University, Finland UC Berkeley, USA First European Conference on Queueing Theory ECQT 2014 First
More informationTetrahedral Order of Water. Jonathan Lam Chun Cheong September 16, 2014 Science Center G26
Tetrahedral Order of Water Jonathan Lam Chun Cheong September 16, 2014 Science Center G26 Simple Quiz What happens to its volume when a piece of solid melts? A) Expands B) Contracts C) Remains unchange
More informationCPU Scheduling. Heechul Yun
CPU Scheduling Heechul Yun 1 Recap Four deadlock conditions: Mutual exclusion No preemption Hold and wait Circular wait Detection Avoidance Banker s algorithm 2 Recap: Banker s Algorithm 1. Initialize
More informationSimulation of Process Scheduling Algorithms
Simulation of Process Scheduling Algorithms Project Report Instructor: Dr. Raimund Ege Submitted by: Sonal Sood Pramod Barthwal Index 1. Introduction 2. Proposal 3. Background 3.1 What is a Process 4.
More informationAnnouncements. Project #1 grades were returned on Monday. Midterm #1. Project #2. Requests for re-grades due by Tuesday
Announcements Project #1 grades were returned on Monday Requests for re-grades due by Tuesday Midterm #1 Re-grade requests due by Monday Project #2 Due 10 AM Monday 1 Page State (hardware view) Page frame
More informationWITH the recent advancements of information technologies,
i Distributed Rumor Blocking with Multiple Positive Cascades Guangmo (Amo) Tong, Student Member, IEEE, Weili Wu, Member, IEEE, and Ding-Zhu Du, arxiv:1711.07412 [cs.si] 1 Dec 2017 Abstract Misinformation
More information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationLast class: Today: Threads. CPU Scheduling
1 Last class: Threads Today: CPU Scheduling 2 Resource Allocation In a multiprogramming system, we need to share resources among the running processes What are the types of OS resources? Question: Which
More informationPersonalized Social Recommendations Accurate or Private
Personalized Social Recommendations Accurate or Private Presented by: Lurye Jenny Paper by: Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma Outline Introduction Motivation The model General
More informationLecture 28: Public-key Cryptography. Public-key Cryptography
Lecture 28: Recall In private-key cryptography the secret-key sk is always established ahead of time The secrecy of the private-key cryptography relies on the fact that the adversary does not have access
More informationComplexity Theory. Jörg Kreiker. Summer term Chair for Theoretical Computer Science Prof. Esparza TU München
Complexity Theory Jörg Kreiker Chair for Theoretical Computer Science Prof. Esparza TU München Summer term 2010 2 Lecture 15 Public Coins and Graph (Non)Isomorphism 3 Intro Goal and Plan Goal understand
More informationOptimal Association of Stations and APs in an IEEE WLAN
Optimal Association of Stations and APs in an IEEE 802. WLAN Anurag Kumar and Vinod Kumar Abstract We propose a maximum utility based formulation for the problem of optimal association of wireless stations
More information