1The M.A.Sc. program is a joint program with Carleton University, administered by OCIECE Embedded system designers face multiple challenges in fulfilling the runtime require-ments of programs. Effective scheduling of programs is required to extract as much parallelism as possible. These scheduling algorithms must also improve speedup after instruction-set extensions have occurred. Scheduling of dynamic code at run time is made more difficult when the static components of the program are scheduled ineffi-ciently. This research aims to optimize a program’s static code at compile time. This is achieved with four algorithms designed to schedule code at the task and instruction level. Additionally, the algorithms improve scheduling using instruction set extended code on symmetrical homogeneous multiprocessor systems. Using these algorithms, we achieve speedups up to 3.86X over sequential execution for a 4-issue 2-processor system, and show better performance than recent heuristic techniques for small pro-grams. Finally, the algorithms generate speedup values for a 64-point FFT that are similar to the test runs. ii