Semispace, Operating System

Assignment Help:

Semispace works by maintaining two disjoint areas from which memory can be allocated. These areas are called the from-space and the to-space. At ?rst, the algorithm allocates memory only from the from-space, without ever worrying about garbage collection. Allocation then is typically performed using simple pointer bumping, which simpli?es the whole process a lot. When we ?nally run out of space in the from-space, we sweep through all allocated objects that can be somehow reached; those are the ones that are still live. We then move each of these live objects to the to-space, taking care to update all pointers to the live objects to point to its new location in the to-space. Hence semispace is called a copying collector. After having done all this moving, only live objects are in the to-space. From this moment on, we can start using the to-space to perform allocation. The process is repeated again when the to-space eventually runs out of space. Thismethod has as advantages the fact that it might "compact" objects in the memory, thus increasing locality and minimizing fragmentation. Also, when performing allocation from one of the spaces, it can use simple pointer bumping, which is very fast. However, this approach doubles the memory requirements.


Related Discussions:- Semispace

How are file sharing and protection implemented?, How are file sharing and ...

How are file sharing and protection implemented? To implement file protection and sharing, the system ought to maintain more file and directory attributes than are needed on a

What is multiprogramming?, What is multiprogramming? Multiprogramming: ...

What is multiprogramming? Multiprogramming: The management of many processes within a single processor system. Operating systems such like UNIX provide multiprogramming for sha

Explain components of conflict phase of dispatch latency, Explain Component...

Explain Components of conflict phase of dispatch latency The conflict phase of dispatch latency has two components 1. Preemption of any process running in the kernel. 2.

Show the services which provided by operating system, Q. Show the services ...

Q. Show the services which provided by operating system? A) Resource Allocation: If there are more than one user or jobs running at the same instance then resource

Relationship among the capabilities of domain level j and i, Q. In a ring-...

Q. In a ring-protection system the level 0 has the greatest access to objects and level n (greater than zero) has fewer access rights. The access rights of a program at a partic

What are the various process scheduling concepts, What are the various proc...

What are the various process scheduling concepts? a) Scheduling queues with diagram b) Queuing diagram c) Schedulers d) Context switch with diagram

Linux operation system, wat are the commands used for creating the file hie...

wat are the commands used for creating the file hierarchy

Define system call, Define System Call A system call is a request that ...

Define System Call A system call is a request that is made by any program to the operating system for carrying out tasks - picked from a predefined set - which the said program

What are turnaround time and response time, What are turnaround time and re...

What are turnaround time and response time? Turnaround time is the interval among the submission of a job and its completion. Response time is the interval among submission

Find the optimal solution and optimal value, Find the optimal solution and ...

Find the optimal solution and optimal value of the following linear program. Use both (a) the enumerating the corner points method and (b) the iso-profit line method. Also identify

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