Real_time_and_Multimedia_1b TS-Linux   1. Assume that you ar…

Real_time_and_Multimedia_1b TS-Linux   1. Assume that you are playing a game (G) on a TS-Linux OS. The game uses ONE-SHOT timer with an overshoot parameter of To. The timer event goes off at time 0. Assume the following: When the timer goes off, the kernel has just started a critical section of duration Tk. For taking the necessary gaming action for the timer event, the video game application (G) has a processing time of Tg and priority P1. In addition to Tg, the application will need to make a blocking call to a Window Manager process (W) has a processing time of Tw and priority P3. When the timer goes off, the scheduling queue is empty. The priorities are ordered as P1 > P2 > P3 > P4 > …. With P1 being the highest priority. There are no periodic timers in the system. Duration of the scheduling time and interrupt handing time are negligible. Note that the given image is simply for your reference, and that the time Th has nothing to do with the solution. Only use the variables given in the text in your solutions.   (b) [2 points] In the middle of W’s execution, another application process (S) whose duration is Ts and priority P2 becomes runnable. Does this change your calculation in the previous part of the question?

Internet_Scale_Computing_1a Giant-Scale Services   1. You ar…

Internet_Scale_Computing_1a Giant-Scale Services   1. You are building a planetary store, where:  The key is a unique sensor ID for each sensor deployed across the world. The value is information collected by the sensor such as environmental conditions (temperature, humidity, pollution levels), industrial data (machine status, output), and more. Your design aims to provide high availability and fast access time to process real-time queries to the sensor data store.   You have 5 data centers, each with an identical replica of the store.  Each data center has 100,000 servers.  The store is partitioned into 10,000 equal shards and stored on 10,000 servers .  Each shard is replicated in 10 servers.  You intend to provide “full harvest” for each query and fully exploit the available parallelism for processing each query.  A server assigned to a query is dedicated to that query for the duration of the query processing.   (a) [3 points] Assuming no failures, how many simultaneous queries can you process in each data center? Justify your answer.