Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Efficient execution of parallel programs using partial strict triggering of program graph nodes
    Ojsteršek, Milan ; Žumer, Viljem ; Pipan, Ljubo, 1939-
    Almost all coarse grained program graph nodes don't need all of their input operands at the beginning of their execution. Thereafter they can be scheduled a bit earlier. This type of program graph ... nodes triggering is called partial strict triggering. The missing operands will be requested lated during the execution. Coarse grained program graph nodes send their output operand to all successors, as soon as they produce them. Successors of coarse grained program graph nodes will be scheduled earlier too, because they will receive their input operands sooner. An evaluation of improved CPM, VL and DSH scheduling algorithms is done in this paper. We have improved them with partial strict triggering of coarse grained program graph nodes.
    Vir: Proceedings of the 1997 International conference on parallel and distributed systems, December 10-13, 1997, Seoul, Korea (Str. 453-459)
    Vrsta gradiva - prispevek na konferenci
    Leto - 1997
    Jezik - angleški
    COBISS.SI-ID - 3362582

Vnos na polico