{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T12:12:24Z","timestamp":1763122344045,"version":"3.45.0"},"reference-count":19,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Scheduling computing is a well-studied area focused on improving task execution by reducing processing time and increasing system efficiency. Divisible Load Theory (DLT) provides a structured analytical framework for distributing partitionable computational and communicational loads across processors, and its adaptability has allowed researchers to integrate it with other models and modern technologies. Building on this foundation, previous studies have shown that Amdahl-like laws can be effectively combined with DLT to produce more realistic performance models. This paper further develops analytical models that further extend such integration by incorporating Gustafson\u2019s Law and Juurlink\u2019s Law into DLT to capture broader scaling behaviors. It also extends the analysis to workload distribution in virtual multicore systems, providing a more structured basis for evaluating parallel performance. Methods include analytically computing speedup as a function of the number of cores and the parallelizable fraction under different scheduling strategies, with comparisons across workload conditions. Results show that combining DLT with speedup laws and virtual core design offers a deeper and more structured approach for analytical parallel system evaluation. While the analysis remains theoretical, the proposed framework establishes a mathematical foundation for future empirical validation, heterogeneous workload modeling, and sensitivity analysis.<\/jats:p>","DOI":"10.3390\/fi17110519","type":"journal-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T11:49:43Z","timestamp":1763120983000},"page":"519","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A DLT-Aware Performance Evaluation Framework for Virtual-Core Speedup Modeling"],"prefix":"10.3390","volume":"17","author":[{"given":"Zile","family":"Xiang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2382-1843","authenticated-orcid":false,"given":"Thomas G.","family":"Robertazzi","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1109\/12.9739","article-title":"Partitioning Techniques for Large Grained Parallelism","volume":"37","author":"Agrawal","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/3468.661152","article-title":"Distributed Computation for a Hypercube Network of Sensor-Driven Processors with Communication Delays Including Setup Time","volume":"28","author":"Piriyakumar","year":"1998","journal-title":"IEEE Trans. Syst. Man Cybern. Part A Syst. Hum."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1020915000287","article-title":"A Novel Optimal Load Distribution Algorithm for Divisible Loads","volume":"6","author":"Kim","year":"2003","journal-title":"Clust. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Robertazzi, T.G., and Shi, L. (2020). Networking and Computation: Technology, Modeling and Performance, Springer. [2nd ed.].","DOI":"10.1007\/978-3-030-36704-6"},{"key":"ref_5","first-page":"483","article-title":"Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities","volume":"Volume 30","author":"Amdahl","year":"1967","journal-title":"AFIPS Spring Joint Computer Conference"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/42411.42415","article-title":"Reevaluating Amdahl\u2019s Law","volume":"31","author":"Gustafson","year":"1988","journal-title":"Commun. ACM"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2234336.2234338","article-title":"Amdahl\u2019s Law for Predicting the Future of Multicores Considered Harmful","volume":"40","author":"Juurlink","year":"2012","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2150008","DOI":"10.1142\/S0129626421500080","article-title":"Integrating Amdahl-Like Laws and Divisible Load Theory","volume":"31","author":"Cao","year":"2021","journal-title":"Parallel Process. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/957717.957757","article-title":"Getting Gigascale Chips: Challenges and Opportunities in Continuing Moore\u2019s Law","volume":"1","author":"Borkar","year":"2003","journal-title":"ACM Queue"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Cassidy, A.S., and Andreou, A.G. (2009, January 18\u201320). Analytical Methods for the Design and Optimization of Chip-Multiprocessor Architectures. Proceedings of the 2009 43rd Annual Conference on Information Sciences and Systems, Baltimore, MD, USA.","DOI":"10.1109\/CISS.2009.5054769"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/MC.2008.209","article-title":"Amdahl\u2019s Law in the Multicore Era","volume":"41","author":"Hill","year":"2008","journal-title":"Computer"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MC.2017.164","article-title":"Retrospective on Amdahl\u2019s Law in the Multicore Era","volume":"50","author":"Hill","year":"2017","journal-title":"Computer"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Wang, X., Veeravalli, B., Wu, K., and Song, X. (2023). Extension of Divisible-Load Theory from Scheduling Fine-Grained to Coarse-Grained Divisible Workloads on Networked Computing Systems. Mathematics, 11.","DOI":"10.3390\/math11071752"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"109483","DOI":"10.1016\/j.comnet.2022.109483","article-title":"Optimum Scheduling in Fog Computing Using the Divisible Load Theory (DLT) with Linear and Nonlinear Loads","volume":"220","author":"Kazemi","year":"2023","journal-title":"Comput. Netw."},{"key":"ref_15","first-page":"104986","article-title":"Experimental Evaluation of a Multi-Installment Scheduling Strategy Based on the Divisible Load Paradigm for SAR Image Reconstruction on a Distributed Computing Infrastructure","volume":"184","author":"Chinnappan","year":"2024","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1007\/s13160-025-00732-3","article-title":"Optimization of Communication-Computation Overlapping in Parallel Multigrid Methods by Process\/Thread Allocation","volume":"42","author":"Nakajima","year":"2025","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Ali, T., Paul, G., Nicol, R., and Bhowmik, D. (2024, January 30). Scheduling Algorithms on Heterogeneous Architecture for Efficient Vision Systems. Proceedings of SPIE 13137, Applications of Digital Image Processing XLVII, San Diego, CA, USA.","DOI":"10.1117\/12.3031278"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3832","DOI":"10.1109\/TC.2025.3604463","article-title":"Reliability-Aware Optimization of Task Offloading for UAV-Assisted Edge Computing","volume":"74","author":"Hao","year":"2025","journal-title":"IEEE Trans. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Drozdowski, M. (2009). Scheduling for Parallel Processing, Springer.","DOI":"10.1007\/978-1-84882-310-5"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/11\/519\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T12:07:51Z","timestamp":1763122071000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/11\/519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":19,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["fi17110519"],"URL":"https:\/\/doi.org\/10.3390\/fi17110519","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,14]]}}}