| Document Date: 2014-12-31 23:51:31
Open Document File Size: 2,99 MBShare Result on Facebook
City Prague / / Company General Electric / Amazon / GPU / Oracle / Ericsson / Google / Facebook / Cisco / NetApp / Samsung / VMware / Yahoo! / Intel / Microsoft / CMMF / / Currency USD / / / IndustryTerm data-intensive computing frameworks / Online CMMF / offline algorithm / software requirements / heterogeneous hardware / online setting / max-min fair solutions / greedy online algorithm / online decisions / offline solutions / parallel processing frameworks / offline solution / network flow algorithm / online algorithm / computing / typical systems / Web Services / / Organization National Science Foundation / UC Berkeley / / Person Max-Min Fairness / Max-Min Fainess / Choosy / Ali Ghodsi Matei Zaharia Scott Shenker / Max-Min Fair Sharing / / Position Desirable Scheduler / restricted offline scheduler / periodic offline scheduler / simple online scheduler / hybrid scheduler / natural online scheduler for this problem / remarkably simple scheduler / offline scheduler / Mesos resource manager / Offline CMMF scheduler for divisible resources / Hadoop Fair Scheduler / scheduler / remarkably simple online scheduler / online scheduler / General / / Technology online algorithm / RAM / PDF / offline algorithm / 5.1 Algorithm / load balancing / DNS / network flow algorithm / simulation / greedy online algorithm / offline CMMF algorithm / parallel processing / /
SocialTag |
Choosy: Max-Min Fair Sharing for Datacenter Jobs with Constraints Ali Ghodsi Matei Zaharia Scott Shenker