(1) Microsoft switched FAT-16 to FAT-32 in late 90\'s. Why (i.e., what was the m
ID: 3721041 • Letter: #
Question
(1) Microsoft switched FAT-16 to FAT-32 in late 90's. Why (i.e., what was the main reason)? (2) Which of the following real-time process scheduling algorithms can be used for hard real-time systems? (a) Static Table-Driven Scheduling algorithms (for determinism and responsiveness) (b) Rate Monotonic Scheduling (RMS) algorithm (for response time) c) Dynamic Planning-Based Scheduling algorithms (for response time) (d) Dynamic Best-Effort Scheduling algorithms (for response time) (3) In many real-time process scheduling algorithms, determinism and responsiveness are in a trade-off 4) Why do "directories" in many file systems need "D/F" flag (ie, why is "D/F flag" is necessary in (5) What are the four major security issues in the non-technical (human-related) vulnerabilities in relationship. Describe how they are in a trade-off relationship. most of the existing operating systems)? operating system security (mention the four major security issues)?Explanation / Answer
Disadvantages of FAT16 are:
Advantages of FAT32
FAT32 allocates disk space much more efficiently than previous versions of FAT. Depending on the size of your files, there is a potential for tens and even hundreds of megabytes more free disk space on larger hard disk drives. In addition, FAT32 provides the following enhancements:
FAT32 is more robust than FAT16. FAT32 has the ability to relocate the root directory and use the backup copy of the FAT instead of the default copy. In addition, the boot record on FAT32 drives has been expanded to include a backup of critical data structures. This means that FAT32 volumes are less susceptible to a single point of failure than FAT16 volumes.
Fat 16 has many Disadvantages and FAT 32 more powerful than FAT 16 so microsoft switched from Fat 16 to 32
******************************************************************
2)
b)
It is a uniprocessor static-priority preemptive scheme. For the RM scheduling algorithm, in addition to assumptions (a) to (c), we assume that all tasks are periodic and the priority of task is higher than the priority of task , where qN^ . The RM scheduling algorithm is an example of priority driven algorithms with static priority assignment in the sense that the priorities of all instances are known even before their arrival. The priorities of all instances of each task are the same. They are determined only by the period of the task. A periodic task consists of an infinite sequence of instances with periodic ready times, where the deadline of a request could be less than, greater than, or equal to the ready time of the succeeding instance. Furthermore, the execution times of all the instances of a task are the same. A periodic task is characterized by three parameters , the period of the instancthe execution time, and the deadline of the tasks. the RM algorithm will schedule all the tasks to meet their respective 16 deadlines.
*************************************************************************************************
3)
In this section we present a formal definition of real-time systems. As we mentioned in Section 1.1, real-time systems are defined as those systems in which the correctness of the system depends not only on the logical result of computation, but also on the time at which the results are produced. If the timing constraints of the system are not met, system failure is said to have occurred. Hence, it is essential that the timing constraints of the system are guaranteed to be met. Guaranteeing timing behavior requires that the system be predictable. Predictability means that when a task is activated it should be possible to determine its completion time with certainty. It is also desirable that the system attain a high degree of utilization while satisfying the timing constraints of the system
******************************************************************************************
4)
D/F measures space in units of 512-byte disk sectors. You can specify a particular file system by naming any file name on that file system. If you do not give an argument, df reports space for all mounted file systems known to the system, in the following format:
The total space reported is the space in the already allocated extents (primary and any already allocated secondary extents) of the data set that holds this file system. Therefore, the total space might increase as new extents are allocated.
This number is only meaningful for file systems created using DFSMS 1.3.0 and later. For file systems created with earlier versions of DFSMS, this number is always 4 294 967 295.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.