Optimization: CPU Cycles
A program has two basic resources at its disposal:
In this chapter, I will demonstrate ways to make efficient use of processor time—which is to say that I’ll show you ways to make your program do the most, in the smallest amount of time, by pruning away unnecessary operations.
Processor time (i.e., CPU cycles)
KeywordsProcessor Time System Call Memory Management Exception Handling Physical Memory
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 4.Joe McGivern, Interrupt Driven PC System Design (Annabooks, 1998. ISBN: 0-929-39250-7)Google Scholar
- 5.David Blatner, The Joy of Pi (Walker & Company, 1999. ISBN: 0-8027-7562-4)Google Scholar
- 6.Richard Preston, “The Mountains of Pi,” The New Yorker, March 2, 1992Google Scholar
- 7.Richard Jones and Rafael Lins, Garbage Collection: Algorithms for Automatic Dynamic Memory Management (John Wiley & Sons, 1996. ISBN: 0-471-94148-4)Google Scholar
- 8.Bill Blunden, Memory Management: Algorithms and Implementation in C/C++ (Wordware, 2002. ISBN: 1-55622-347-1)Google Scholar
- 10.Thomas Connolly and Carolyn Begg, Database Systems: A Practical Approach (Addison-Wesley, 2001. ISBN: 0-201-70857-4)Google Scholar
- 11.Mike Ricciuti, “Lack of Interest Sinking Oracle’s Raw Iron?” CNETNews.com, January 24, 2000Google Scholar
- 12.Morten Mikael Christensen, “Methods for Handling Exceptions,” M.Sc. thesis, Odense University, 1995Google Scholar
- 14.Ted G. Lewis et al., Introduction to Parallel Computing (Prentice Hall, 1992. ISBN: 0-13-498924-4)Google Scholar
© Bill Blunden 2012