▁provided . ▁The ▁inclusion ▁of ▁the ▁suppress ed ▁information ▁is , ▁in ▁fact , ▁gu ided ▁by ▁the ▁proof ▁of ▁a ▁sched uling ▁theorem ▁due ▁to ▁Br ent ▁, ▁which ▁is ▁explained ▁later ▁in ▁this ▁article . ▁The ▁W T ▁framework ▁is ▁useful ▁since ▁while ▁it ▁can ▁greatly ▁simplify ▁the ▁initial ▁description ▁of ▁a ▁parallel ▁algorithm , ▁inserting ▁the ▁details ▁suppress ed ▁by ▁that ▁initial ▁description ▁is ▁often ▁not ▁very ▁difficult . ▁For ▁example , ▁the ▁W T ▁framework ▁was ▁adopted ▁as ▁the ▁basic ▁presentation ▁framework ▁in ▁the ▁parallel ▁algorithms ▁books ▁( for ▁the ▁Par allel ▁random - access ▁machine ▁P RAM ▁model ) ▁▁ ▁and ▁ ▁, ▁ ▁as ▁well ▁as ▁in ▁the ▁class ▁notes ▁ ▁. ▁The ▁over view ▁below ▁explains ▁how ▁the ▁W T ▁framework ▁can ▁be ▁used ▁for ▁analyz ing ▁more ▁general ▁parallel ▁algorithms , ▁even ▁when ▁their ▁description ▁is ▁not ▁available ▁within ▁the ▁W T ▁framework . ▁ ▁Over view ▁Suppose ▁comput ations ▁are ▁executed ▁on ▁a ▁machine ▁that ▁has ▁ ▁process ors . ▁Let ▁ ▁denote ▁the ▁time ▁that ▁exp ires ▁between ▁the ▁start ▁of ▁the ▁computation ▁and ▁its ▁end . ▁Analysis ▁of ▁the ▁computation ' s ▁running ▁time ▁focus es ▁on ▁the ▁following ▁not ions : ▁▁ ▁The ▁work ▁of ▁a ▁computation ▁executed ▁by ▁ ▁process ors ▁is ▁the ▁total ▁number ▁of ▁primitive ▁operations ▁that ▁the ▁process ors ▁perform . ▁Ign oring ▁communication ▁overhead ▁from ▁synchron izing ▁the ▁process ors , ▁this ▁is ▁equal ▁to ▁the ▁time ▁used ▁to ▁run ▁the ▁computation ▁on ▁a ▁single ▁processor