0
Is time sharing system implies more than one thread in the memory?
Wiki User
∙ 9y agoWant this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the difference between lightweight and heavy weight process?
Light weight is called as a thread which runs inside a process and a heavy weight is a system process. As the thread share the memory of heavy weight then we can say that it is not taking any additional resources(memory) to execute. As a process is a combination of one of more then one threads and each process is having the separate memory location so it is very easy for thread to communicate with each other as compare to two process communicate because thread communicate within same memory but process communicate with other process having different memory location. Here we can consider light weight as a thread and heavy weight as a process.
What is the difference between shared memory and thread?
Shared memory and thread are not compareable since both of them relies to different technologies. A Shared memory is one of the methods to implement interprocess communication or IPC, by which different processes or tasks can access the same memory area, to share data between them. A thread or thread of execution is a mechanism by which a process can be split in to multiple simultaneously running pieces of code.
What resources are used when a thread is created?
When a thread is created the threads does not require any new resources to execute the thread shares the resources like memory of the process to which they belong to. The benefit of code sharing is that it allows an application to have several different threads of activity all within the same address space. Whereas if a new process creation is very heavyweight because it always requires new address space to be created and even if they share the memory then the inter process communication is expensive when compared to the communication between the threads
What is difference between child process and thread?
The child process is initially running its parent' s program, with its parent' s virtual memory, file descriptors, and so on copied.The child process can modify its memory, close file descriptors, and the like without affecting its parent, and vice versa. When a program creates another thread, though, nothing is copied.The creating and the created thread share the same memory space, file descriptors, and other system resources as the original. If one thread changes the value of a variable, for instance, the other thread subsequently will see the modified value. Similarly, if one thread closes a file descriptor, other threads may not read from or write to that file descriptor.
What are the similarities between a process and a thread?
Thread and Process both do the same thing. ie. parallel jobs done on a CPU. The thread is under the process's control, ie. the programmer can control the thread regard to its priority, memory etc. I am not very sure about multi-threading and process-control under Windows. We have a process control system running on a 8086 based system. It is of Siemens make. It supports 64 threads which are called Tasks in their terminology. Initiation of task, suspending the task, readying the task etc is under the control the program, ie user software. In another computer Data General's M-600, we had multiple processes (max 64), each having a logical address space of 64 kilo bytes. Under each process we can have multiple tasks (I think max 32 tasks). The task control block is in the program's memory space. Intertask communication is pretty simple here. Sharing memory between tasks is simple as the entire memory of the process is under the control of the process. I have used a muti-tasking program under windows. One task continuously communicates with a groupp of microprocessor based controlers over RS-485, and another task processes the read data and does display, storage etc. The program was written in VC++(6.0) . Here the sharing of memory is easy as the entire memory of the process is shared between the tasks(threads). But VB uses something called compartmental multi-threading, meaning each thread has its own compartment of resources.
If a process terminates will its thread also terminate?
yes, because if process is terminated then its related thread has no work. After completion of process the kernel generates a thread that will cancelled the thread in order to save the time and memory of CPU.
Synchronization in java?
Threads communicate primarily by sharing access to fields and the objects reference fields refer to. This form of communication is extremely efficient, but makes two kinds of errors possible: thread interference and memory consistency errors. The tool needed to prevent these errors is synchronization.
What is thread synchonisation in os?
The thread synchronization is done for sharing of a common resource, to find the no. of resources in use, its count ,maximum resources in use... To establish this the various synchronization tools used are.. Events Waitable Timer
What is green thread in java language?
Green thread scheduled by jvm insteadof respective operating system(nativiely).
Diffference between dynamic memory alllocation and static memory alllocation?
Static memory is allocated at program load time using information found in the program's data segment. Static memory is fixed size and stores all the program's constants, global variables and static variables. Dynamic memory includes both the call stack and the heap (free store). Every process has at least one thread (the main thread) and each thread is allocated its own stack. A thread's stack is allocated when the thread is instantiated and released when the thread terminates. The stacks are fixed size and are used to store function local variables, function return addresses and exception handlers. Heap memory is what we generally term dynamic memory, which is memory that is allocated and released as and when required. Since stack memory is pre-allocated, it is quicker to access since memory is allocated and released simply by adjusting the pointer that marks the top of the stack. However, because it is fixed size, it has limited capacity. We try to use the stack as much as possible for performance, but the limited capacity means it is only useful for relatively small allocations, including non-static (local) fixed size arrays. However, the stack size can be adjusted at compile time if we require more (or less) than is provided by default.
What is the definition of java synchronized?
Well, how this works is threads recieve information by sharing access to "fields," and the objects reference refers to. This form of communicating is easier, but can create some problems. Sometimes, it can create thread interference and "memory consistency errors". The tool needed to prevent these errors is called, ironically, "synchronization."
What are the threads called?
tl;dr: They're called threads because thread is an apt metaphor. When you start a thread, you rely on the operating system to allocate processing time so that your thread can execute. While your thread is executing, the processor (or core) is placing all of its attention on your thread.
