A scale, throughput yana iyakance ba ta adadin CPU ba sai dai ta contention, cache effects, da queues marasa iyaka — ƙara threads bayan wani lokaci yana sa abubuwa su yi jinkiri. Amdahl's da Universal Scalability Law duka suna hasashen wannan: farashin daidaitawa a ƙarshe yana rinjaye.
Contention
Lokacin da threads da yawa ke faɗa a kan lock ɗaya ko cache line, suna serialize kuma suna ciyar da lokaci a jira maimakon aiki. A ƙarƙashin Universal Scalability Law, contention tare da na iya sa throughput ya bayan adadin thread mai kyau.
