
4.3 Languages and Scheduling 241
scratch pad is managed in software, the allocation algorithm must take multi-
tasking into account. Panda et al. propose dividing the scratch pad into segments
and assigning each task its own segment. This approach reduces run-time over-
head for scratch pad management but results in underutilization of part of the
scratch pad. When the programs are prioritized, they weight the total conflict
fetch (TCF) by the task priority (see Section 3.3.4), with higher-priority tasks
given more weight. (Note that this is the inverse of the convention in real-time
systems, in which the highest priority task is given a priority of ...