Technical InterviewsTechnical InterviewsA Interviews related website which offers technical students with latest information on learning the tweaks in programming languages, information on all the best corporate companies in India. Articles
What is page cannibalizing?
2007-08-07 16:59:00 Page swapping or page replacements are called page cannibalizing. More About: Page , Cannibal
Paging a memory management function, while multiprogramming a processor man
2007-08-07 16:59:00 Yes. More About: Management , Memory , Processor , Esso , Process
What are demand- and pre-paging?
2007-08-07 16:58:00 With demand paging, a page is brought into memory only when a location on that page is actually referenced during execution. With pre-paging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices. More About: Demand
In loading programs into memory, what is the difference between load-time d
2007-08-07 16:58:00 For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module. With run-time dynamic loading: Some of the linking is postponed until ... More About: Programs , Memory , Time , Difference
In the context of memory management, what are placement and replacement alg
2007-08-07 16:57:00 Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out. More About: Management , Memory , Context , Lace , Manage
How are the wait/signal operations for monitor different from those for sem
2007-08-07 16:57:00 If a process in a monitor signal and no task is waiting on the condition variable, the signal is lost. So this allows easier program design. Whereas in semaphores, every operation affects the value of the semaphore, so the wait and signal operations should be perfectly balanced in the program. More About: Monitor , Signal , Operation , Wait , Diff
What is time-stamping?
2007-08-04 22:32:00 It is a technique proposed by Lamport, used to order events in a distributed system without the use of clocks. This scheme is intended to order events consisting of the transmission of messages. Each system ‘i’ in the network maintains a counter Ci. Every time a system transmits a message, it increments its counter by ... More About: Time , Ping , Stam
Describe the Buddy system of memory allocation?
2007-08-04 22:32:00 Free memory is maintained in linked lists, each of equal sized blocks. Any such block is of size 2^k. When some memory is required by a process, the block size of next higher order is chosen, and broken into two. Note that the two such pieces differ in address only in their kth bit. Such ... More About: System , Memory , Buddy , Stem , Scribe
Define latency, transfer and seek time with respect to disk I/O.
2007-08-04 22:31:00 Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time it takes for the beginning of the required sector to reach the head. Sum of seek time (if any) and latency is the access time. Time taken to actually transfer a span of ... More About: Disk , Transfer , Respect , Seek
What are local and global page replacements?
2007-08-04 22:31:00 Local replacement means that an incoming page is brought in only to the relevant process’ address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only. More About: Page , Local , Lace , Loca
What is a trap and trapdoor?
2007-08-04 22:30:00 Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition. More About: Trap , Door
When does the condition ?rendezvous? arise?
2007-08-01 09:28:00 In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered. More About: Condition , Condi , Rendezvous , The Con
Explain the popular multiprocessor thread-scheduling strategies.
2007-08-01 09:28:00 Load Sharing: Process es are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis. Gang Scheduling: A set of related threads is scheduled to ... More About: Strategies , Popular , Thread , Esso
What is busy waiting?
2007-08-01 09:27:00 The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion. More About: Waiting , Busy , Wait
What are the stipulations of C2 level security?
2007-08-01 09:27:00 C2 level security provides for: Discretionary Access Control Identification and Authentication Auditing Resource reuse More About: Security , Pula
What is meant by arm-stickiness?
2007-08-01 09:27:00 If one or a few processes have a high access rate to data on one track of a storage disk, then they may monopolize the device by repeated requests to that track. This generally happens with most common device scheduling algorithms (LIFO, SSTF, C-SCAN, etc). High-density multisurface disks are more likely to be affected by ... More About: Tick
What is cycle stealing?
2007-07-27 17:39:00 We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific ... More About: Cycle , Ealing , Stealing
When is a system in safe state?
2007-07-27 17:39:00 The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock. More About: System , State , Safe , Stem
What is the Translation Lookaside Buffer (TLB)?
2007-07-27 17:38:00 In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses– one to fetch appropriate page-table entry, and one to ... More About: Buffer , Look , Translation , Tran
What are the typical elements of a process image?
2007-07-27 17:38:00 User data: Modifiable part of user space. May include program data, user stack area, and programs that may be modified. User program: The instructions to be executed. System Stack: Each process has one or more LIFO stacks associated with it. Used to store parameters and calling addresses for procedure and system calls. Process control Block (PCB): Info needed ... More About: Elements , Image , Element , Pica
What is the resident set and working set of a process?
More articles from this author:2007-07-27 17:38:00 Resident set is that portion of the process image that is actually in real-memory at a particular instant. Workin g set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.) More About: Process , Resident 1, 2, 3, 4 |
 |
|
 |
