This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 21.4 What are three advantages o± dynamic (shared) linkage o± libraries compared to static linkage? What are two cases where static linkage is pre±erable? 21.5 Compare the use o± networking sockets with the use o± shared memory as a mechanism ±or communicating data between processes on a single computer. What are the advantages o± each method? When might each be pre±erred? 21.6 UNIX systems used to use disk-layout optimizations based on the ro-tation position o± disk data, but modern implementations, including Linux, simply optimize ±or sequential data access. Why do they do so? O± what hardware characteristics does sequential access take advan-tage? Why is rotational optimization no longer so use±ul? 45...
View Full Document
- Winter '09
- Operating Systems, Linux kernel, Dynamically loadable kernel