Antilazyness - When Precalculation and Prefetching Counts
If you can look into the seeds of time, and say which grain will grow and which will not, speak then unto me. --Shakespeare
If only computers were smart enough to precompute what information you could possibly ask for, and then store it all. With today's memory costs decreasing this might even be possible.
Possible places to predict where you can read info:
If only computers were smart enough to precompute what information you could possibly ask for, and then store it all. With today's memory costs decreasing this might even be possible.
Possible places to predict where you can read info:
- Internet: you can predownload files before they are needed. However that costs extra money ^^
- Database: databases can be recorded (i.e. store only the functions applied to database this is O(1) insertion time, O(n) lookup time). In the spare time, it might consolidate these logs into the actual database file
- Clocks: have a clock file that the clock program reads off (i.e. the system writes the time to a "file", all programs that need access to the time merely read off that file - file probably should belong in ram). In spare time, make a list of times ^^
- Lazy operations: any operation that is put on lazy (i.e. you do not evaluate the function until you apply a viewer on the information) will work in spare time.
0 Comments:
Post a Comment
Subscribe to Post Comments [Atom]
<< Home