▁hard ▁( very ▁often ▁impossible ) ▁because ▁comp ilers ▁cannot ▁figure ▁out ▁which ▁way ▁a ▁conditional ▁will ▁go ▁or ▁cannot ▁optimize ▁across ▁a ▁function ▁call . ▁ ▁Trans parent ▁data flow ▁semantics ▁of ▁B M DF M ▁A ▁novel ▁B M DF M ▁( Binary ▁Mod ular ▁Data - Flow ▁Machine ) ▁technology ▁mainly ▁uses ▁dynamic ▁sched uling ▁to ▁explo it ▁parallel ism ▁of ▁an ▁application ▁program , ▁thus , ▁B M DF M ▁avoid s ▁mentioned ▁dis adv antages ▁of ▁the ▁compile - time ▁methods . ▁▁ ▁B M DF M ▁is ▁a ▁parallel ▁programming ▁environment ▁for ▁multi - core ▁S MP ▁that ▁provides : ▁Con vent ional ▁programming ▁parad ig m ▁requiring ▁no ▁direct ives ▁for ▁parallel ▁execution . ▁Trans parent ▁( imp licit ) ▁explo itation ▁of ▁parallel ism ▁in ▁a ▁natural ▁and ▁load ▁bal anced ▁manner ▁using ▁all ▁available ▁multi - core ▁process ors ▁in ▁the ▁system ▁automatically . ▁ ▁B M DF M ▁comb ines ▁the ▁advantages ▁of ▁known ▁architect ural ▁principles ▁into ▁a ▁single ▁hy brid ▁architecture ▁that ▁is ▁able ▁to ▁explo it ▁implicit ▁parallel ism ▁of ▁the ▁applications ▁having ▁neg lig ible ▁dynamic ▁sched uling ▁overhead ▁and ▁no ▁bott l ene cks . ▁Main ly , ▁the ▁basic ▁data flow ▁principle ▁is ▁used . ▁The ▁data flow ▁principle ▁says : ▁" An ▁instruction ▁or ▁a ▁function ▁can ▁be ▁executed ▁as ▁soon ▁as ▁all ▁its ▁arguments ▁are ▁ready . ▁A ▁data flow ▁machine ▁man ages ▁the ▁tags ▁for ▁every ▁piece ▁of ▁data ▁at ▁runtime . ▁Data ▁is