Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what are various ids associated with a processunix identifies each process with a unique integer known as processid the process that implements the
parallel overheadthe amount of time needed to organize parallel tasks as opposed to undertaking useful work parallel overhead may comprise factors
granularityin parallel computing granularity can be defined as a qualitative assess of the ratio of computation to communication1 coarse granularity-
communicationsparallel tasks normally have to exchange data there are various manners in which this can be achieved like over a network or through a
shared memory shared memory refers to memory component of a computer system in which the memory can accessed directly by any of the processors in
serial executionexecution of a program serially one statement at one instance of time in the simplest case thats what takes place on a one processor
task a task is logically discrete section of computational work a task is normally a program or else set of instructions which are executed by a
mathematical simulation and modelling applicationsthe tasks include mathematical simulation and modelling need lots of parallel processing three
ai applicationssearch is a important element of an ai system and search functions are executed on huge quantities of complicated structured data by
how the kernel handles both the page stealer and the fault handlerthe page stealer and the fault handler thrash because of the shortage of the memory
in what way the protection fault handler concludesafter finishing the implementation of the fault handler it sets the change and protection bits and
what does the swapping system do if it identifies the illegal page for swappingif the disk block descriptor does not have any record of the faulted
what is page fault its typespage fault refers to the situation of not having a page in the major memory when any process references it there are two
what are the phases of swapping a page from the memorypage stealer searches the page eligible for swapping and places the page number in the list of
what is page-stealer processthis is the kernel process that makes rooms for the incoming pages by swapping the memory pages that are not the part of
what is bssblock started by symbola data showing at the machine level that has initial values when a program begins and tells about how much space
what is the window of the working set of a process the window of the working set of a method is the total number in which the method had referred the
what is the working set of a processthe set of pages that are referred by the method in the last n references where n is called the window of the
what is the principle of localityits the nature of the processes that they refer only to the small subset of the total data space of the processie
what are the criteria for choosing a process for swapping into memory from the swap devicethe resident time of the processes in the change device the
what are the requirements for a swapper to work the swapper works on the highest scheduling priority firstly it will look for any sleeping method if
what is expansion swapat the time when any process needs more memory than it is currently allocated the kernel performs expansion swap to do this
what is fork swapfork is a system call to make a child process when the parent process calls fork system call the child process is formed and if
what are the entities that are swapped out of the main memory while swapping the process out of the main memoryall memory space occupied by the
what do you mean by u-area user area or u-blockthis having the private data that is manipulated only by the kernelthis is local to the process ie