{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T21:05:21Z","timestamp":1762808721829,"version":"3.41.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,6,30]],"date-time":"2018-06-30T00:00:00Z","timestamp":1530316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100009193","name":"Royal Society","doi-asserted-by":"publisher","award":["170293"],"award-info":[{"award-number":["170293"]}],"id":[{"id":"10.13039\/501100009193","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["25\/B\/ST6\/02553"],"award-info":[{"award-number":["25\/B\/ST6\/02553"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003033","name":"Ministerio de Ciencia e Innovacion","doi-asserted-by":"publisher","award":["88749-R"],"award-info":[{"award-number":["88749-R"]}],"id":[{"id":"10.13039\/501100003033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010789","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["ICE-2894"],"award-info":[{"award-number":["ICE-2894"]}],"id":[{"id":"10.13039\/501100010789","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011105","name":"European Commission","doi-asserted-by":"publisher","award":["IRIA 732667"],"award-info":[{"award-number":["IRIA 732667"]}],"id":[{"id":"10.13039\/100011105","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2018,6,30]]},"abstract":"<jats:p>\n            We study a dynamic resource-allocation problem that arises in various parallel computing scenarios, such as mobile cloud computing, cloud computing systems, Internet of Things systems, and others. Generically, we model the architecture as client mobile devices and static base stations. Each client \u201carrives\u201d to the system to upload data to base stations by radio transmissions and then \u201cleaves.\u201d The problem, called\n            <jats:italic>Station Assignment<\/jats:italic>\n            , is to assign clients to stations so that every client uploads their data under some restrictions, including a target subset of stations, a maximum delay between transmissions, a volume of data to upload, and a maximum bandwidth for each station. We study the solvability of Station Assignment under an adversary that controls the arrival and departure of clients, limited to maximum rate and burstiness of such arrivals. We show upper and lower bounds on the rate and burstiness for various client arrival schedules and protocol classes. To the best of our knowledge, this is the first time that Station Assignment is studied under adversarial arrivals and departures.\n          <\/jats:p>","DOI":"10.1145\/3291529","type":"journal-article","created":{"date-parts":[[2018,12,10]],"date-time":"2018-12-10T13:09:16Z","timestamp":1544447356000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees"],"prefix":"10.1145","volume":"5","author":[{"given":"Antonio Fern\u00e1ndez","family":"Anta","sequence":"first","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[{"name":"Pace University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201997)","author":"Alon Noga","year":"1997","unstructured":"Noga Alon , Yossi Azar , Gerhard J. Woeginger , and Tal Yadid . 1997 . Approximation schemes for scheduling . In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201997) . 493--500. Noga Alon, Yossi Azar, Gerhard J. Woeginger, and Tal Yadid. 1997. Approximation schemes for scheduling. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201997). 493--500."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10877-8_15"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363677"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089028"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167248"},{"volume-title":"Online Algorithms: The State of the Art (Lecture Notes in Computer Science), Amos Fiat and Gerhard J","author":"Azar Yossi","key":"e_1_2_1_6_1","unstructured":"Yossi Azar . 1996. On-line load balancing . In Online Algorithms: The State of the Art (Lecture Notes in Computer Science), Amos Fiat and Gerhard J . Woeginger (Eds.), Vol. 1442 . Springer , 178--195. Yossi Azar. 1996. On-line load balancing. In Online Algorithms: The State of the Art (Lecture Notes in Computer Science), Amos Fiat and Gerhard J. Woeginger (Eds.), Vol. 1442. Springer, 178--195."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90153-8"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.0799"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240447X"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273344"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_9"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9046-1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363659"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.028"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071384"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0019"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332487"},{"key":"e_1_2_1_19_1","first-page":"15","volume-title":"Handbook of Scheduling\u2014Algorithms, Models, and Performance Analysis., Joseph Y.-T","author":"Pruhs Kirk","unstructured":"Kirk Pruhs , Jir\u00ed Sgall , and Eric Torng . 2004. Online scheduling . In Handbook of Scheduling\u2014Algorithms, Models, and Performance Analysis., Joseph Y.-T . Leung (Ed.). Chapman and Hall\/CRC , Chapter 15, pp. 15 -- 11 to 15--41. Retrieved from http:\/\/www.crcnetbase.com\/isbn\/978-1-58488-397-5. Kirk Pruhs, Jir\u00ed Sgall, and Eric Torng. 2004. Online scheduling. In Handbook of Scheduling\u2014Algorithms, Models, and Performance Analysis., Joseph Y.-T. Leung (Ed.). Chapman and Hall\/CRC, Chapter 15, pp. 15--1 to 15--41. Retrieved from http:\/\/www.crcnetbase.com\/isbn\/978-1-58488-397-5."}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3291529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3291529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:33Z","timestamp":1750204473000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3291529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,30]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6,30]]}},"alternative-id":["10.1145\/3291529"],"URL":"https:\/\/doi.org\/10.1145\/3291529","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"type":"print","value":"2329-4949"},{"type":"electronic","value":"2329-4957"}],"subject":[],"published":{"date-parts":[[2018,6,30]]},"assertion":[{"value":"2016-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}