|
|
 |
|
|
|
|
[292] A. K. Uht. An efficient hardware algorithm to extract concurrency from general-purpose code. In Proceedings of the 19th Annual Hawaii International Conference on System Sciences, pages 4150, 1986. |
|
|
|
|
|
|
|
|
[293] S. Ungar. Asynchronous Sequential Switching Circuits. Wiley Interscience, New York, 1969. |
|
|
|
|
|
|
|
|
[294] S. Ungar and C. Tan. Clocking schemes for high-speed digital systems. IEEE Transactions on Computers, C-35(10):880895, October 1986. |
|
|
|
|
|
|
|
|
[295] M. Upton, T. Huff, T. Mudge, and R. Brown. Resource allocation in a high clock rate microprocessor. In Proceedings of the Conference on Architectural Support for Programming Languages and Operating Systems, pages 98109, October 1994. |
|
|
|
|
|
|
|
|
[296] A. J. van de Goor. Computer Architecture and Design. Addison-Wesley, 1989. |
|
|
|
|
|
|
|
|
[297] K. Wagner. A survey of clock distribution techniques on high speed computer systems. Technical Note CSL-TN-86-309, Stanford University, December 1986. |
|
|
|
|
|
|
|
|
[298] J. Wakerly. Microcomputer Architecture and Programming. Wiley, New York, 1989. |
|
|
|
|
|
|
|
|
[299] D. M. H. Walker. Yield Simulation for Integrated Circuits. International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, 1987. |
|
|
|
|
|
|
|
|
[300] S. Waser and M. Flynn. Introduction to Arithmetic for Digital Systems Designers. Holt, Rinehart and Winston, New York, 1982. |
|
|
|
|
|
|
|
|
[301] W. J. Watson. The TI ASC: A highly modular and flexible super computer architecture. In Proceedings of AFIPS, volume 41, part 1, pages 221228, 1972. |
|
|
|
|
|
|
|
|
[302] R. Wedig. Detection of Concurrency in Directly Executed Language Instruction Streams. PhD thesis, Stanford University, June 1982. |
|
|
|
|
|
|
|
|
[303] S. Weiss and J. E. Smith. Instruction issue logic in pipelined supercomputers. In Proceedings of the 11th Annual Symposium on Computer Architecture, pages 110118, June 1984. |
|
|
|
|
|
|
|
|
[304] C. Wiecek. A case study of VAX-11 instruction set usage for compiler execution. In Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems, pages 177184, New York, March 1982. ACM. |
|
|
|
|
|
|
|
|
[305] M. V. Wilkes. The best way to design an automatic calculating machine. In Manchester University Computer Inaugural Conference, Ferranti, Ltd., London, 1951. |
|
|
|
|
|
|
|
|
[306] M. V. Wilkes. Slave memories and dynamic storage allocation. IEEE Transactions on Electronic Computers, EC-14(2):270271, February 1965. |
|
|
|
|
|
|
|
|
[307] B. Wilkinson. Comments on "Design and analysis of arbitration protocols". IEEE Transactions on Computers, 41(3):348351, March 1992. |
|
|
|
|
|
|
|
|
[308] M. Wolfe. Optimizing Compilers for Supercomputers. PhD thesis, MIT, 1982. |
|
|
|
|
|
|
|
|
[309] D. Wong, G. De Micheli, and M. Flynn. Designing high-performance digital circuits using wave pipelining: Algorithms and practical experiences. IEEE Transactions on Computer Aided Design of Integrated Circuits, 12(1):2546, January 1993. |
|
|
|
|
|
|
|
|
[310] D. Wong, G. De Micheli, and M. Flynn. Designing high-performance digital circuits using wave pipelining. In Proceedings of VLSI '89, pages 241252, Munich, Germany, August 1989. |
|
|
|
|
|