{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T07:50:35Z","timestamp":1765871435320,"version":"3.48.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071417"],"award-info":[{"award-number":["12071417"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of the Natural Science Foundation of Yunnan Province of China","award":["202501AS070076"],"award-info":[{"award-number":["202501AS070076"]}]},{"name":"Project of the Natural Science Foundation of Yunnan Province of China","award":["202501AS070170"],"award-info":[{"award-number":["202501AS070170"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s42514-025-00242-1","type":"journal-article","created":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T01:50:58Z","timestamp":1760838658000},"page":"652-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-resource any price share fair allocation with placement constraints and an external resource in cloud-edge collaboration systems"],"prefix":"10.1007","volume":"7","author":[{"given":"Bin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Guangqin","family":"Hu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,19]]},"reference":[{"key":"242_CR1","unstructured":"Alibaba cluster trace. Available online: https:\/\/github.com\/alibaba\/clusterdata\/tree\/master\/cluster-trace-gpu-v2020 (2020)"},{"issue":"4","key":"242_CR2","doi-asserted-by":"publisher","first-page":"2180","DOI":"10.1287\/moor.2021.0199","volume":"49","author":"M Babaioff","year":"2023","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair-share allocations for agents with arbitrary entitlements. Math. Oper. Res. 49(4), 2180\u20132211 (2023)","journal-title":"Math. Oper. Res."},{"key":"242_CR3","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"S Baruah","year":"1996","unstructured":"Baruah, S., Cohen, N., Plaxton, C., Varvel, D.: Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15, 600\u2013625 (1996)","journal-title":"Algorithmica"},{"key":"242_CR4","doi-asserted-by":"crossref","unstructured":"Friedman, E., Ghodsi, A., Psomas, C.A.: Strategyproof allocation of discrete jobs on multiple machines. In: Proceedings of the 15th ACM Conference on Economics and Computation, pp. 529\u2013546 (2014)","DOI":"10.1145\/2600057.2602889"},{"key":"242_CR5","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: Proceedings of 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI 11), pp. 323\u2013336 (2011)"},{"key":"242_CR6","doi-asserted-by":"crossref","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Choosy: max\u2013min fair sharing for datacenter jobs with constraints. In: Proceedings of the 8th ACM European Conference on Computer Systems, pp. 365\u2013378 (2013)","DOI":"10.1145\/2465351.2465387"},{"key":"242_CR7","unstructured":"Hindman, B., Konwinski, A., Zaharia, M., Ghodsi, A., Joseph, A., Katz, R., et al.: Mesos: a platform for fine-grained resource sharing in the data center. In: Proceedings of 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI 11) (2011)"},{"issue":"11","key":"242_CR8","first-page":"1","volume":"11","author":"YC Hu","year":"2015","unstructured":"Hu, Y.C., Patel, M., Sabella, D., Sprecher, N., Young, V.: Mobile edge computing: a key technology towards 5G. ETSI White Paper 11(11), 1\u201316 (2015)","journal-title":"ETSI White Paper"},{"key":"242_CR9","unstructured":"IBM, IBM ILOG CPLEX optimizer. Available online: https:\/\/www.ibm.com\/analytics\/cplex-optimizer (2023)"},{"key":"242_CR10","doi-asserted-by":"crossref","unstructured":"Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Quincy: fair scheduling for distributed computing clusters. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 261\u2013276 (2009)","DOI":"10.1145\/1629575.1629601"},{"key":"242_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1613\/jair.4405","volume":"51","author":"I Kash","year":"2014","unstructured":"Kash, I., Procaccia, A., Shah, N.: No agent left behind: dynamic fair division of multiple resources. Journal of Artificial Intelligence Research 51, 579\u2013603 (2014)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"242_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2025.110080","volume":"123","author":"AB Kathole","year":"2025","unstructured":"Kathole, A.B., Vhatkar, K., Lonare, S., Kshirsagar, A.P.: Optimization-based resource scheduling techniques in cloud computing environment: a review of scientific workflows and future directions. Computers and Electrical Engineering 123, 110080 (2025)","journal-title":"Computers and Electrical Engineering"},{"issue":"3","key":"242_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F Kelly","year":"1998","unstructured":"Kelly, F., Maulloo, A., Tan, D.: Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49(3), 237\u2013252 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"12","key":"242_CR14","doi-asserted-by":"publisher","first-page":"2686","DOI":"10.1109\/TPDS.2018.2841915","volume":"29","author":"J Khamse-Ashari","year":"2018","unstructured":"Khamse-Ashari, J., Lambadaris, I., Kesidis, G., Urgaonkar, B., Zhao, Y.: An efficient and fair multi-resource allocation mechanism for heterogeneous servers. IEEE Trans. Parallel Distrib. Syst. 29(12), 2686\u20132699 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"242_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.future.2024.04.055","volume":"159","author":"X Li","year":"2024","unstructured":"Li, X., Hu, G., Li, W., Zhang, X.: Fair multiresource allocation with access constraint in cloud-edge systems. Futur. Gener. Comput. Syst. 159, 395\u2013410 (2024)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"242_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.108510","volume":"105","author":"X Li","year":"2023","unstructured":"Li, X., Li, W., Zhang, X.: Multi-resource fair allocation with bandwidth requirement compression in the cloud-edge system. Comput. Electr. Eng. 105, 108510 (2023)","journal-title":"Comput. Electr. Eng."},{"key":"242_CR17","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s00607-022-01138-6","volume":"105","author":"X Li","year":"2023","unstructured":"Li, X., Li, W., Zhang, X.: Extended efficiency and soft-fairness multiresource allocation in a cloud computing system. Computing 105, 1217\u20131245 (2023)","journal-title":"Computing"},{"issue":"3","key":"242_CR18","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TNET.2022.3213426","volume":"31","author":"E Meskar","year":"2022","unstructured":"Meskar, E., Liang, B.: Fair multi-resource allocation in heterogeneous servers with an external resource type. IEEE\/ACM Trans. Netw. 31(3), 1244\u20131262 (2022)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"242_CR19","doi-asserted-by":"crossref","unstructured":"Meskar, E., Liang, B.: Fair multi-resource allocation with external resource for mobile edge computing. In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 184\u2013189 (2018)","DOI":"10.1109\/INFCOMW.2018.8406965"},{"key":"242_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N Megiddo","year":"1974","unstructured":"Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Mathematical Programming 7, 97\u2013107 (1974)","journal-title":"Mathematical Programming"},{"issue":"1","key":"242_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2739040","volume":"3","author":"D Parkes","year":"2015","unstructured":"Parkes, D., Procaccia, A., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans. Econ. Comput. 3(1), 1\u201322 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"1","key":"242_CR22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TNSM.2023.3304426","volume":"21","author":"T Panayiotou","year":"2023","unstructured":"Panayiotou, T., Ellinas, G.: Efficiency and fairness in resource allocation for optical networks. IEEE Trans. Netw. Serv. Manage. 21(1), 389\u2013401 (2023)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"issue":"1","key":"242_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TNSM.2017.2743066","volume":"15","author":"P Poullie","year":"2017","unstructured":"Poullie, P., Bocek, T., Stiller, B.: A survey of the state-of-the-art in fair multi-resource allocations for data centers. IEEE Trans. Netw. Serv. Manage. 15(1), 169\u2013183 (2017)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"issue":"7","key":"242_CR24","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TC.2020.3006007","volume":"70","author":"H Sadok","year":"2020","unstructured":"Sadok, H., Campista, M., Costa, L.: Stateful DRF: considering the past in a multi-resource allocation. IEEE Trans. Comput. 70(7), 1094\u20131105 (2020)","journal-title":"IEEE Trans. Comput."},{"key":"242_CR25","doi-asserted-by":"crossref","unstructured":"Sharma, B., Chudnovsky, V., Hellerstein, J.L., Rifaat, R., Das, C.R.: Modeling and synthesizing task placement constraints in Google compute clusters. In: Proceedings of the 2nd ACM Symposium on Cloud Computing, pp. 1\u201314 (2011)","DOI":"10.1145\/2038916.2038919"},{"issue":"5","key":"242_CR26","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s42514-024-00192-0","volume":"6","author":"D Sirisha","year":"2024","unstructured":"Sirisha, D., Prasad, S.S.: CPTF-a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systems. CCF Transactions on High Performance Computing 6(5), 472\u2013487 (2024)","journal-title":"CCF Transactions on High Performance Computing"},{"issue":"4","key":"242_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2788402.2788408","volume":"42","author":"J Tan","year":"2015","unstructured":"Tan, J., Zhang, L., Li, M., Wang, Y.: Multi-resource fair sharing for multiclass workflows. ACM SIGMETRICS Perform. Eval. Rev. 42(4), 31\u201337 (2015)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"5","key":"242_CR28","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TPDS.2017.2788880","volume":"29","author":"S Tang","year":"2018","unstructured":"Tang, S., Niu, Z., He, B., Lee, B.S., Yu, C.: Long-term multi-resource fairness for pay-as-you use computing systems. IEEE Trans. Parallel Distrib. Syst. 29(5), 1147\u20131160 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"242_CR29","doi-asserted-by":"crossref","unstructured":"Vavilapalli, V., Murthy, A., Douglas, C., Agarwal, S., Konar, M., Evans, R., et al.: Apache hadoop yarn: yet another resource negotiator. In: Proceedings of the 4th Annual Symposium on Cloud Computing (2013)","DOI":"10.1145\/2523616.2523633"},{"issue":"10","key":"242_CR30","doi-asserted-by":"publisher","first-page":"2822","DOI":"10.1109\/TPDS.2014.2362139","volume":"26","author":"W Wang","year":"2015","unstructured":"Wang, W., Liang, B., Li, B.: Multi-resource fair allocation in heterogeneous cloud computing systems. IEEE Trans. Parallel Distrib. Syst. 26(10), 2822\u20132835 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"242_CR31","doi-asserted-by":"crossref","unstructured":"Wang, W., Liang, B., Li, B., Li, J.: Multi-resource fair sharing for datacenter jobs with placement constraints. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1003\u20131014 (2016)","DOI":"10.1109\/SC.2016.85"},{"key":"242_CR32","doi-asserted-by":"crossref","unstructured":"Zarchy, D., Hay, D., Schapira, M.: Capturing resource tradeoffs in fair multi-resource allocation. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 1062\u20131070 (2015)","DOI":"10.1109\/INFOCOM.2015.7218479"},{"key":"242_CR33","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.future.2022.02.002","volume":"132","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Lou, W., Sun, H., Su, Q., Li, W.: Truthful auction mechanisms for resource allocation in the Internet of Vehicles with public blockchain networks. Futur. Gener. Comput. Syst. 132, 11\u201324 (2022)","journal-title":"Futur. Gener. Comput. Syst."}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00242-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-025-00242-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00242-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T07:47:20Z","timestamp":1765871240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-025-00242-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["242"],"URL":"https:\/\/doi.org\/10.1007\/s42514-025-00242-1","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"type":"print","value":"2524-4922"},{"type":"electronic","value":"2524-4930"}],"subject":[],"published":{"date-parts":[[2025,10,19]]},"assertion":[{"value":"5 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}