LRPC and Scheduling The context for this question is the sam…
LRPC and Scheduling The context for this question is the same as the previous question. A server provides the following procedure via LRPC uint64_t sum_array(const uint64_t *arr, size_t len) { uint64_t sum = 0; for (size_t i = 0; i < len; ++i) { sum += arr; } return sum;} The kernel will create an A-stack and map that into the client and server address spaces. Assume the following: (uint64_t is 8 bytes and size_t is 4 bytes) There is programming language support for the server to access the A-stack directly. If the server wishes to entertain simultaneous calls from multiple clients, how big should the A-stack be?