. . "La legge di Amdahl, che ha preso il nome del progettista di computer Gene Amdahl, viene usata per trovare il miglioramento atteso massimo in una architettura di calcolatori o in un sistema informatico quando vengono migliorate solo alcune parti del sistema. Nella sua forma pi\u00F9 generale pu\u00F2 essere espressa come: \"Il miglioramento delle prestazioni di un sistema che si pu\u00F2 ottenere ottimizzando una certa parte del sistema \u00E8 limitato dalla frazione di tempo in cui tale parte \u00E8 effettivamente utilizzata\" che pu\u00F2 essere ulteriormente semplificata nella pratica regola: \"Make the common case fast\" (rendi veloce il caso pi\u00F9 frequente) Ad esempio: se per percorrere un tragitto si impiegano 10 minuti in automobile pi\u00F9 40 minuti a piedi, non ha molto senso acquistare un'automobile pi\u00F9 veloce. La legge di Amdahl viene usata spesso nell'informatica parallela per predire l'aumento massimo teorico di velocit\u00E0 che si ottiene usando pi\u00F9 processori. Nell'ambito dei sistemi software pu\u00F2 essere interpretata in modo pi\u00F9 tecnico, ma il significato basilare \u00E8 che l'algoritmo decide l'aumento di velocit\u00E0, non il numero di processori. Prima o poi si raggiunger\u00E0 un punto in cui non si potr\u00E0 parallelizzare ulteriormente l'algoritmo. La legge di Amdahl \u00E8 una dimostrazione della legge dei rendimenti decrescenti: anche se si potesse aumentare la velocit\u00E0 di una parte di un computer di cento o pi\u00F9 volte, se tale parte influisce solamente sul 12% dell'elaborazione complessiva, al massimo l'accelerazione pu\u00F2 essere di un fattore . Supponiamo che un'elaborazione abbia due parti indipendenti, A e B. B impiega circa il 25% del tempo dell'intero calcolo. Lavorando molto intensamente, si riesce a rendere questa parte 5 volte pi\u00F9 veloce, ma ci\u00F2 riduce di poco il tempo dell'intero calcolo. D'altra parte, pu\u00F2 bastare meno lavoro per rendere la parte A veloce il doppio. Ci\u00F2 render\u00E0 il calcolo molto pi\u00F9 veloce che ottimizzando la parte B, anche se B \u00E8 stato accelerato di pi\u00F9 (5x contro 2x). Pi\u00F9 tecnicamente, la legge riguarda l'aumento di velocit\u00E0 ottenibile con un miglioramento a un'operazione che influisce per un P sul complesso e dove il miglioramento riduce il tempo di calcolo di un fattore S. (Per esempio, se il calcolo da migliorare influisce per il 30% del calcolo, P sar\u00E0 0.3; se il miglioramento raddoppia la velocit\u00E0 della porzione modificata, S sar\u00E0 2.). La legge di Amdahl afferma che l'aumento di velocit\u00E0 complessivo prodotto dal miglioramento sar\u00E0 . Per vedere come si arriva a questa formula, supponiamo che il tempo di esecuzione del vecchio calcolo sia 1, in una data unit\u00E0 di tempo. Il tempo di esecuzione del nuovo calcolo sar\u00E0 il tempo impiegato per la frazione non migliorata (che \u00E8 1 \u2212 P) pi\u00F9 il tempo impiegato dalla frazione migliorata. Il tempo impiegato dalla parte del calcolo migliorata \u00E8 il tempo di esecuzione della parte non ancora migliorata diviso per il fattore di accelerazione, ossia P/S. L'aumento finale di velocit\u00E0 \u00E8 calcolato dividendo il vecchio tempo di esecuzione per il nuovo tempo di esecuzione, ottenendo cos\u00EC la formula sopra indicata. Un altro esempio. Abbiamo un compito scomponibile nelle seguenti quattro parti: P1 = 0,11 ossia 11%, P2 = 0,18 ossia 18%, P3 = 0,23 ossia 23%, P4 = 0,48 ossia 48%, aventi come somma 100%. Poi, non miglioriamo P1, perci\u00F2 S1 = 1 ossia 100%, acceleriamo P2 di un fattore 5, perci\u00F2 S2 = 5 ossia 500%, acceleriamo P3 di un fattore 20, perci\u00F2 S3 = 20 ossia 2000%, e acceleriamo P4 di un fattore 1,6, perci\u00F2 S4 = 1,6 ossia 160%. Usando la formula , troviamo che il tempo di esecuzione \u00E8 ossia un po' meno della met\u00E0 del tempo di esecuzione originale che sappiamo essere 1. Perci\u00F2 l'accelerazione complessiva \u00E8 , ossia, usando la formula , poco pi\u00F9 del doppio della velocit\u00E0 originale. Si noti come le accelerazioni 20x e 5x non hanno un grande effetto sull'accelerazione e sul tempo di esecuzione complessivi, dato che oltre la met\u00E0 del compito viene accelerato solo di un fattore 1,6 o non viene accelerato affatto."@it . . "Ley de Amdahl"@es . . . "Hukum Amdahl (Inggris: Amdahl's law) adalah prinsip dasar dalam peningkatan kecepatan proses suatu komputer jika hanya sebagian dari peralatan perangkat keras ataupun perangkat lunak-nya yang diperbaharui/ditingkatkan kinerjanya. Nama Amdahl diambil dari nama seorang arsitektur komputer terkenal di perusahaan IBM, Gene Amdahl yang pertama kali mencetuskan bentuk formulasi ini. Formulasi atau hukum ini banyak dipakai dalam bidang komputasi paralel untuk meramalkan peningkatan kecepatan maksimum pemrosesan data (secara teoretis) jika jumlah prosesor di dalam komputer paralel tersebut ditambah."@in . "\u0417\u0430\u043A\u043E\u0301\u043D \u0410\u043C\u0434\u0430\u043B\u0430 (\u0430\u043D\u0433\u043B. Amdahl's law, \u0438\u043D\u043E\u0433\u0434\u0430 \u0442\u0430\u043A\u0436\u0435 \u0417\u0430\u043A\u043E\u043D \u0410\u043C\u0434\u0430\u043B\u044F \u2014 \u0423\u044D\u0440\u0430) \u2014 \u0438\u043B\u043B\u044E\u0441\u0442\u0440\u0438\u0440\u0443\u0435\u0442 \u043E\u0433\u0440\u0430\u043D\u0438\u0447\u0435\u043D\u0438\u0435 \u0440\u043E\u0441\u0442\u0430 \u043F\u0440\u043E\u0438\u0437\u0432\u043E\u0434\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0441\u0442\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0439 \u0441\u0438\u0441\u0442\u0435\u043C\u044B \u0441 \u0443\u0432\u0435\u043B\u0438\u0447\u0435\u043D\u0438\u0435\u043C \u043A\u043E\u043B\u0438\u0447\u0435\u0441\u0442\u0432\u0430 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u0435\u0439. \u0414\u0436\u0438\u043D \u0410\u043C\u0434\u0430\u043B \u0441\u0444\u043E\u0440\u043C\u0443\u043B\u0438\u0440\u043E\u0432\u0430\u043B \u0437\u0430\u043A\u043E\u043D \u0432 1967 \u0433\u043E\u0434\u0443, \u043E\u0431\u043D\u0430\u0440\u0443\u0436\u0438\u0432 \u043F\u0440\u043E\u0441\u0442\u043E\u0435 \u043F\u043E \u0441\u0443\u0449\u0435\u0441\u0442\u0432\u0443, \u043D\u043E \u043D\u0435\u043F\u0440\u0435\u043E\u0434\u043E\u043B\u0438\u043C\u043E\u0435 \u043F\u043E \u0441\u043E\u0434\u0435\u0440\u0436\u0430\u043D\u0438\u044E \u043E\u0433\u0440\u0430\u043D\u0438\u0447\u0435\u043D\u0438\u0435 \u043D\u0430 \u0440\u043E\u0441\u0442 \u043F\u0440\u043E\u0438\u0437\u0432\u043E\u0434\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0441\u0442\u0438 \u043F\u0440\u0438 \u0440\u0430\u0441\u043F\u0430\u0440\u0430\u043B\u043B\u0435\u043B\u0438\u0432\u0430\u043D\u0438\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u0439: \u00AB\u0412 \u0441\u043B\u0443\u0447\u0430\u0435, \u043A\u043E\u0433\u0434\u0430 \u0437\u0430\u0434\u0430\u0447\u0430 \u0440\u0430\u0437\u0434\u0435\u043B\u044F\u0435\u0442\u0441\u044F \u043D\u0430 \u043D\u0435\u0441\u043A\u043E\u043B\u044C\u043A\u043E \u0447\u0430\u0441\u0442\u0435\u0439, \u0441\u0443\u043C\u043C\u0430\u0440\u043D\u043E\u0435 \u0432\u0440\u0435\u043C\u044F \u0435\u0451 \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u043D\u0430 \u043F\u0430\u0440\u0430\u043B\u043B\u0435\u043B\u044C\u043D\u043E\u0439 \u0441\u0438\u0441\u0442\u0435\u043C\u0435 \u043D\u0435 \u043C\u043E\u0436\u0435\u0442 \u0431\u044B\u0442\u044C \u043C\u0435\u043D\u044C\u0448\u0435 \u0432\u0440\u0435\u043C\u0435\u043D\u0438 \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u0441\u0430\u043C\u043E\u0433\u043E \u043C\u0435\u0434\u043B\u0435\u043D\u043D\u043E\u0433\u043E \u0444\u0440\u0430\u0433\u043C\u0435\u043D\u0442\u0430\u00BB. \u0421\u043E\u0433\u043B\u0430\u0441\u043D\u043E \u044D\u0442\u043E\u043C\u0443 \u0437\u0430\u043A\u043E\u043D\u0443, \u0443\u0441\u043A\u043E\u0440\u0435\u043D\u0438\u0435 \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u044B \u0437\u0430 \u0441\u0447\u0451\u0442 \u0440\u0430\u0441\u043F\u0430\u0440\u0430\u043B\u043B\u0435\u043B\u0438\u0432\u0430\u043D\u0438\u044F \u0435\u0451 \u0438\u043D\u0441\u0442\u0440\u0443\u043A\u0446\u0438\u0439 \u043D\u0430 \u043C\u043D\u043E\u0436\u0435\u0441\u0442\u0432\u0435 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u0435\u0439 \u043E\u0433\u0440\u0430\u043D\u0438\u0447\u0435\u043D\u043E \u0432\u0440\u0435\u043C\u0435\u043D\u0435\u043C, \u043D\u0435\u043E\u0431\u0445\u043E\u0434\u0438\u043C\u044B\u043C \u0434\u043B\u044F \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u0435\u0451 \u043F\u043E\u0441\u043B\u0435\u0434\u043E\u0432\u0430\u0442\u0435\u043B\u044C\u043D\u044B\u0445 \u0438\u043D\u0441\u0442\u0440\u0443\u043A\u0446\u0438\u0439."@ru . . . "\uC554\uB2EC\uC758 \uBC95\uCE59(Amdahl's law)\uC740 \uC554\uB2EC\uC758 \uC800\uC8FC\uB85C\uB3C4 \uBD88\uB9AC\uBA70 \uCEF4\uD4E8\uD130 \uC2DC\uC2A4\uD15C\uC758 \uC77C\uBD80\uB97C \uAC1C\uC120\uD560 \uB54C \uC804\uCCB4\uC801\uC73C\uB85C \uC5BC\uB9C8\uB9CC\uD07C\uC758 \uCD5C\uB300 \uC131\uB2A5 \uD5A5\uC0C1\uC774 \uC788\uB294\uC9C0 \uACC4\uC0B0\uD558\uB294 \uB370 \uC0AC\uC6A9\uB41C\uB2E4. \uC9C4 \uC554\uB2EC\uC758 \uC774\uB984\uC5D0\uC11C \uB530\uC654\uB2E4. \uC554\uB2EC\uC758 \uBC95\uCE59\uC5D0 \uB530\uB974\uBA74, \uC5B4\uB5A4 \uC2DC\uC2A4\uD15C\uC744 \uAC1C\uC120\uD558\uC5EC \uC804\uCCB4 \uC791\uC5C5 \uC911 P%\uC758 \uBD80\uBD84\uC5D0\uC11C S\uBC30\uC758 \uC131\uB2A5\uC774 \uD5A5\uC0C1\uB418\uC5C8\uC744 \uB54C \uC804\uCCB4 \uC2DC\uC2A4\uD15C\uC5D0\uC11C \uCD5C\uB300 \uC131\uB2A5 \uD5A5\uC0C1\uC740 \uB2E4\uC74C\uACFC \uAC19\uB2E4. (\uAC1C\uC120 \uD6C4 \uC2E4\uD589\uC2DC\uAC04 = \uAC1C\uC120\uC5D0 \uC758\uD574 \uC601\uD5A5\uC744 \uBC1B\uB294 \uC2E4\uD589 \uC2DC\uAC04 / \uC131\uB2A5 \uD5A5\uC0C1 \uBE44\uC728 + \uC601\uD5A5\uC744 \uBC1B\uC9C0 \uC54A\uB294 \uC2E4\uD589 \uC2DC\uAC04) \uC608\uB97C \uB4E4\uC5B4\uC11C \uC5B4\uB5A4 \uC791\uC5C5\uC758 40%\uC5D0 \uD574\uB2F9\uD558\uB294 \uBD80\uBD84\uC758 \uC18D\uB3C4\uB97C 2\uBC30\uB85C \uB298\uB9B4 \uC218 \uC788\uB2E4\uBA74,P\uB294 0.4\uC774\uACE0 S\uB294 2\uC774\uACE0 \uCD5C\uB300 \uC131\uB2A5 \uD5A5\uC0C1\uC740 \uAC00 \uB41C\uB2E4."@ko . . "\u0417\u0430\u043A\u043E\u043D \u0410\u043C\u0434\u0430\u043B\u0430"@ru . "Hukum Amdahl (Inggris: Amdahl's law) adalah prinsip dasar dalam peningkatan kecepatan proses suatu komputer jika hanya sebagian dari peralatan perangkat keras ataupun perangkat lunak-nya yang diperbaharui/ditingkatkan kinerjanya. Nama Amdahl diambil dari nama seorang arsitektur komputer terkenal di perusahaan IBM, Gene Amdahl yang pertama kali mencetuskan bentuk formulasi ini. Formulasi atau hukum ini banyak dipakai dalam bidang komputasi paralel untuk meramalkan peningkatan kecepatan maksimum pemrosesan data (secara teoretis) jika jumlah prosesor di dalam komputer paralel tersebut ditambah. Hukum Amdahl ini dinyatakan dalam bentuk: dengan \n* adalah prosentase jumlah instruksi yang ditingkatkan, \n* adalah faktor percepatannya (1 menyatakan tanpa percepatan), \n* menyatakan tiap bagian yang dipercepat/diperlambat, dan \n* adalah jumlah bagian atau prosesor keseluruhan dalam proses percepatan ini. \n* l \n* \n* s"@in . "\u0417\u0430\u043A\u043E\u0301\u043D \u0410\u043C\u0434\u0430\u043B\u0430 (\u0430\u043D\u0433\u043B. Amdahl's law, \u0438\u043D\u043E\u0433\u0434\u0430 \u0442\u0430\u043A\u0436\u0435 \u0417\u0430\u043A\u043E\u043D \u0410\u043C\u0434\u0430\u043B\u044F \u2014 \u0423\u044D\u0440\u0430) \u2014 \u0438\u043B\u043B\u044E\u0441\u0442\u0440\u0438\u0440\u0443\u0435\u0442 \u043E\u0433\u0440\u0430\u043D\u0438\u0447\u0435\u043D\u0438\u0435 \u0440\u043E\u0441\u0442\u0430 \u043F\u0440\u043E\u0438\u0437\u0432\u043E\u0434\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0441\u0442\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0439 \u0441\u0438\u0441\u0442\u0435\u043C\u044B \u0441 \u0443\u0432\u0435\u043B\u0438\u0447\u0435\u043D\u0438\u0435\u043C \u043A\u043E\u043B\u0438\u0447\u0435\u0441\u0442\u0432\u0430 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u0435\u0439. \u0414\u0436\u0438\u043D \u0410\u043C\u0434\u0430\u043B \u0441\u0444\u043E\u0440\u043C\u0443\u043B\u0438\u0440\u043E\u0432\u0430\u043B \u0437\u0430\u043A\u043E\u043D \u0432 1967 \u0433\u043E\u0434\u0443, \u043E\u0431\u043D\u0430\u0440\u0443\u0436\u0438\u0432 \u043F\u0440\u043E\u0441\u0442\u043E\u0435 \u043F\u043E \u0441\u0443\u0449\u0435\u0441\u0442\u0432\u0443, \u043D\u043E \u043D\u0435\u043F\u0440\u0435\u043E\u0434\u043E\u043B\u0438\u043C\u043E\u0435 \u043F\u043E \u0441\u043E\u0434\u0435\u0440\u0436\u0430\u043D\u0438\u044E \u043E\u0433\u0440\u0430\u043D\u0438\u0447\u0435\u043D\u0438\u0435 \u043D\u0430 \u0440\u043E\u0441\u0442 \u043F\u0440\u043E\u0438\u0437\u0432\u043E\u0434\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0441\u0442\u0438 \u043F\u0440\u0438 \u0440\u0430\u0441\u043F\u0430\u0440\u0430\u043B\u043B\u0435\u043B\u0438\u0432\u0430\u043D\u0438\u0438 \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u0439: \u00AB\u0412 \u0441\u043B\u0443\u0447\u0430\u0435, \u043A\u043E\u0433\u0434\u0430 \u0437\u0430\u0434\u0430\u0447\u0430 \u0440\u0430\u0437\u0434\u0435\u043B\u044F\u0435\u0442\u0441\u044F \u043D\u0430 \u043D\u0435\u0441\u043A\u043E\u043B\u044C\u043A\u043E \u0447\u0430\u0441\u0442\u0435\u0439, \u0441\u0443\u043C\u043C\u0430\u0440\u043D\u043E\u0435 \u0432\u0440\u0435\u043C\u044F \u0435\u0451 \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u043D\u0430 \u043F\u0430\u0440\u0430\u043B\u043B\u0435\u043B\u044C\u043D\u043E\u0439 \u0441\u0438\u0441\u0442\u0435\u043C\u0435 \u043D\u0435 \u043C\u043E\u0436\u0435\u0442 \u0431\u044B\u0442\u044C \u043C\u0435\u043D\u044C\u0448\u0435 \u0432\u0440\u0435\u043C\u0435\u043D\u0438 \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u0441\u0430\u043C\u043E\u0433\u043E \u043C\u0435\u0434\u043B\u0435\u043D\u043D\u043E\u0433\u043E \u0444\u0440\u0430\u0433\u043C\u0435\u043D\u0442\u0430\u00BB. \u0421\u043E\u0433\u043B\u0430\u0441\u043D\u043E \u044D\u0442\u043E\u043C\u0443 \u0437\u0430\u043A\u043E\u043D\u0443, \u0443\u0441\u043A\u043E\u0440\u0435\u043D\u0438\u0435 \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u044B \u0437\u0430 \u0441\u0447\u0451\u0442 \u0440\u0430\u0441\u043F\u0430\u0440\u0430\u043B\u043B\u0435\u043B\u0438\u0432\u0430\u043D\u0438\u044F \u0435\u0451 \u0438\u043D\u0441\u0442\u0440\u0443\u043A\u0446\u0438\u0439 \u043D\u0430 \u043C\u043D\u043E\u0436\u0435\u0441\u0442\u0432\u0435 \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u0435\u0439 \u043E\u0433\u0440\u0430\u043D\u0438\u0447\u0435\u043D\u043E \u0432\u0440\u0435\u043C\u0435\u043D\u0435\u043C, \u043D\u0435\u043E\u0431\u0445\u043E\u0434\u0438\u043C\u044B\u043C \u0434\u043B\u044F \u0432\u044B\u043F\u043E\u043B\u043D\u0435\u043D\u0438\u044F \u0435\u0451 \u043F\u043E\u0441\u043B\u0435\u0434\u043E\u0432\u0430\u0442\u0435\u043B\u044C\u043D\u044B\u0445 \u0438\u043D\u0441\u0442\u0440\u0443\u043A\u0446\u0438\u0439."@ru . "\u963F\u59C6\u9054\u723E\u5B9A\u5F8B\uFF08\u82F1\u8A9E\uFF1AAmdahl's law\uFF0CAmdahl's argument\uFF09\uFF0C\u4E00\u500B\u8A08\u7B97\u6A5F\u79D1\u5B78\u754C\u7684\u7D93\u9A57\u6CD5\u5247\uFF0C\u56E0\u5409\u6069\u00B7\u963F\u59C6\u9054\u723E\u800C\u5F97\u540D\u3002\u5B83\u4EE3\u8868\u4E86\u8655\u7406\u5668\u5E76\u884C\u904B\u7B97\u4E4B\u5F8C\u6548\u7387\u63D0\u5347\u7684\u80FD\u529B\u3002"@zh . . . . . . . . . "\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u6CD5\u5247"@ja . "Lei de Amdahl"@pt . . . . "La ley de Amdahl es, en ciencia de la computaci\u00F3n, formulada por Gene Amdahl, utilizada para averiguar la mejora m\u00E1xima de un sistema de informaci\u00F3n cuando solo una parte de \u00E9ste es mejorado. Establece que: La mejora obtenida en el rendimiento de un sistema debido a la alteraci\u00F3n de uno de sus componentes est\u00E1 limitada por la fracci\u00F3n de tiempo que se utiliza dicho componente. La f\u00F3rmula original de la ley de Amdahl es la siguiente: siendo: siendo: \n* \n* \n*"@es . . "Amdahl\u016Fv z\u00E1kon"@cs . . . . . . . . . "\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u6CD5\u5247\uFF08\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u307B\u3046\u305D\u304F\u3001\u82F1\u8A9E: Amdahl's law\uFF09\u306F\u3001\u3042\u308B\u8A08\u7B97\u6A5F\u30B7\u30B9\u30C6\u30E0\u3068\u305D\u306E\u5BFE\u8C61\u3068\u3059\u308B\u8A08\u7B97\u306B\u3064\u3044\u3066\u306E\u30E2\u30C7\u30EB\u306B\u304A\u3044\u3066\u3001\u305D\u306E\u8A08\u7B97\u6A5F\u306E\u4E26\u5217\u5EA6\u3092\u4E0A\u3052\u305F\u5834\u5408\u306B\u3001\u4E26\u5217\u5316\u3067\u304D\u306A\u3044\u90E8\u5206\u306E\u5B58\u5728\u3001\u7279\u306B\u305D\u306E\u5272\u5408\u304C\u300C\u30DC\u30C8\u30EB\u30CD\u30C3\u30AF\u300D\u3068\u306A\u308B\u3053\u3068\u3092\u793A\u3057\u305F\u6CD5\u5247\u3067\u3042\u308B\u3002\u30B3\u30F3\u30D4\u30E5\u30FC\u30BF\u30FB\u30A2\u30FC\u30AD\u30C6\u30AF\u30C8\u306E\u30B8\u30FC\u30F3\u30FB\u30A2\u30E0\u30C0\u30FC\u30EB\u304C\u4E3B\u5F35\u3057\u305F\u3082\u306E\u3067\u3042\u308A\u3001\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u4E3B\u5F35\uFF08\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u3057\u3085\u3061\u3087\u3046\u3001\u82F1\u8A9E: Amdahl's argument\uFF09\u3068\u3044\u3046\u547C\u79F0\u3082\u3042\u308B\u3002 \u8907\u6570\u306E\u30D7\u30ED\u30BB\u30C3\u30B5\u3092\u4F7F\u3044\u4E26\u5217\u8A08\u7B97\u306B\u3088\u3063\u3066\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u9AD8\u901F\u5316\u3092\u56F3\u308B\u5834\u5408\u3001\u305D\u306E\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u4E2D\u3067\u9010\u6B21\u7684\u306B\u5B9F\u884C\u3057\u306A\u3051\u308C\u3070\u306A\u3089\u306A\u3044\u90E8\u5206\u306E\u6642\u9593\u306B\u3088\u3063\u3066\u3001\u9AD8\u901F\u5316\u304C\u5236\u9650\u3055\u308C\u308B\u3002\u4F8B\u3048\u3070\u30011\u30D7\u30ED\u30BB\u30C3\u30B5\u3067\u306F20\u6642\u9593\u304B\u304B\u308B\u554F\u984C\u304C\u3042\u308A\u3001\u305D\u306E\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u3046\u3061\u3001\u5408\u8A08\u30671\u6642\u9593\u5206\u304C\u4E26\u5217\u51E6\u7406\u3067\u304D\u306A\u3044\u3068\u3059\u308B\u3002\u3053\u306E\u5834\u5408\u300119\u6642\u9593\u5206\uFF0895%\uFF09\u306F\u4E26\u5217\u51E6\u7406\u3067\u304D\u308B\u304C\u3001\u3069\u308C\u3060\u3051\u30D7\u30ED\u30BB\u30C3\u30B5\u3092\u8FFD\u52A0\u3057\u305F\u3068\u3057\u3066\u3082\u3001\u6700\u5C0F\u5B9F\u884C\u6642\u9593\u306F\u4E26\u5217\u51E6\u7406\u3067\u304D\u306A\u3044\u90E8\u5206\u306B\u304B\u304B\u308B1\u6642\u9593\uFF085%\uFF09\u3088\u308A\u77ED\u304F\u306A\u3089\u306A\u3044\u3002"@ja . . . "Legge di Amdahl"@it . . . "\u0417\u0430\u043A\u043E\u043D \u0410\u043C\u0434\u0430\u043B\u0430 \u0432\u0438\u0437\u043D\u0430\u0447\u0430\u0454 \u043F\u043E\u0442\u0435\u043D\u0446\u0456\u0439\u043D\u0435 \u043F\u0440\u0438\u0441\u043A\u043E\u0440\u0435\u043D\u043D\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0443 \u043F\u0440\u0438 \u0437\u0431\u0456\u043B\u044C\u0448\u0435\u043D\u043D\u0456 \u0447\u0438\u0441\u043B\u0430 \u043F\u0440\u043E\u0446\u0435\u0441\u043E\u0440\u0456\u0432. \u0412\u0456\u043D \u0432\u043F\u0435\u0440\u0448\u0435 \u0431\u0443\u0432 \u0441\u0444\u043E\u0440\u043C\u0443\u043B\u044C\u043E\u0432\u0430\u043D\u0438\u0439 \u0414\u0436\u0438\u043D\u043E\u043C \u0410\u043C\u0434\u0430\u043B\u0435\u043C \u0443 1967 \u0440\u043E\u0446\u0456. \u0417\u0430\u043A\u043E\u043D \u0441\u0442\u0432\u0435\u0440\u0434\u0436\u0443\u0454, \u0449\u043E \u043D\u0435\u0432\u0435\u043B\u0438\u043A\u0430 \u0447\u0430\u0441\u0442\u0438\u043D\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438, \u0449\u043E \u043D\u0435 \u043F\u0456\u0434\u0434\u0430\u0454\u0442\u044C\u0441\u044F \u0440\u043E\u0437\u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044E\u0432\u0430\u043D\u043D\u044E, \u043E\u0431\u043C\u0435\u0436\u0438\u0442\u044C \u0437\u0430\u0433\u0430\u043B\u044C\u043D\u0435 \u043F\u0440\u0438\u0441\u043A\u043E\u0440\u0435\u043D\u043D\u044F \u0432\u0456\u0434 \u0440\u043E\u0437\u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044E\u0432\u0430\u043D\u043D\u044F. \u0411\u0443\u0434\u044C-\u044F\u043A\u0430 \u0432\u0435\u043B\u0438\u043A\u0430 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u0430 \u0447\u0438 \u0456\u043D\u0436\u0435\u043D\u0435\u0440\u043D\u0430 \u0437\u0430\u0434\u0430\u0447\u0430 \u0437\u0430\u0437\u0432\u0438\u0447\u0430\u0439 \u0431\u0443\u0434\u0435 \u0441\u043A\u043B\u0430\u0434\u0430\u0442\u0438\u0441\u044C \u0437 \u043A\u0456\u043B\u044C\u043A\u043E\u0445 \u0447\u0430\u0441\u0442\u0438\u043D, \u0449\u043E \u043C\u043E\u0436\u0443\u0442\u044C \u0432\u0438\u043A\u043E\u043D\u0443\u0432\u0430\u0442\u0438\u0441\u044C \u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044C\u043D\u043E, \u0442\u0430 \u043A\u0456\u043B\u044C\u043A\u043E\u0445 \u0447\u0430\u0441\u0442\u0438\u043D \u0449\u043E \u0432\u0438\u043A\u043E\u043D\u0443\u044E\u0442\u044C\u0441\u044F \u0442\u0456\u043B\u044C\u043A\u0438 \u043F\u043E\u0441\u043B\u0456\u0434\u043E\u0432\u043D\u043E. \u0426\u0435\u0439 \u0437\u0432'\u044F\u0437\u043E\u043A \u0437\u0430\u0434\u0430\u0454\u0442\u044C\u0441\u044F \u0440\u0456\u0432\u043D\u044F\u043D\u043D\u044F\u043C:"@uk . . "In computer architecture, Amdahl's law (or Amdahl's argument) is a formula which gives the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved. It states that \"the overall performance improvement gained by optimizing a single part of a system is limited by the fraction of time that the improved part is actually used\". It is named after computer scientist Gene Amdahl, and was presented at the American Federation of Information Processing Societies (AFIPS) Spring Joint Computer Conference in 1967."@en . . "La legge di Amdahl, che ha preso il nome del progettista di computer Gene Amdahl, viene usata per trovare il miglioramento atteso massimo in una architettura di calcolatori o in un sistema informatico quando vengono migliorate solo alcune parti del sistema. Nella sua forma pi\u00F9 generale pu\u00F2 essere espressa come: \"Il miglioramento delle prestazioni di un sistema che si pu\u00F2 ottenere ottimizzando una certa parte del sistema \u00E8 limitato dalla frazione di tempo in cui tale parte \u00E8 effettivamente utilizzata\" che pu\u00F2 essere ulteriormente semplificata nella pratica regola: ."@it . . "Amdahlsches Gesetz"@de . "\u963F\u59C6\u8FBE\u5C14\u5B9A\u5F8B"@zh . "\u0642\u0627\u0646\u0648\u0646 \u0623\u0645\u062F\u0627\u0644"@ar . . . . . . . "Amdahl\u016Fv z\u00E1kon je pravidlo pou\u017E\u00EDvan\u00E9 v informatice k vyj\u00E1d\u0159en\u00ED maxim\u00E1ln\u00EDho p\u0159edpokl\u00E1dan\u00E9ho zlep\u0161en\u00ED syst\u00E9mu pot\u00E9, co je vylep\u0161ena pouze n\u011Bkter\u00E1 z jeho \u010D\u00E1st\u00ED. Vyu\u017E\u00EDv\u00E1 se nap\u0159. u v\u00EDceprocesorov\u00FDch syst\u00E9m\u016F k p\u0159edpov\u011Bzen\u00ED teoretick\u00E9ho maxim\u00E1ln\u00EDho zrychlen\u00ED p\u0159i p\u0159id\u00E1v\u00E1n\u00ED dal\u0161\u00EDch procesor\u016F. Z\u00E1kon je pojmenov\u00E1n po americk\u00E9m po\u010D\u00EDta\u010Dov\u00E9m architektovi . Poprv\u00E9 byl p\u0159edstaven na konferenci v roce 1967."@cs . . . . . . . . "\uC554\uB2EC\uC758 \uBC95\uCE59(Amdahl's law)\uC740 \uC554\uB2EC\uC758 \uC800\uC8FC\uB85C\uB3C4 \uBD88\uB9AC\uBA70 \uCEF4\uD4E8\uD130 \uC2DC\uC2A4\uD15C\uC758 \uC77C\uBD80\uB97C \uAC1C\uC120\uD560 \uB54C \uC804\uCCB4\uC801\uC73C\uB85C \uC5BC\uB9C8\uB9CC\uD07C\uC758 \uCD5C\uB300 \uC131\uB2A5 \uD5A5\uC0C1\uC774 \uC788\uB294\uC9C0 \uACC4\uC0B0\uD558\uB294 \uB370 \uC0AC\uC6A9\uB41C\uB2E4. \uC9C4 \uC554\uB2EC\uC758 \uC774\uB984\uC5D0\uC11C \uB530\uC654\uB2E4. \uC554\uB2EC\uC758 \uBC95\uCE59\uC5D0 \uB530\uB974\uBA74, \uC5B4\uB5A4 \uC2DC\uC2A4\uD15C\uC744 \uAC1C\uC120\uD558\uC5EC \uC804\uCCB4 \uC791\uC5C5 \uC911 P%\uC758 \uBD80\uBD84\uC5D0\uC11C S\uBC30\uC758 \uC131\uB2A5\uC774 \uD5A5\uC0C1\uB418\uC5C8\uC744 \uB54C \uC804\uCCB4 \uC2DC\uC2A4\uD15C\uC5D0\uC11C \uCD5C\uB300 \uC131\uB2A5 \uD5A5\uC0C1\uC740 \uB2E4\uC74C\uACFC \uAC19\uB2E4. (\uAC1C\uC120 \uD6C4 \uC2E4\uD589\uC2DC\uAC04 = \uAC1C\uC120\uC5D0 \uC758\uD574 \uC601\uD5A5\uC744 \uBC1B\uB294 \uC2E4\uD589 \uC2DC\uAC04 / \uC131\uB2A5 \uD5A5\uC0C1 \uBE44\uC728 + \uC601\uD5A5\uC744 \uBC1B\uC9C0 \uC54A\uB294 \uC2E4\uD589 \uC2DC\uAC04) \uC608\uB97C \uB4E4\uC5B4\uC11C \uC5B4\uB5A4 \uC791\uC5C5\uC758 40%\uC5D0 \uD574\uB2F9\uD558\uB294 \uBD80\uBD84\uC758 \uC18D\uB3C4\uB97C 2\uBC30\uB85C \uB298\uB9B4 \uC218 \uC788\uB2E4\uBA74,P\uB294 0.4\uC774\uACE0 S\uB294 2\uC774\uACE0 \uCD5C\uB300 \uC131\uB2A5 \uD5A5\uC0C1\uC740 \uAC00 \uB41C\uB2E4."@ko . . . . "Das amdahlsche Gesetz (benannt 1967 nach Gene Amdahl) ist ein Modell in der Informatik \u00FCber die Beschleunigung von Programmen durch parallele Ausf\u00FChrung. Nach Amdahl wird der Geschwindigkeitszuwachs vor allem durch den sequentiellen Anteil des Problems beschr\u00E4nkt, da sich dessen Ausf\u00FChrungszeit durch Parallelisierung nicht verringern l\u00E4sst."@de . . . "Prawo Amdahla, znane r\u00F3wnie\u017C jako Wyw\u00F3d Amdahla, zosta\u0142o nazwane od nazwiska tw\u00F3rcy architektur komputerowych Gene Amdahla, i jest u\u017Cywane do znajdowania maksymalnego spodziewanego zwi\u0119kszenia wydajno\u015Bci ca\u0142kowitej systemu je\u017Celi tylko cz\u0119\u015B\u0107 systemu zosta\u0142a ulepszona. Jest ono cz\u0119sto u\u017Cywane w przypadku prowadzenia oblicze\u0144 r\u00F3wnoleg\u0142ych do przewidzenia teoretycznego maksymalnego wzrostu szybko\u015Bci oblicze\u0144 przy u\u017Cyciu wielu procesor\u00F3w. Zwi\u0119kszenie szybko\u015Bci wykonywania si\u0119 programu przy u\u017Cyciu wielu procesor\u00F3w w obliczeniach r\u00F3wnoleg\u0142ych jest ograniczane przez czas potrzebny do sekwencyjnego dzielenia programu. Na przyk\u0142ad je\u017Celi program potrzebuje 20 godzin w przypadku oblicze\u0144 prowadzonych na procesorze jednordzeniowym i 1 godzina oblicze\u0144 nie mo\u017Ce zosta\u0107 przetworzona poprzez obliczenia r\u00F3wnoleg\u0142e, ale pozosta\u0142e 19 godzin (95%) oblicze\u0144 mog\u0105, w\u00F3wczas bez wzgl\u0119du na to ile procesor\u00F3w zostanie u\u017Cytych do przeprowadzenia oblicze\u0144 r\u00F3wnoleg\u0142ych minimalny czas wykonania programu nie b\u0119dzie nigdy mniejszy ni\u017C ta krytyczna 1 godzina. Tak wi\u0119c zwi\u0119kszenie szybko\u015Bci oblicze\u0144 jest ograniczone do 20\u00D7, jak przedstawiono na diagramie."@pl . . . . "Hukum Amdahl"@in . "Das amdahlsche Gesetz (benannt 1967 nach Gene Amdahl) ist ein Modell in der Informatik \u00FCber die Beschleunigung von Programmen durch parallele Ausf\u00FChrung. Nach Amdahl wird der Geschwindigkeitszuwachs vor allem durch den sequentiellen Anteil des Problems beschr\u00E4nkt, da sich dessen Ausf\u00FChrungszeit durch Parallelisierung nicht verringern l\u00E4sst."@de . . . . "\u0417\u0430\u043A\u043E\u043D \u0410\u043C\u0434\u0430\u043B\u0430"@uk . . . "Prawo Amdahla, znane r\u00F3wnie\u017C jako Wyw\u00F3d Amdahla, zosta\u0142o nazwane od nazwiska tw\u00F3rcy architektur komputerowych Gene Amdahla, i jest u\u017Cywane do znajdowania maksymalnego spodziewanego zwi\u0119kszenia wydajno\u015Bci ca\u0142kowitej systemu je\u017Celi tylko cz\u0119\u015B\u0107 systemu zosta\u0142a ulepszona. Jest ono cz\u0119sto u\u017Cywane w przypadku prowadzenia oblicze\u0144 r\u00F3wnoleg\u0142ych do przewidzenia teoretycznego maksymalnego wzrostu szybko\u015Bci oblicze\u0144 przy u\u017Cyciu wielu procesor\u00F3w."@pl . . . "\u0642\u0627\u0646\u0648\u0646 \u0623\u0645\u062F\u0627\u0644\u060C \u0627\u0644\u0630\u064A \u0648\u0636\u0639\u0647 \u062C\u064A\u0646 \u0623\u0645\u062F\u0627\u0644\u060C \u064A\u0648\u0636\u062D \u0645\u062F\u0649 \u0631\u0628\u062D \u0641\u064A \u0627\u0644\u0623\u062F\u0627\u0621 \u0627\u0644\u0630\u064A \u064A\u0645\u0643\u0646 \u0627\u0646\u062A\u0638\u0627\u0631\u0647 \u0645\u0646 \u062D\u0627\u0633\u0648\u0628 \u0628\u062A\u062D\u0633\u064A\u0646 \u0623\u062D\u062F \u0645\u0643\u0648\u0646\u0627\u062A \u0623\u062F\u0627\u0626\u0647. \u0628\u0634\u0643\u0644\u0647 \u0627\u0644\u0639\u0627\u0645\u060C \u0641\u0625\u0646 \u0627\u0644\u0631\u0628\u062D \u0641\u064A \u0627\u0644\u0623\u062F\u0627\u0621 \u064A\u0633\u0627\u0648\u064A \u0645\u062F\u0629 \u0627\u0644\u062A\u0646\u0641\u064A\u0630 \u0627\u0644\u0643\u0627\u0645\u0644 \u0644\u0644\u0645\u0647\u0645\u0629 \u0628\u062F\u0648\u0646 \u062A\u062D\u0633\u064A\u0646 \u0645\u0642\u0633\u0648\u0645 \u0639\u0644\u0649 \u0645\u062F\u0629 \u0627\u0644\u062A\u0646\u0641\u064A\u0630 \u0646\u0641\u0633 \u0627\u0644\u0645\u0647\u0645\u0629 \u0628\u0625\u062F\u062E\u0627\u0644 \u0627\u0644\u062A\u062D\u0633\u064A\u0646. \u0641\u064A \u0646\u0633\u062E\u062A\u0647 \u0627\u0644\u0623\u0635\u0644\u064A\u0629\u060C \u064A\u0645\u062B\u0644 \u062A\u0637\u0628\u064A\u0642\u0627 \u0628\u0633\u064A\u0637\u0627 \u0644\u0642\u0627\u0639\u062F\u0629 \u0627\u0644\u062B\u0627\u0644\u062B\u0629. \u064A\u0648\u0636\u062D \u0643\u064A\u0641 \u0623\u0646 \u0627\u0644\u0631\u0628\u062D \u0641\u064A \u0627\u0644\u0632\u0645\u0646 \u0627\u0644\u0630\u064A \u064A\u0645\u0646\u062D\u0647 \u0646\u0638\u0627\u0645 \u0645\u062A\u0639\u062F\u062F \u0627\u0644\u0645\u0639\u0627\u0644\u062C\u0627\u062A \u064A\u062A\u0639\u0644\u0642 \u0628\u0640 : \n* \u0639\u062F\u062F \u0627\u0644\u0645\u0639\u0627\u0644\u062C\u0627\u062A N \n* \u0627\u0644\u062C\u0632\u0621 \u0627\u0644\u0642\u0627\u0628\u0644 \u0644\u0644\u0645\u0648\u0627\u0632\u0627\u0629 s \u0641\u064A \u0647\u0630\u0627 \u0627\u0644\u0645\u0633\u062A\u0648\u0649 \u064A\u062A\u0645 \u0625\u0647\u0645\u0627\u0644 \u0627\u0644\u0639\u0645\u0644 \u0627\u0644\u0645\u062A\u0632\u0627\u064A\u062F \u0627\u0644\u0646\u0627\u062A\u062C \u0639\u0646 \u0639\u0645\u0644\u064A\u0629 \u0627\u0644\u0645\u0648\u0627\u0632\u0627\u0629. \u0648\u0635\u064A\u063A\u0629 \u0627\u0644\u0642\u0627\u0646\u0648\u0646 \u0647\u064A : \u0625\u0630\u0627 \u0643\u0627\u0646 N \u064A\u0624\u0648\u0644 \u0625\u0644\u0649 \u0645\u0627\u0644\u0627 \u0646\u0647\u0627\u064A\u0629\u060C \u0646\u062D\u0635\u0644 \u0639\u0644\u0649 : \n*"@ar . "La ley de Amdahl es, en ciencia de la computaci\u00F3n, formulada por Gene Amdahl, utilizada para averiguar la mejora m\u00E1xima de un sistema de informaci\u00F3n cuando solo una parte de \u00E9ste es mejorado. Establece que: La mejora obtenida en el rendimiento de un sistema debido a la alteraci\u00F3n de uno de sus componentes est\u00E1 limitada por la fracci\u00F3n de tiempo que se utiliza dicho componente. La f\u00F3rmula original de la ley de Amdahl es la siguiente: siendo: \n* = fracci\u00F3n de tiempo que el sistema utiliza el subsistema mejorado \n* = factor de mejora que se ha introducido en el subsistema mejorado. \n* = tiempo de ejecuci\u00F3n antiguo. \n* = tiempo de ejecuci\u00F3n mejorado. Esta f\u00F3rmula se puede reescribir usando la definici\u00F3n del incremento de la velocidad que viene dado por , por lo que la f\u00F3rmula anterior se puede reescribir como: siendo: \n* es la aceleraci\u00F3n o ganancia en velocidad conseguida en el sistema completo debido a la mejora de uno de sus subsistemas. \n* , es el factor de mejora que se ha introducido en el subsistema mejorado. \n* , es la fracci\u00F3n de tiempo que el sistema utiliza el subsistema mejorado. Por ejemplo, si en un programa de ordenador el tiempo de ejecuci\u00F3n de un cierto algoritmo supone un 30% del tiempo de ejecuci\u00F3n total del programa, y conseguimos hacer que este algoritmo se ejecute en la mitad de tiempo se tendr\u00E1: \n* \n* \n* Es decir, se ha mejorado la velocidad de ejecuci\u00F3n del programa en un factor de 1,18.La ley de Amdahl se mide en unidades gen\u00E9ricas, es decir los resultados no son porcentajes, ni unidades de tiempo. La ley de Amdahl se puede interpretar de manera m\u00E1s t\u00E9cnica, pero en t\u00E9rminos simples, significa que es el algoritmo el que decide la mejora de velocidad, no el n\u00FAmero de procesadores. Finalmente se llega a un momento que no se puede paralelizar m\u00E1s el algoritmo."@es . "La llei d'Amdahl, anomenada aix\u00ED en honor de l'enginyer d'ordinadors Gen Amdahl, s'utilitza per trobar la m\u00E0xima millora esperada del sistema total quan solament part del sistema \u00E9s millorada.Sovint s'utilitza un c\u00E0lcul paral\u00B7lel per predir la m\u00E0xima acceleraci\u00F3 te\u00F2rica utilitzant m\u00FAltiples processadors. La llei d'Amdahl pot ser interpretada m\u00E9s t\u00E8cnicament, per\u00F2 en termes simples significa que \u00E9s l'algorisme qui decideix l'acceleraci\u00F3, no el nombre de processadors. Finalment, arribes a un lloc on no pots paral\u00B7lelitzar m\u00E9s l'algorisme."@ca . "En architecture informatique, la loi d'Amdahl donne l'acc\u00E9l\u00E9ration th\u00E9orique en latence de l'ex\u00E9cution d'une t\u00E2che \u00E0 charge d'ex\u00E9cution constante que l'on peut attendre d'un syst\u00E8me dont on am\u00E9liore les ressources. Elle est \u00E9nonc\u00E9e par l'informaticien Gene Amdahl \u00E0 l'AFIPS Spring Joint Computer Conference en 1967. La loi d'Amdahl peut \u00EAtre formul\u00E9e de la fa\u00E7on suivante : o\u00F9 De plus,"@fr . . . . . . "\u0417\u0430\u043A\u043E\u043D \u0410\u043C\u0434\u0430\u043B\u0430 \u0432\u0438\u0437\u043D\u0430\u0447\u0430\u0454 \u043F\u043E\u0442\u0435\u043D\u0446\u0456\u0439\u043D\u0435 \u043F\u0440\u0438\u0441\u043A\u043E\u0440\u0435\u043D\u043D\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0443 \u043F\u0440\u0438 \u0437\u0431\u0456\u043B\u044C\u0448\u0435\u043D\u043D\u0456 \u0447\u0438\u0441\u043B\u0430 \u043F\u0440\u043E\u0446\u0435\u0441\u043E\u0440\u0456\u0432. \u0412\u0456\u043D \u0432\u043F\u0435\u0440\u0448\u0435 \u0431\u0443\u0432 \u0441\u0444\u043E\u0440\u043C\u0443\u043B\u044C\u043E\u0432\u0430\u043D\u0438\u0439 \u0414\u0436\u0438\u043D\u043E\u043C \u0410\u043C\u0434\u0430\u043B\u0435\u043C \u0443 1967 \u0440\u043E\u0446\u0456. \u0417\u0430\u043A\u043E\u043D \u0441\u0442\u0432\u0435\u0440\u0434\u0436\u0443\u0454, \u0449\u043E \u043D\u0435\u0432\u0435\u043B\u0438\u043A\u0430 \u0447\u0430\u0441\u0442\u0438\u043D\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438, \u0449\u043E \u043D\u0435 \u043F\u0456\u0434\u0434\u0430\u0454\u0442\u044C\u0441\u044F \u0440\u043E\u0437\u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044E\u0432\u0430\u043D\u043D\u044E, \u043E\u0431\u043C\u0435\u0436\u0438\u0442\u044C \u0437\u0430\u0433\u0430\u043B\u044C\u043D\u0435 \u043F\u0440\u0438\u0441\u043A\u043E\u0440\u0435\u043D\u043D\u044F \u0432\u0456\u0434 \u0440\u043E\u0437\u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044E\u0432\u0430\u043D\u043D\u044F. \u0411\u0443\u0434\u044C-\u044F\u043A\u0430 \u0432\u0435\u043B\u0438\u043A\u0430 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u0430 \u0447\u0438 \u0456\u043D\u0436\u0435\u043D\u0435\u0440\u043D\u0430 \u0437\u0430\u0434\u0430\u0447\u0430 \u0437\u0430\u0437\u0432\u0438\u0447\u0430\u0439 \u0431\u0443\u0434\u0435 \u0441\u043A\u043B\u0430\u0434\u0430\u0442\u0438\u0441\u044C \u0437 \u043A\u0456\u043B\u044C\u043A\u043E\u0445 \u0447\u0430\u0441\u0442\u0438\u043D, \u0449\u043E \u043C\u043E\u0436\u0443\u0442\u044C \u0432\u0438\u043A\u043E\u043D\u0443\u0432\u0430\u0442\u0438\u0441\u044C \u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044C\u043D\u043E, \u0442\u0430 \u043A\u0456\u043B\u044C\u043A\u043E\u0445 \u0447\u0430\u0441\u0442\u0438\u043D \u0449\u043E \u0432\u0438\u043A\u043E\u043D\u0443\u044E\u0442\u044C\u0441\u044F \u0442\u0456\u043B\u044C\u043A\u0438 \u043F\u043E\u0441\u043B\u0456\u0434\u043E\u0432\u043D\u043E. \u0426\u0435\u0439 \u0437\u0432'\u044F\u0437\u043E\u043A \u0437\u0430\u0434\u0430\u0454\u0442\u044C\u0441\u044F \u0440\u0456\u0432\u043D\u044F\u043D\u043D\u044F\u043C: \u0434\u0435 \u2014 \u043F\u0440\u0438\u0441\u043A\u043E\u0440\u0435\u043D\u043D\u044F \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438 (\u044F\u043A \u0432\u0456\u0434\u043D\u043E\u0448\u0435\u043D\u043D\u044F \u0434\u043E \u0457\u0457 \u043F\u043E\u0447\u0430\u0442\u043A\u043E\u0432\u043E\u0433\u043E \u0447\u0430\u0441\u0443 \u0440\u043E\u0431\u043E\u0442\u0438); \u2014 \u0447\u0430\u0441\u0442\u0438\u043D\u0430 \u044F\u043A\u0443 \u043C\u043E\u0436\u043D\u0430 \u0432\u0438\u043A\u043E\u043D\u0443\u0432\u0430\u0442\u0438 \u043F\u043E\u0441\u043B\u0456\u0434\u043E\u0432\u043D\u043E; \u2014 \u0447\u0430\u0441\u0442\u0438\u043D\u0430, \u044F\u043A\u0430 \u0432\u0438\u043A\u043E\u043D\u0443\u0454\u0442\u044C\u0441\u044F \u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044C\u043D\u043E; \u2014 \u043A\u0456\u043B\u044C\u043A\u0456\u0441\u0442\u044C \u043F\u0440\u043E\u0446\u0435\u0441\u043E\u0440\u0456\u0432. \u042F\u043A\u0449\u043E \u043F\u043E\u0441\u043B\u0456\u0434\u043E\u0432\u043D\u0430 \u0447\u0430\u0441\u0442\u0438\u043D\u0430 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438 \u0432\u0438\u043A\u043E\u043D\u0443\u0454\u0442\u044C\u0441\u044F 10 % \u0432\u0441\u044C\u043E\u0433\u043E \u0447\u0430\u0441\u0443 \u0440\u043E\u0431\u043E\u0442\u0438, \u043D\u0435\u043C\u043E\u0436\u043B\u0438\u0432\u043E \u043F\u0440\u0438\u0441\u043A\u043E\u0440\u0438\u0442\u0438 \u0432\u0438\u043A\u043E\u043D\u0430\u043D\u043D\u044F \u0442\u0430\u043A\u043E\u0457 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438 \u0431\u0456\u043B\u044C\u0448\u0435 \u043D\u0456\u0436 \u0432 10 \u0440\u0430\u0437\u0456\u0432 \u2014 \u043D\u0435\u0437\u0430\u043B\u0435\u0436\u043D\u043E \u0432\u0456\u0434 \u0442\u043E\u0433\u043E, \u0441\u043A\u0456\u043B\u044C\u043A\u0438 \u043F\u0440\u043E\u0446\u0435\u0441\u043E\u0440\u0456\u0432 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0454 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0430. \u0422\u0430\u043A\u0438\u043C \u0447\u0438\u043D\u043E\u043C \u0437\u0430\u043A\u043E\u043D \u0432\u0438\u0437\u043D\u0430\u0447\u0430\u0454 \u0432\u0435\u0440\u0445\u043D\u044E \u043C\u0435\u0436\u0443 \u043A\u043E\u0440\u0438\u0441\u043D\u043E\u0441\u0442\u0456 \u0432\u0456\u0434 \u0437\u0431\u0456\u043B\u044C\u0448\u0435\u043D\u043D\u044F \u043A\u0456\u043B\u044C\u043A\u043E\u0441\u0442\u0456 \u043F\u0440\u043E\u0446\u0435\u0441\u043E\u0440\u0456\u0432 \u0432 \u043E\u0431\u0447\u0438\u0441\u043B\u044E\u0432\u0430\u043B\u044C\u043D\u0456\u0439 \u0441\u0438\u0441\u0442\u0435\u043C\u0456. \u00AB\u041A\u043E\u043B\u0438 \u0437\u0430\u0434\u0430\u0447\u0430 \u043D\u0435 \u043C\u043E\u0436\u0435 \u0440\u043E\u0437\u043F\u0430\u0440\u0430\u043B\u0435\u043B\u044E\u0432\u0430\u0442\u0438\u0441\u044C \u0447\u0435\u0440\u0435\u0437 \u043E\u0431\u043C\u0435\u0436\u0435\u043D\u043D\u044F \u043F\u043E\u0441\u043B\u0456\u0434\u043E\u0432\u043D\u043E\u0457 \u0447\u0430\u0441\u0442\u0438\u043D\u0438, \u043F\u0440\u0438\u043A\u043B\u0430\u0434\u0430\u043D\u043D\u044F \u0434\u043E\u0434\u0430\u0442\u043A\u043E\u0432\u0438\u0445 \u0437\u0443\u0441\u0438\u043B\u044C \u043D\u0435 \u043C\u0430\u0454 \u043D\u0456\u044F\u043A\u043E\u0433\u043E \u0435\u0444\u0435\u043A\u0442\u0443 \u0434\u043B\u044F \u0440\u043E\u0437\u043A\u043B\u0430\u0434\u0443. \u042F\u043A\u0449\u043E \u0432\u0440\u0430\u0445\u0443\u0432\u0430\u0442\u0438 \u0447\u0430\u0441, \u043D\u0435\u043E\u0431\u0445\u0456\u0434\u043D\u0438\u0439 \u0434\u043B\u044F \u043F\u0435\u0440\u0435\u0434\u0430\u0447\u0456 \u0434\u0430\u043D\u0438\u0445 \u043C\u0456\u0436 \u0432\u0443\u0437\u043B\u0430\u043C\u0438 \u043E\u0431\u0447\u0438\u0441\u043B\u044E\u0432\u0430\u043B\u044C\u043D\u043E\u0457 \u0441\u0438\u0441\u0442\u0435\u043C\u0438, \u0442\u043E \u0437\u0430\u043B\u0435\u0436\u043D\u0456\u0441\u0442\u044C \u0447\u0430\u0441\u0443 \u043E\u0431\u0447\u0438\u0441\u043B\u0435\u043D\u044C \u0432\u0456\u0434 \u0447\u0438\u0441\u043B\u0430 \u0432\u0443\u0437\u043B\u0456\u0432 \u043C\u0430\u0442\u0438\u043C\u0435 \u043C\u0430\u043A\u0441\u0438\u043C\u0443\u043C. \u0426\u0435 \u043E\u0437\u043D\u0430\u0447\u0430\u0454, \u0449\u043E \u0437 \u043F\u0435\u0432\u043D\u043E\u0433\u043E \u043C\u043E\u043C\u0435\u043D\u0442\u0443 \u0434\u043E\u0434\u0430\u0432\u0430\u043D\u043D\u044F \u043D\u043E\u0432\u0438\u0445 \u0432\u0443\u0437\u043B\u0456\u0432 \u0432 \u0441\u0438\u0441\u0442\u0435\u043C\u0443 \u0431\u0443\u0434\u0435 \u0437\u0431\u0456\u043B\u044C\u0448\u0443\u0432\u0430\u0442\u0438 \u0447\u0430\u0441 \u0440\u043E\u0431\u043E\u0442\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0438."@uk . . . "17757"^^ . "A lei de Amdahl, tamb\u00E9m conhecida como argumento de Amdahl, \u00E9 usada para encontrar a m\u00E1xima melhora esperada para um sistema em geral quando apenas uma \u00FAnica parte dele \u00E9 melhorada. Isto \u00E9 frequentemente usado em computa\u00E7\u00E3o paralela para prever o m\u00E1ximo speedup te\u00F3rico usando m\u00FAltiplos processadores. A lei possui o nome do Arquiteto computacional Gene Amdahl, e foi apresentada a AFIPS na Confer\u00EAncia Conjunta de Inform\u00E1tica na primavera de 1967."@pt . . . "\u0642\u0627\u0646\u0648\u0646 \u0623\u0645\u062F\u0627\u0644\u060C \u0627\u0644\u0630\u064A \u0648\u0636\u0639\u0647 \u062C\u064A\u0646 \u0623\u0645\u062F\u0627\u0644\u060C \u064A\u0648\u0636\u062D \u0645\u062F\u0649 \u0631\u0628\u062D \u0641\u064A \u0627\u0644\u0623\u062F\u0627\u0621 \u0627\u0644\u0630\u064A \u064A\u0645\u0643\u0646 \u0627\u0646\u062A\u0638\u0627\u0631\u0647 \u0645\u0646 \u062D\u0627\u0633\u0648\u0628 \u0628\u062A\u062D\u0633\u064A\u0646 \u0623\u062D\u062F \u0645\u0643\u0648\u0646\u0627\u062A \u0623\u062F\u0627\u0626\u0647. \u0628\u0634\u0643\u0644\u0647 \u0627\u0644\u0639\u0627\u0645\u060C \u0641\u0625\u0646 \u0627\u0644\u0631\u0628\u062D \u0641\u064A \u0627\u0644\u0623\u062F\u0627\u0621 \u064A\u0633\u0627\u0648\u064A \u0645\u062F\u0629 \u0627\u0644\u062A\u0646\u0641\u064A\u0630 \u0627\u0644\u0643\u0627\u0645\u0644 \u0644\u0644\u0645\u0647\u0645\u0629 \u0628\u062F\u0648\u0646 \u062A\u062D\u0633\u064A\u0646 \u0645\u0642\u0633\u0648\u0645 \u0639\u0644\u0649 \u0645\u062F\u0629 \u0627\u0644\u062A\u0646\u0641\u064A\u0630 \u0646\u0641\u0633 \u0627\u0644\u0645\u0647\u0645\u0629 \u0628\u0625\u062F\u062E\u0627\u0644 \u0627\u0644\u062A\u062D\u0633\u064A\u0646. \u0641\u064A \u0646\u0633\u062E\u062A\u0647 \u0627\u0644\u0623\u0635\u0644\u064A\u0629\u060C \u064A\u0645\u062B\u0644 \u062A\u0637\u0628\u064A\u0642\u0627 \u0628\u0633\u064A\u0637\u0627 \u0644\u0642\u0627\u0639\u062F\u0629 \u0627\u0644\u062B\u0627\u0644\u062B\u0629. \u064A\u0648\u0636\u062D \u0643\u064A\u0641 \u0623\u0646 \u0627\u0644\u0631\u0628\u062D \u0641\u064A \u0627\u0644\u0632\u0645\u0646 \u0627\u0644\u0630\u064A \u064A\u0645\u0646\u062D\u0647 \u0646\u0638\u0627\u0645 \u0645\u062A\u0639\u062F\u062F \u0627\u0644\u0645\u0639\u0627\u0644\u062C\u0627\u062A \u064A\u062A\u0639\u0644\u0642 \u0628\u0640 : \n* \u0639\u062F\u062F \u0627\u0644\u0645\u0639\u0627\u0644\u062C\u0627\u062A N \n* \u0627\u0644\u062C\u0632\u0621 \u0627\u0644\u0642\u0627\u0628\u0644 \u0644\u0644\u0645\u0648\u0627\u0632\u0627\u0629 s \u0641\u064A \u0647\u0630\u0627 \u0627\u0644\u0645\u0633\u062A\u0648\u0649 \u064A\u062A\u0645 \u0625\u0647\u0645\u0627\u0644 \u0627\u0644\u0639\u0645\u0644 \u0627\u0644\u0645\u062A\u0632\u0627\u064A\u062F \u0627\u0644\u0646\u0627\u062A\u062C \u0639\u0646 \u0639\u0645\u0644\u064A\u0629 \u0627\u0644\u0645\u0648\u0627\u0632\u0627\u0629. \u0648\u0635\u064A\u063A\u0629 \u0627\u0644\u0642\u0627\u0646\u0648\u0646 \u0647\u064A : \u0625\u0630\u0627 \u0643\u0627\u0646 N \u064A\u0624\u0648\u0644 \u0625\u0644\u0649 \u0645\u0627\u0644\u0627 \u0646\u0647\u0627\u064A\u0629\u060C \u0646\u062D\u0635\u0644 \u0639\u0644\u0649 : \n*"@ar . "1123971320"^^ . . "Amdahl\u016Fv z\u00E1kon je pravidlo pou\u017E\u00EDvan\u00E9 v informatice k vyj\u00E1d\u0159en\u00ED maxim\u00E1ln\u00EDho p\u0159edpokl\u00E1dan\u00E9ho zlep\u0161en\u00ED syst\u00E9mu pot\u00E9, co je vylep\u0161ena pouze n\u011Bkter\u00E1 z jeho \u010D\u00E1st\u00ED. Vyu\u017E\u00EDv\u00E1 se nap\u0159. u v\u00EDceprocesorov\u00FDch syst\u00E9m\u016F k p\u0159edpov\u011Bzen\u00ED teoretick\u00E9ho maxim\u00E1ln\u00EDho zrychlen\u00ED p\u0159i p\u0159id\u00E1v\u00E1n\u00ED dal\u0161\u00EDch procesor\u016F. Z\u00E1kon je pojmenov\u00E1n po americk\u00E9m po\u010D\u00EDta\u010Dov\u00E9m architektovi . Poprv\u00E9 byl p\u0159edstaven na konferenci v roce 1967."@cs . "Amdahl's law"@en . . . "La llei d'Amdahl, anomenada aix\u00ED en honor de l'enginyer d'ordinadors Gen Amdahl, s'utilitza per trobar la m\u00E0xima millora esperada del sistema total quan solament part del sistema \u00E9s millorada.Sovint s'utilitza un c\u00E0lcul paral\u00B7lel per predir la m\u00E0xima acceleraci\u00F3 te\u00F2rica utilitzant m\u00FAltiples processadors. La llei d'Amdahl pot ser interpretada m\u00E9s t\u00E8cnicament, per\u00F2 en termes simples significa que \u00E9s l'algorisme qui decideix l'acceleraci\u00F3, no el nombre de processadors. Finalment, arribes a un lloc on no pots paral\u00B7lelitzar m\u00E9s l'algorisme. Aquesta llei \u00E9s una demostraci\u00F3 de la llei de disminuci\u00F3 de tornades: mentre un podria accelerar part de l'ordinador unes cent vegades o m\u00E9s, si la millora solament afecta el 12% del total de la tasca, la millor acceleraci\u00F3 possiblement seria vegades m\u00E9s r\u00E0pida. M\u00E9s t\u00E8cnicament, la llei es veu afectada amb l'acceleraci\u00F3 assolible des d'una millora al c\u00E0lcul que influeix una proporci\u00F3 P d'aquell c\u00E0lcul on la millora t\u00E9 una acceleraci\u00F3 de S. (Per exemple, si una millora pot accelerar una porci\u00F3 del 30% del total d'un c\u00E0lcul, P seria 0.3; si la millora fa 2 cops m\u00E9s r\u00E0pida la porci\u00F3 afectada, S seria 2). La llei Amdahl declara que l'acceleraci\u00F3 total d'aplicar la millora ser\u00E0: . Per veure com va ser derivada aquesta f\u00F3rmula, assumeix que el temps transcorregut del c\u00E0lcul vell era 1, per alguna unitat de temps. El temps transcorregut del nou c\u00E0lcul ser\u00E0 la duraci\u00F3 de temps presa de la fracci\u00F3 no millorada (la qual \u00E9s 1 \u2013 P) m\u00E9s la duraci\u00F3 de temps pres de la fracci\u00F3 millorada.La duraci\u00F3 de temps per a la part millorada del c\u00E0lcul \u00E9s la duraci\u00F3 de l'anterior temps transcorregut de la part millorada dividit per l'acceleraci\u00F3, fent la duraci\u00F3 de temps de la part millorada P/S. L'acceleraci\u00F3 final \u00E9s calculada per la divisi\u00F3 de l'antic temps transcorregut entre el nou temps, que \u00E9s el que calcula la f\u00F3rmula de dalt. Aqu\u00ED tenim un altre exemple. Donem una tasca que es divideix en quatre parts: P1 = 11 o \\d1%, P2 = 18 o \\d8%, P3 = 23 o \\d3%, P4 = 48 o \\d8%, lo qual suma 100%.Llavors diem que P1 no s'accelera, aix\u00ED S1 = 1 o \\d00%, P2 s'accelera per 5x, aix\u00ED S2 = 5 o \\d00%, P3 s'accelera per 20x \u00F3 2000%, i P4 s'accelera 1.6x \u00F3 160%. Utilitzant la f\u00F3rmula ,trobem que el temps transcorregut \u00E9s \u00F3 una mica menys que \u00BD del temps original transcorregut que es coneix com a 1. Per tant, l'est\u00EDmul total de velocitat \u00E9s: \u00F3 un mica m\u00E9s que el doble de l'acceleraci\u00F3 original utilitzant la f\u00F3rmula .Cal fixar-se en com l'acceleraci\u00F3 de 20x i 5x no t\u00E9 gaire efecte sobre l'augment total d'acceleraci\u00F3 i la disminuci\u00F3 del temps total transcorregut quan m\u00E9s de la meitat de la tasca \u00E9s accelerada nom\u00E9s 1x (\u00E9s a dir, no s'accelera) o 1.6x."@ca . . . "Llei d'Amdahl"@ca . . . "En architecture informatique, la loi d'Amdahl donne l'acc\u00E9l\u00E9ration th\u00E9orique en latence de l'ex\u00E9cution d'une t\u00E2che \u00E0 charge d'ex\u00E9cution constante que l'on peut attendre d'un syst\u00E8me dont on am\u00E9liore les ressources. Elle est \u00E9nonc\u00E9e par l'informaticien Gene Amdahl \u00E0 l'AFIPS Spring Joint Computer Conference en 1967. La loi d'Amdahl peut \u00EAtre formul\u00E9e de la fa\u00E7on suivante : o\u00F9 \n* Slatence est l'acc\u00E9l\u00E9ration th\u00E9orique en latence de l'ex\u00E9cution de toute la t\u00E2che ; \n* s est le nombre de fils d'ex\u00E9cutions (threads) utilis\u00E9s pour ex\u00E9cuter la t\u00E2che \n* p est le pourcentage du temps d'ex\u00E9cution de toute la t\u00E2che concernant la partie b\u00E9n\u00E9ficiant de l'am\u00E9lioration des ressources du syst\u00E8me avant l'am\u00E9lioration. De plus, montrent que l'acc\u00E9l\u00E9ration th\u00E9orique de l'ex\u00E9cution de toute la t\u00E2che augmente avec l'am\u00E9lioration des ressources du syst\u00E8me et que, quelle que soit l'am\u00E9lioration, l'acc\u00E9l\u00E9ration th\u00E9orique est toujours limit\u00E9e par la partie de la t\u00E2che qui ne peut tirer profit de l'am\u00E9lioration. La loi d'Amdahl est souvent utilis\u00E9e en calcul parall\u00E8le pour pr\u00E9dire l'acc\u00E9l\u00E9ration th\u00E9orique lors de l'utilisation de plusieurs processeurs. Par exemple, si un programme a besoin de 20 heures d'ex\u00E9cution sur un processeur uni-c\u0153ur et qu'une partie du programme qui requiert une heure d'ex\u00E9cution ne peut pas \u00EAtre parall\u00E9lis\u00E9e, m\u00EAme si les 19 heures (p = 95 %) d'ex\u00E9cution restantes peuvent \u00EAtre parall\u00E9lis\u00E9es, quel que soit le nombre de processeurs utilis\u00E9s pour l'ex\u00E9cution parall\u00E8le du programme, le temps d'ex\u00E9cution minimal ne pourra passer sous cette heure critique. Ainsi, l'acc\u00E9l\u00E9ration th\u00E9orique est limit\u00E9e au plus \u00E0 20 (1/(1 \u2212 p) = 20). On en d\u00E9duit deux r\u00E8gles : premi\u00E8rement, lors de l'\u00E9criture d'un programme parall\u00E8le, il faut limiter autant que possible la partie s\u00E9rielle ; deuxi\u00E8mement, un ordinateur parall\u00E8le doit \u00EAtre un excellent ordinateur s\u00E9riel pour traiter le plus rapidement possible la partie s\u00E9rielle."@fr . . . "\uC554\uB2EC\uC758 \uBC95\uCE59"@ko . . . . "In computer architecture, Amdahl's law (or Amdahl's argument) is a formula which gives the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved. It states that \"the overall performance improvement gained by optimizing a single part of a system is limited by the fraction of time that the improved part is actually used\". It is named after computer scientist Gene Amdahl, and was presented at the American Federation of Information Processing Societies (AFIPS) Spring Joint Computer Conference in 1967. Amdahl's law is often used in parallel computing to predict the theoretical speedup when using multiple processors. For example, if a program needs 20 hours to complete using a single thread, but a one-hour portion of the program cannot be parallelized, therefore only the remaining 19 hours' (p = 0.95) execution time can be parallelized, then regardless of how many threads are devoted to a parallelized execution of this program, the minimum execution time cannot be less than one hour. Hence, the theoretical speedup is limited to at most 20 times the single thread performance, ."@en . "2323"^^ . . . . . "A lei de Amdahl, tamb\u00E9m conhecida como argumento de Amdahl, \u00E9 usada para encontrar a m\u00E1xima melhora esperada para um sistema em geral quando apenas uma \u00FAnica parte dele \u00E9 melhorada. Isto \u00E9 frequentemente usado em computa\u00E7\u00E3o paralela para prever o m\u00E1ximo speedup te\u00F3rico usando m\u00FAltiplos processadores. A lei possui o nome do Arquiteto computacional Gene Amdahl, e foi apresentada a AFIPS na Confer\u00EAncia Conjunta de Inform\u00E1tica na primavera de 1967. O speedup de um programa usando m\u00FAltiplos processadores em computa\u00E7\u00E3o paralela \u00E9 limitado pelo tempo necess\u00E1rio para a fra\u00E7\u00E3o sequencial de um programa. Por exemplo, se o programa precisa de 20 horas usando um \u00FAnico n\u00FAcleo de processamento, e a parte espec\u00EDfica de um programa que demora uma hora para executar n\u00E3o pode ser paralelizado, enquanto as 19 horas restantes (95%) do tempo da execu\u00E7\u00E3o pode ser paralelizado, independente de quantos processadores s\u00E3o dedicados a execu\u00E7\u00E3o paralela deste programa, o tempo de execu\u00E7\u00E3o m\u00EDnima n\u00E3o pode ser menor que aquela cr\u00EDtica uma hora. Por isso o aumento de velocidade \u00E9 limitado em no m\u00E1ximo 20x."@pt . . . . . . . . . "Loi d'Amdahl"@fr . . "\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u6CD5\u5247\uFF08\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u307B\u3046\u305D\u304F\u3001\u82F1\u8A9E: Amdahl's law\uFF09\u306F\u3001\u3042\u308B\u8A08\u7B97\u6A5F\u30B7\u30B9\u30C6\u30E0\u3068\u305D\u306E\u5BFE\u8C61\u3068\u3059\u308B\u8A08\u7B97\u306B\u3064\u3044\u3066\u306E\u30E2\u30C7\u30EB\u306B\u304A\u3044\u3066\u3001\u305D\u306E\u8A08\u7B97\u6A5F\u306E\u4E26\u5217\u5EA6\u3092\u4E0A\u3052\u305F\u5834\u5408\u306B\u3001\u4E26\u5217\u5316\u3067\u304D\u306A\u3044\u90E8\u5206\u306E\u5B58\u5728\u3001\u7279\u306B\u305D\u306E\u5272\u5408\u304C\u300C\u30DC\u30C8\u30EB\u30CD\u30C3\u30AF\u300D\u3068\u306A\u308B\u3053\u3068\u3092\u793A\u3057\u305F\u6CD5\u5247\u3067\u3042\u308B\u3002\u30B3\u30F3\u30D4\u30E5\u30FC\u30BF\u30FB\u30A2\u30FC\u30AD\u30C6\u30AF\u30C8\u306E\u30B8\u30FC\u30F3\u30FB\u30A2\u30E0\u30C0\u30FC\u30EB\u304C\u4E3B\u5F35\u3057\u305F\u3082\u306E\u3067\u3042\u308A\u3001\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u4E3B\u5F35\uFF08\u30A2\u30E0\u30C0\u30FC\u30EB\u306E\u3057\u3085\u3061\u3087\u3046\u3001\u82F1\u8A9E: Amdahl's argument\uFF09\u3068\u3044\u3046\u547C\u79F0\u3082\u3042\u308B\u3002 \u8907\u6570\u306E\u30D7\u30ED\u30BB\u30C3\u30B5\u3092\u4F7F\u3044\u4E26\u5217\u8A08\u7B97\u306B\u3088\u3063\u3066\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u9AD8\u901F\u5316\u3092\u56F3\u308B\u5834\u5408\u3001\u305D\u306E\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u4E2D\u3067\u9010\u6B21\u7684\u306B\u5B9F\u884C\u3057\u306A\u3051\u308C\u3070\u306A\u3089\u306A\u3044\u90E8\u5206\u306E\u6642\u9593\u306B\u3088\u3063\u3066\u3001\u9AD8\u901F\u5316\u304C\u5236\u9650\u3055\u308C\u308B\u3002\u4F8B\u3048\u3070\u30011\u30D7\u30ED\u30BB\u30C3\u30B5\u3067\u306F20\u6642\u9593\u304B\u304B\u308B\u554F\u984C\u304C\u3042\u308A\u3001\u305D\u306E\u30D7\u30ED\u30B0\u30E9\u30E0\u306E\u3046\u3061\u3001\u5408\u8A08\u30671\u6642\u9593\u5206\u304C\u4E26\u5217\u51E6\u7406\u3067\u304D\u306A\u3044\u3068\u3059\u308B\u3002\u3053\u306E\u5834\u5408\u300119\u6642\u9593\u5206\uFF0895%\uFF09\u306F\u4E26\u5217\u51E6\u7406\u3067\u304D\u308B\u304C\u3001\u3069\u308C\u3060\u3051\u30D7\u30ED\u30BB\u30C3\u30B5\u3092\u8FFD\u52A0\u3057\u305F\u3068\u3057\u3066\u3082\u3001\u6700\u5C0F\u5B9F\u884C\u6642\u9593\u306F\u4E26\u5217\u51E6\u7406\u3067\u304D\u306A\u3044\u90E8\u5206\u306B\u304B\u304B\u308B1\u6642\u9593\uFF085%\uFF09\u3088\u308A\u77ED\u304F\u306A\u3089\u306A\u3044\u3002"@ja . . "Prawo Amdahla"@pl . . "\u963F\u59C6\u9054\u723E\u5B9A\u5F8B\uFF08\u82F1\u8A9E\uFF1AAmdahl's law\uFF0CAmdahl's argument\uFF09\uFF0C\u4E00\u500B\u8A08\u7B97\u6A5F\u79D1\u5B78\u754C\u7684\u7D93\u9A57\u6CD5\u5247\uFF0C\u56E0\u5409\u6069\u00B7\u963F\u59C6\u9054\u723E\u800C\u5F97\u540D\u3002\u5B83\u4EE3\u8868\u4E86\u8655\u7406\u5668\u5E76\u884C\u904B\u7B97\u4E4B\u5F8C\u6548\u7387\u63D0\u5347\u7684\u80FD\u529B\u3002"@zh . .