Directed Acyclic Graph (From The Free On-line Dictionary of Computing (19 Sep 2003))
basically something like pd's DSP-tree:
all connected GemObject form a graph
this graph is compiled into a DAG through the means of pd's messaging system
pros:
faster (?)
see GemThreads and RenderTrigger
cons:
hinders the building of dynamic graphs
for a discussion go to RenderTrigger