dsds data store driven application scheduling
play

DSDS: DATA STORE DRIVEN APPLICATION SCHEDULING Frezewd Lemma Tena, - PowerPoint PPT Presentation

DSDS: DATA STORE DRIVEN APPLICATION SCHEDULING Frezewd Lemma Tena, Christof Fetzer TU Dresden, Germany 1 MOTIVATION Context: reduce end user perceived latency move computing closer to end user how to build an edge cloud? Problem


  1. DSDS: DATA STORE DRIVEN APPLICATION SCHEDULING Frezewd Lemma Tena, Christof Fetzer TU Dresden, Germany 1

  2. MOTIVATION ➤ Context: reduce end user perceived latency ➤ move computing closer to end user ➤ how to build an edge cloud? ➤ Problem : cost of building and operating an edge cloud ➤ Objective: Reduce TCO of an edge cloud ➤ electricity costs ➤ cost of hosting and maintaining computing infrastructure 2

  3. SYSTEM MODEL ➤ Distributed edge cloud solar panel ➤ connected to heating system ➤ each micro-cloud provides compute & storage resources ➤ Cost of computing depends on ➤ need for heat / hot water (of building) ( C ) C ➤ local electricity cost: l o u d & H e micro-cloud consisting 
 a t ➤ local solar power of compute racks or containers 3

  4. OBSERVATION 1: WE NEED TO INCREASE UTILIZATION ➤ Infrastructure permits to ➤ reduce user perceived latency ➤ To reduce TCO, micro-clouds need to support more app domains: ➤ compute heavy jobs (protein folding, …) ➤ store backups ➤ store replicas of data ➤ data mining jobs (accessing one of the replicas) ➤ … 4

  5. OBSERVATION 2: CUT DOWN POWER COSTS ➤ To reduce the electricity costs, we can ➤ use lower-cost solar power ➤ sell the „waste heat“ of the computers ➤ computers hibernate to reduce power consumption ➤ Di ffi cult scheduling problem! 5

  6. PROBLEM ADDRESSED ➤ In which microcloud should we run a compute job? ➤ e.g., data mining jobs access ➤ Naive approach : ➤ at microcloud that has the lowest e ff ective electricity costs ➤ Problem : ➤ data too large to move to another microcloud before running compute job 6

  7. NODE ARCHITECTURE (COST-EFFECTIVE PLATFORM) node server for computing & storage Ethernet not energy-proportional … disk disk disk disk node server for computing & storage Ethernet Example : access to one 
 disk requires server to 
 … be in „active state“ 7 disk disk disk disk

  8. REPLICATION OF DATA typically, we keep R1 R2 R3 3 replicas lives in lives in lives in microcloud 1 microcloud2 microcloud3 For writing: all three disks/servers need to be active Write(W): 3 
 Read(R): 1 
 For reading: one disk/server needs to be active satisfies: R + W > N Problem : this might require to keep all servers & disks in „active state“ 8

  9. POWERCASS ARCHITECTURE DHT Approach: dormant and sleep peers can go into „hibernation mode“ 9

  10. REPLICATION ACROSS MICRO CLOUDS node node node microcloud 1 microcloud 2 microcloud 3 We can always read data from active node 10

  11. WRITING TO SWITCHED-OFF NODES write hinted handoff hinted handoff active active microcloud 1 microcloud 2 microcloud 3 Can always write: hinted-handoff to using active nodes 11

  12. APPLICATION ASSUMPTIONS ➤ We assume that we ➤ know what data will be accessed by an application ➤ know if a job is „short“ or „long“ running application App’s data Where should we execute App? 12

  13. NODES ➤ daily load pattern 13

  14. SCHEDULING IDEA: LOW LOAD all apps run here 14

  15. SCHEDULING IDEA: MEDIUM LOAD switch on dormant machines to access „dormant“ replica need est. of running time 15

  16. SCHEDULING IDEA: HIGH LOAD switch on sleepy machines in third micro cloud also run apps on sleepy nodes 16

  17. SCHEDULING IDEA: HIGH LOAD run microcloud that minimises cost 
 of this application 17

  18. NEXT STEPS: SWITCH ROLES OF NODES ➤ Problem : ➤ static classification in active / dormant / sleep not optimal ➤ Approach : ➤ switch „roles“ of nodes to reduce cost of computation ➤ Example : ➤ swap roles of sleepy and dormant nodes at di ff erent sites 18

  19. EXAMPLE cost > cost microcloud 1 microcloud 2 microcloud 3 19

  20. SWITCH ROLE OF NODES: ACTIVE VS DORMANT cost > cost A B microcloud 1 microcloud 2 microcloud 3 20

  21. PROBLEMS ➤ What if nodes A and B do not store identical content? ➤ we might not be able to simply change roles of A and B! ➤ How to address this? ➤ keep nodes identical (bad for durability) ➤ migrate data locally to di ff erent class of node ➤ …

  22. CURRENT WORK ➤ Address security concerns (due to limited physical security) ➤ Motivation : ➤ we need to keep the data encrypted ➤ data mining job needs encryption key - how to keep this secure? ➤ Approach : Docker-Compatible Secure Framework ➤ provide secure computation based on Intel SGX (SCONE, OSDI 2016, SGXBounds, EuroSys 2017) 22

  23. SUMMARY ➤ We are working on an edge cloud that combines ➤ energy-e ffi ciency, and ➤ low-latency (edge cloud) ➤ We want to use this edge cloud to ➤ store and process data ➤ Showed: smart scheduling can reduce the cost of computation ➤ Current work : ➤ further improve energy-e ffi ciency ➤ address security issues 23

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend