Duba wurin da ke ƙasa sannan ka amsa tambayar daga baya a cikin harshe ɗaya kamar yadda wurin yake:  Passage: Optimally, da speedup daga parallelization zai zama mikakke <unk> ninka yawan aiki abubuwa ya kamata rabin gudu lokaci, da kuma ninka shi a karo na biyu ya kamata sake rabin gudu lokaci. Koyaya, ƙananan algorithms masu daidaituwa suna cimma saurin sauri. Mafi yawansu suna da kusan-linear hanzari ga ƙananan lambobin sarrafa abubuwa, wanda flatens fitar a cikin wani m darajar ga manyan lambobin sarrafa abubuwa.  Tambaya: Abin da di layi daya algorithms sau da yawa kasa cimma?
mafi kyau duka hanzari