▁the ▁code ▁to ▁be ▁run ▁in ▁parallel . ▁ ▁The ▁second ▁example , ▁shows ▁the ▁code ▁parallel ized ▁and ▁the ▁priv at ization ▁technique ▁used ▁to ▁remove ▁the ▁dependence . ▁ ▁// Sequ ential ▁Code : ▁// Ass ume ▁the ▁variables ▁have ▁already ▁been ▁initialized ▁▁ ▁do ▁i ▁= ▁ 1 0 , ▁N ▁- ▁ 1 ▁▁▁▁▁▁▁ ▁x ▁= ▁( b ( i ) ▁+ ▁c ( i )) / 2 ▁▁▁▁▁▁▁ ▁b ( i ) ▁= ▁a ( i ▁+ ▁ 1 ) ▁+ ▁x ▁▁ ▁end do ▁For ▁each ▁iteration ▁of ▁the ▁loop ▁above , ▁x ▁is ▁assigned ▁and ▁then ▁read . ▁ ▁Because ▁x ▁is ▁only ▁a ▁single ▁variable , ▁the ▁loop ▁cannot ▁be ▁executed ▁in ▁parallel ▁because ▁it ▁would ▁constantly ▁be ▁over written ▁and ▁b ( i ) ▁would ▁not ▁always ▁be ▁assigned ▁the ▁correct ▁value . ▁ ▁// Par allel ▁Code : ▁// Ass ume ▁the ▁variables ▁have ▁already ▁been ▁initialized ▁▁ ▁! $ omp ▁parallel ▁do ▁shared ( a , ▁b ) ▁private ( x ) ▁▁ ▁do ▁i ▁= ▁ 1 0 , ▁N ▁- ▁ 1 ▁▁▁▁▁▁▁ ▁x ▁= ▁( b ( i ) ▁+ ▁c ( i )) / 2 ▁▁▁▁▁▁▁ ▁b ( i ) ▁= ▁a ( i ▁+ ▁ 1 ) ▁+ ▁x ▁▁ ▁end do ▁ ▁For ▁the ▁parallel ▁code , ▁x ▁is ▁declared ▁as ▁private ▁which ▁means ▁each ▁thread ▁gets ▁its ▁own ▁copy ▁and ▁the ▁dependence ▁is ▁therefore ▁removed . ▁ ▁Com parison ▁with ▁Other ▁Te chni ques ▁