This paper investigates two techniques for instruction scheduling, dynamic and static scheduling.A decoupled access/execute architecture consists of an execution unit and a memorv unit with seoarate nroeram counters and seuarate instiuction memoges.The v&y long instruction w&d (VLIW) architecture has only one program counter and relies on the compiler to perform stat& szheduling of multiple units.To idealize the comparison the VLIW architecture considered hsd only two units.The instruction sets and execution times for the two architectures were made as nearly the same as possible.The execution times were compared and analyzed to compare the capabilities of static and dynamic instruction scheduling.Both regular and irregular programs were constructed and optimized by hand for each architecture.The experiment showed that the two methods are nearly equally powerful.The decoupled architecture performed better on subroutine calls than the VLIW architecture.It also worked better on programs which switched from memory intensive to computation intensive code.The decouoled architecture wss zenerallv better at hidinn the floating point latency.Thcregist& sharing enable; the VLIW architecture to do more load balancing which resulted in shorter initialization times, and short& loop iteration times.