{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:04:37Z","timestamp":1753884277660,"version":"3.41.2"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:p> The conventional form of Amdahl\u2019s law states that speedup of calculations in a multiprocessor machine is limited by the definite constant value just due to the existence of some non-parallelizable part in any algorithm. This brief paper considers one more general reason, which prevents a growth of parallel performance: processes that implement distributed task cannot start simultaneously and hence every process adds some start-up time, also reducing by that the gain from a parallel processing. The simple formula, proposed here to extend Amdahl\u2019s law, leads to a less optimistic picture in comparison with classical results: for large amount of processor units the modified law does not approach to constant but vanishes. This is the result of competition between two factors: decreasing of calculation duty and increasing of start-up time when a number of parallel processes grows. The effect may be subdued by means of specific regularity in launching parallel processes. <\/jats:p>","DOI":"10.1142\/s0129626421500262","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T10:43:11Z","timestamp":1639392191000},"source":"Crossref","is-referenced-by-count":0,"title":["Accounting Start-up Time of Parallel Processes in Amdahl\u2019s Law"],"prefix":"10.1142","volume":"32","author":[{"given":"Evgeny","family":"Eremin","sequence":"first","affiliation":[{"name":"Department of Informatics and Economics, Perm State Humanitarian Pedagogical University, Sibirskaya 24, Perm, 614990, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,12,13]]},"reference":[{"first-page":"483","volume-title":"Proc. of AFIPS Spring Joint Computer Conference","author":"Amdahl G. M.","key":"S0129626421500262BIB001"},{"issue":"3","key":"S0129626421500262BIB002","first-page":"30","volume":"3","author":"Al-Babtain B. M.","year":"2013","journal-title":"Int. J. of New Comput. Archit. and Their Appl."},{"key":"S0129626421500262BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2008.209"},{"key":"S0129626421500262BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63371-5_10"},{"key":"S0129626421500262BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30474-6_47"},{"first-page":"241","volume-title":"25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)","author":"Eremin E. A.","key":"S0129626421500262BIB006"},{"key":"S0129626421500262BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6241"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626421500262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T01:58:09Z","timestamp":1658887089000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626421500262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":7,"journal-issue":{"issue":"01n02","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1142\/S0129626421500262"],"URL":"https:\/\/doi.org\/10.1142\/s0129626421500262","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2021,12,13]]},"article-number":"2150026"}}