11.4. Exercises
| Exercise 11.1 | Improve the compute server such that it enforces a strict limit on the time a task can be computed. After that time, the task is aborted and returned to the space. |
| Exercise 11.2 | How intractable is the brute force technique of breaking eight character UNIX passwords (how long would it take)? |
| Exercise 11.3 | Experiment with the triespertask parameter and its effect on the running time of the crypt application. Make a graph of the words computed per second as you vary the triespertask. How does “tries per task” affect the computation/communication ratio? |
| Exercise 11.4 | Design and implement an adaptive scheme for watermark values—as workers are added and removed from the compute server, alter the low and high watermarks to ... |
Get JavaSpaces™ Principles, Patterns, and Practice now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
