Linux kernel development by Robert Love describes the fork process as
fork() -> clone() -> do_fork() -> copy_process()
I am unable to find the clone() system call in linux 3.13.
Can someone explain the proper flow of fork() system call initiated by the
user?
Where can I find the libc
I am using Ubuntu
On Sat, Apr 9, 2016 at 8:04 PM, Pranay Srivastava <pran...@gmail.com> wrote:
> On Sat, Apr 9, 2016 at 7:51 PM, Nitin Varyani <varyani.nit...@gmail.com>
> wrote:
> > I have a 64 bit machine
> >
>
> Before changing the source try to build, inst
gt;
> On Thu, Apr 7, 2016 at 11:53 AM, Nitin Varyani <varyani.nit...@gmail.com>
> wrote:
> >
> > Hi,
> > I want to implement a system call as explained in Linux kernel
> development by Robert Love.
> >
> > He does three things
> > adding entr
Hi,
I want to implement a system call as explained in Linux kernel
development by Robert Love.
He does three things
adding entry to entry.S
adding entry to asm/unistd.h
and adding the system call code to sched.c
and then make + make install
I do not want to implement for all
t 4:57 PM, Nitin Varyani <varyani.nit...@gmail.com>
wrote:
> If I do the following thing:
>
> struct pid remote_struct_pid;
> remote_struct_pid.numbers[0].nr=*my_pid*;
> p = copy_process(clone_flags, stack_start, stack_size, child_tidptr,
> *remote_struct_pid*, trace, tls)
01:26 -0400, valdis.kletni...@vt.edu wrote:
> > On Mon, 21 Mar 2016 16:01:41 +0530, Nitin Varyani said:
> >
> > > I am running a master user-level process at Computer 1 which sends a
> > > process context like code, data, registers, PC, etc as well as *"pid"*
> to
wrote:
> Nitin,
>
>
> On Mon, Mar 21, 2016 at 4:03 PM, Nitin Varyani <varyani.nit...@gmail.com>
> wrote:
> > .Continued That is, if kernel at Computer 2 finds that pid of a
> > process requesting a system call is 1500, the request is forwarded to
&g
tion to corresponding representative process which
requests the kernel for the system call and sends the result back to slave
daemon.
On Mon, Mar 21, 2016 at 4:03 PM, Nitin Varyani <varyani.nit...@gmail.com>
wrote:
> .Continued That is, if kernel at Computer 2 finds that pid of a
&
.
On Mon, Mar 21, 2016 at 4:01 PM, Nitin Varyani <varyani.nit...@gmail.com>
wrote:
> I am trying to create a distributed pid space.
>
> 0 to 2000 Computer 1
> 2001 to 4000 Computer 2
> 4001 to 6000 Computer 3
>
> and so on...
>
> I am running a master user-level
ess belongs to
local node or to the master node?". That is, if kernel at Computer 2 pid of
the process is 1500
On Mon, Mar 21, 2016 at 12:23 PM, <valdis.kletni...@vt.edu> wrote:
> On Mon, 21 Mar 2016 10:33:44 +0530, Nitin Varyani said:
>
> > Sub-task 1: Until now, parent process
, 2016 at 12:03 AM, <valdis.kletni...@vt.edu> wrote:
> On Sun, 20 Mar 2016 02:07:29 -0700, Nitin Varyani said:
>
> > The linux kernel attaches a pid to newly forked process. I want to
> > create a facility by which a process has the option of attaching a new
>
Hi,
The linux kernel attaches a pid to newly forked process. I want to
create a facility by which a process has the option of attaching a new pid
to its child which is not in the pid space.
Any suggestions of how this can be achieved?
Nitin
struct task_struct { volatile long state; /* -1 unrunnable, 0 runnable, >0
stopped */* void *stack;* atomic_t usage; unsigned int flags; /* per
process flags, defined below */ unsigned int ptrace;
What does the field void *stack indicate here?
Is it the pointer to kernel stack of the process?
Codes are huge and documentation is negligible. How can I separate whay I
want to achieve from that big code?
On Thu, Mar 3, 2016 at 10:07 PM, Mulyadi Santosa <mulyadi.sant...@gmail.com>
wrote:
>
>
> On Thu, Mar 3, 2016 at 6:12 PM, Nitin Varyani <varyani.nit...@gmail.com
Hi,
I want to migrate user context of a process to a remote machine (i.e.
registers, code, data, virtual memory and program counter) and when it
makes a system call or file i/o, I want to send that request to its home
node.
That is, the user process executing at remote node will copy
7PM +0530, Nitin Varyani wrote:
>> Rather than trying to go blind folded in getting practical experience
>> of linux programming, I want to gain experience only in relation to my
>> task of creating a distributed process scheduler. What all things
>> should I try to work
wrote:
> On Wed, 17 Feb 2016 10:21:35 +0530, Nitin Varyani said:
>
>> Actually it is a master's thesis research project as of now. I am ready to
>> boil down to the most basic implementation of distributed linux kernel.
>> Assume there is no network connection and no open f
, Mulyadi Santosa <mulyadi.sant...@gmail.com
> wrote:
>
>
> On Mon, Feb 15, 2016 at 7:37 PM, Nitin Varyani <varyani.nit...@gmail.com>
> wrote:
>
>>
>>
>> On Mon, Feb 15, 2016 at 6:06 PM, Nitin Varyani <varyani.nit...@gmail.com>
>> wrote:
>>
if you say "no network connections" and "no open files",
the problem gets a lot easier - but also quickly devolving into a
master's thesis research project rather than anything useful
Actually it is a master's thesis research project as of now. I am ready to
boil down to the most basic
, Nitin Varyani <varyani.nit...@gmail.com>
wrote:
> According to my project requirement, I need a distributed algorithm so
> mesos will not work. But work stealing is the best bargain. It will save
> communication costs. Thankyou. Can you please elaborate on the last part of
> your
din...@linux.vnet.ibm.com>
wrote:
> On Tue, 16 Feb 2016 00:13:34 -0500
> valdis.kletni...@vt.edu wrote:
>
> > On Tue, 16 Feb 2016 10:18:26 +0530, Nitin Varyani said:
> >
> > > 1) Sending process context via network
> >
> > Note that this is a non-trivial issue
.
On Mon, Feb 15, 2016 at 10:22 PM, Henrik Austad <hen...@austad.us> wrote:
> On Mon, Feb 15, 2016 at 09:35:28PM +0530, Nitin Varyani wrote:
> > Hi,
>
> Hi Nitin,
>
> > I am given a task to design a distributed process scheduling algorithm.
> > Current distribu
Hi,
I am given a task to design a distributed process scheduling algorithm.
Current distributed OS are patch work over the linux kernels, that is, they
are responsible for load balancing through process migration but the
scheduling is taken care by the single machine linux kernels. My task is to
On Mon, Feb 15, 2016 at 6:06 PM, Nitin Varyani <varyani.nit...@gmail.com>
wrote:
> Hi
> I have studied LInux kernel CFS scheduling algorithm - the
> vruntime, weights, nice value, etc. I am able to understand the code.
> Actually the task given to me is really ve
thanks
On Sat, Feb 13, 2016 at 2:19 PM, Henrik Austad <hen...@austad.us> wrote:
> On Sat, Feb 13, 2016 at 11:42:57AM +0530, Nitin Varyani wrote:
> > Hello,
>
> Hi Nitin,
>
> > I want to understand the flow of code of process scheduler of
> >
Hello,
I want to understand the flow of code of process scheduler of
linux kernel. What I have understood is that
The task marks itself as sleeping,
puts itself on a wait queue,
removes itself from the red-black tree of runnable, and
calls schedule() to select a new process to execute.
Hi,
I am new to kernel source. I want to plugin a new process scheduling
algorithm. Can someone elaborate the steps to do it?
Nitin
___
Kernelnewbies mailing list
Kernelnewbies@kernelnewbies.org
27 matches
Mail list logo