Writing Efficient ProgramsClassic on practical methods of optimizing programs: This book gives practical advice on improving the efficiency (optimizing) programs and the limits there of. While showing how to trade off speed for space or vice-versa, the author points out the limits that can be expected to gain. His list of techniques is a collection of practical approaches rather than theoretical possibilities. At 158 pages (not counting index) this book is eminently readable, accessable and useful. Clearly written and well organized this is a book to keep on your shelf for when a program needs improving. It is also a book to read before a program as a reminder not to make things complicated with optimization that aren't needed. |
From inside the book
Results 1-3 of 51
Page 49
... instance , the words " time " , " space " , and " program " each account for more than one percent of the words in this chapter , but occur infre- quently in most text ) . How would you augment the caching scheme described earlier to ...
... instance , the words " time " , " space " , and " program " each account for more than one percent of the words in this chapter , but occur infre- quently in most text ) . How would you augment the caching scheme described earlier to ...
Page 67
... instance , in changing Fragment A2 to A3 we used strength reduction to remove a square root . In particular , we wished to compute a boolean variable telling whether a new point was closer than the best point so far . Because square ...
... instance , in changing Fragment A2 to A3 we used strength reduction to remove a square root . In particular , we wished to compute a boolean variable telling whether a new point was closer than the best point so far . Because square ...
Page 101
... instance , we saw earlier that assigning an integer value to a real variable on the Hamburg Pascal system invokes a run - time routine that requires 40 microseconds ( while a real multiplication costs only 2.8 microseconds ) ; that cost ...
... instance , we saw earlier that assigning an integer value to a real variable on the Hamburg Pascal system invokes a run - time routine that requires 40 microseconds ( while a real multiplication costs only 2.8 microseconds ) ; that cost ...
Other editions - View all
Common terms and phrases
Algebraic Identities application array ArrPtr assembly code assembly language Bell Telephone Laboratories binary search BITBLT Bob Sproull boolean variable cache chapter CloseDist Computer Science coroutines cost data structures decrease described design levels element evaluation executed Expression Rule factor faster Fibonacci FORTRAN Fragment A9 function goto Hamburg Pascal high-level language implemented increase the speed inner loop input insertion sort instance instruction integer iteration Kernighan Knuth lazy evaluation log2 Logic Rule Loop Rule loop unrolling machine code memory ment microseconds modify node optimizations Pascal Pascal compiler Pascal program percent performance Plauger Precomputed Private communication problem procedure call Procedure Rule Quicksort real numbers recursive reduced the run routine Section sentinel sequential search shown in Fragment simple space Space-For-Time Rule speedup Sproull statement storage stored subroutine system-dependent efficiency techniques ThisDist Time-For-Space Rule transformations usually vector words writing efficient code