66 A Silberschatz and P Galvin Operating Systems Concepts Fifth Edition John

66 a silberschatz and p galvin operating systems

This preview shows page 763 - 766 out of 808 pages.

[66] A. Silberschatz and P. Galvin. Operating Systems Concepts, Fifth Edition . John Wiley & Sons, 1998. [67] R. Skeel. Roundoff error and the Patriot missile. SIAM News , 25(4):11, July 1992. [68] A. Smith. Cache memories. ACM Computing Surveys , 14(3), September 1982. [69] E. H. Spafford. The Internet worm program: An analysis. Technical Report CSD-TR-823, Department of Computer Science, Purdue University, 1988. [70] A. Srivastava and A. Eustace. ATOM: A system for building customized program analysis tools. In Proceedings of the 1994 ACM Conference on Programming Language Design and Implementation (PLDI) , June 1994. [71] W. Stallings. Operating Systems: Internals and Design Principles, Fourth Edition . Prentice Hall, 2000. [72] W. Richard Stevens. Advanced Programming in the Unix Environment . Addison-Wesley, 1992. [73] W. Richard Stevens. TCP/IP Illustrated: The Protocols , volume 1. Addison-Wesley, 1994. [74] W. Richard Stevens. TCP/IP Illustrated: The Implementation , volume 2. Addison-Wesley, 1995. [75] W. Richard Stevens. TCP/IP Illustrated: TCP for Transactions, HTTP, NNTP and the Unix domain protocols , volume 3. Addison-Wesley, 1996. [76] W. Richard Stevens. Unix Network Programming: Interprocess Communications, Second Edition , volume 2. Prentice-Hall, 1998. [77] W. Richard Stevens. Unix Network Programming: Networking APIs, Second Edition , volume 1. Prentice-Hall, 1998. [78] T. Stricker and T. Gross. Global address space, non-uniform bandwidth: A memory system perfor- mance characterization of parallel systems. In Proceedings of the Third International Symposium on High Performance Computer Architecture (HPCA) , pages 168–179, San Antonio, TX, February 1997. IEEE. [79] A. Tanenbaum. Modern Operating Systems, Second Edition . Prentice Hall, 2001. [80] A. Tannenbaum. Computer Networks, Third Edition . Prentice-Hall, 1996. [81] K. P. Wadleigh and I. L. Crawford. Software Optimization for High-Performance Computing: Creating Faster Applications . Prentice-Hall, 2000. [82] J. F. Wakerly. Digital Design Principles and Practices, Third Edition . Prentice-Hall, 2000.
Image of page 763
744 BIBLIOGRAPHY [83] M. V. Wilkes. Slave memories and dynamic storage allocation. IEEE Transactions on Electronic Computers , EC-14(2), April 1965. [84] P. Wilson, M. Johnstone, M. Neely, and D. Boles. Dynamic storage allocation: A survey and critical review. In International Workshop on Memory Management , Kinross, Scotland, 1995. [85] M. Wolf and M. Lam. A data locality algorithm. In Conference on Programming Language Design and Implementation (SIGPLAN) , pages 30–44, June 1991. [86] J. Wylie, M. Bigrigg, J. Strunk, G. Ganger, H. Kiliccote, and P. Khosla. Survivable information storage systems. IEEE Computer , August 2000. [87] X. Zhang, Z. Wang, N. Gloy, J. B. Chen, and M. D. Smith. System support for automatic profiling and optimization. In Proceedings of the Sixteenth ACM Symposium on Operating Systems Principles (SOSP) , pages 15–26, October 1997.
Image of page 764
Index * [C] dereference pointer operation, 103 (two’s complement multiplication), 62 (unsigned multiplication), 62 (two’s complement addition), 57 (unsigned addition), 56 -> [C] dereference and select field operation, 154 (two’s complement negation), 60 (unsigned negation), 56 & [C] address of operation, 104 \n (newline character), 2 .a static library archive file, 362 Abelian group, 56 abort, 394 accept
Image of page 765
Image of page 766

You've reached the end of your free preview.

Want to read all 808 pages?

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes