In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a. What are two such problems? b. Can we ensure the same degree of security in a time-shared machine as in a dedicated machine? Explain your answer.

In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a. What are two such problems? b. Can we ensure the same degree of security in a time-shared machine as in a dedicated machine? Explain your answer.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 5VE

See similar textbooks

Similar questions

In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a. What are two such problems? b. Can we ensure the same degree of security in a time-shared ma chine as in a dedicated machine? Explain your answer.
When feasible, what are the upsides of prioritizing the I/O queue as the place where processes would be executed? If the I/O connection suddenly goes down, what do you expect to happen? How would this affect the fastest possible CPU burst rate? I'm not quite sure I get what you're getting at here.
Multiple methods have been proposed for a processor that can both decrypt data and system instructions and then act on the decrypted data and executed system instructions. The provided counterarguments will be encrypted by the processor. Is there any benefit to utilizing this CPU type over others? How much computing power and memory would be needed for such a task?
When feasible, what advantages does it have to move process execution to the I/O queue first? Should the I/O connection go down, what do you anticipate would happen? Will this reduce the CPU's maximum burst frequency in any way? Not sure I understand what you mean by that.
What is the benefit of assigning a process to the I/O queue first and then pushing it to the CPU when it is ready when it comes to process execution? When an I/O operation does not finish successfully, what, in your view, will result? Is it possible that the CPU burst will be affected? What exactly do you mean?
create python algorithm of an operating system scheduler that is able to perform well in a variety of metrics, such as turnaround time, response time, burst time and switching time. You need to create a scheduler that is able to perform well in a variety of situations, and also needs to take into account I/O Interrupts. How you handle the processing is up to you.
Given two processes in the READY state, one that is CPU-bound and one that is I/O- bound, which process shouldbe given a higher priority for running next (all other things being equal)? Briefly explain your answer.
When this option is available, the I/O queue should be prioritised above the process execution queue. In what ways may this be beneficial? Who knows what will take place if there is a disruption in the I/O. It is unclear at this time if this will have an effect on the maximum burst rate of the CPU. I'm not really clear on the point you're trying to make here.
What are the prerequisites for a system to get into a deadlock state, and how can one avoid it?
There are a number of benefits to preemptively delegating processing to an I/O queue and then passing control to the CPU when it's ready. Any potential consequences of a pause in I/O operations are impossible to predict. Will this have an effect on how quickly the CPU can process data? How exactly does this hold true?
Problem 6. Nowadays the virtual address is much larger (64 bits) than the physical address space (e.g., on my MacBook, 35 bits). However, in "the old days" (early 80's), it could be the other way around. For example, on a PDP11/70 minicomputer runing UNIX, each process had a 64 KB (16 bit) virtual address space, while the machine had a 2 Megabyte physical memory. The virtual address space was divided into 8 pages of 8 Kbytes each. Thus each process had a page table with 8 entries. a. How big (how many bits) were the physical addresses in this system? b. How many high-order bits of the virtual address made up the virtual page number? c. How many bits are the offset in the page, and the physical page slot number? d. In the table below, you are given virtual-to-physical address mappings. For each one, say what page table entry was used, and what it contained, i.e., what the corresponding virtual page number (VP#, i.e., index into the page table) and physical page number (PP#, i.e.,…
Imagine a system in which data and code are viewed as two different things. Two sets of base-limit registers are used by the central processing unit to store and get information as needed. It is best to keep facts and processes separate. This pair is made to be read-only, so more than one person can use it at the same time. Compare this strategy to other plans.