Evaluation of static scheduling algorithms improved with partial strict triggering of program graph nodes
Ojsteršek, Milan ...
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 scheduleda bit earlier. This type of program graph ...nodes triggering is called partial strict triggering. The missing operands will be requested later duringthe execution. Coarse grained program graph nodes send their output operands 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 (with partial strict traggering of coarse grained program graph nodes) CPM, VL and DSH scheduling algorithms is presented in this paper.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
