Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain the Fork Function
Fork function causes a new process to be created. The calling progress is duplicated as an exact copy (called the child process) that differs only in process IDs and parent IDs. This function returns the chid's process ID to the parent process and a value of 0 to the child process. After that it is possible to distinguish the two process as a result to the fork () call. The child inherits many handles, IDs, and masks from the parent process. The fork is generally used in conjunction with exec () to load or spawn new process. First the fork is initiated to create a new process context, then exec () is used to overlay the child process with a new executable image. execl(execName, arg0,....) The exec family of functions changes the state of the calling process into a new process.
Once executed, exec will replace the currently executing process with one specified by execName. Optionally parameters may be passed to the newly running process as variable-number command line arguments (arg0....) This function is usually used to either replace or overlay an existing running process or in conjunction with the fork () system call to initiate a new process. Once the fork () call is initiated to copy the process, the child process may in turn exec the new process to be executed. The original process is thus still in memory and active, and the child process has become a new executable image specified by exec Name.
How many disk operations are needed to fetch the i-node for the file /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else alo
Central to implementation of a modern memory management system is the page replacement algorithm. Modern virtual memory systems break memory up into pages and map (via a page table
Define Latency plus seek time The total time to arrange a disk drive mechanism for a block of data to be read from is its Latency plus seeks time
Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in
While it is hard to resolve a deadlock which has been detected, fortunately it is fairly easy to prevent deadlocks from ever happening. The key is that the conditions above for dea
Question: (a) Describe blocking and non-blocking types of inter-process communication. What is easier to implement and why? Discuss their relative advantages and disadvantage
Additional-reference-bits algorithm We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the lo
Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means
how response times are reduced by allowing time sharing on top of multiprogramming
Define which is not a key piece of information, stored in single page table entry, supposing pure paging and virtual memory A reference for the disk block which stores the pa
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd