Now showing items 1-2 of 2

  • Constraints on parallelism beyond 10 instructions per cycle

    Cleary, John G.; Littin, Richard H.; McWha, David J.A.; Pearson, Murray W. (Computer Science, University of Waikato, 1997-11)
    The problem of extracting Instruction Level Parallelism at levels of 10 instructions per clock and higher is considered. Two different architectures which use speculation on memory accesses to achieve this level of performance ...
  • Timestamp representations for virtual sequences

    Cleary, John G.; McWha, David J.A.; Murray, Pearson (IEEE Computer Society Press, 1996-11)
    The problem of executing sequential programs optimistically using the Time Warp algorithm is considered. It is shown how to do this, by first mapping the sequential execution to a control tree and then assigning timestamps ...

David J.A. McWha has 4 co-authors in Research Commons.