Explaintable management techniques, Operating System

Assignment Help:

Discuss in detail Table management Techniques?    

An Assembler employs the subsequent tables:

OPTAB: Operation Code Table consists of mnemonic operation code and its machine language equivalent.

SYMTAB:  Symbol Table keeps symbolic label, operand and their subsequent machine.

LITTAB is a table of literals employed in the program

For effectiveness reasons SYMTAB should remain in main memory all through passes I and II of the assembler.  LITTAB is not accessed as often as SYMTAB, though it may be accessed sufficiently often to justify its presence in the memory. If memory is at a premium, just only a part of LITTAB can be kept in memory. OPTAB should be in memory throughout pass I.


Related Discussions:- Explaintable management techniques

Explain variable partitioning in memory management, VARIABLE PARTITIONING ...

VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process.   50k 40k

Managing outside communication, Problem: Managing Outside Communication...

Problem: Managing Outside Communication. a. What is the principal action we use when communicating through a web browser? b. Give an example of how to preaddress an email

What is paging? name the different paging techniques, What is paging? Name ...

What is paging? Name the different paging techniques. Paging is a memory management method that permits the physical-address space of a process to be noncontiguous. Paging evad

List disadvantages of using a single directory, List disadvantages of using...

List disadvantages of using a single directory. Users have no privacy. Users must be careful in choosing file names, to avoid names used by others. Users may destroy each othe

Describe swapping technique in unix systems, Describe swapping technique in...

Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe

Task decomposition and data decomposition, Discuss the concepts of  task de...

Discuss the concepts of  task decomposition  and  data decomposition  within the context of parallel programming. Parallel programming or parrelel computing is the simultaneo

Example of producer consumer - semaphore, Now let's implement bounded produ...

Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd