1996-08-28
1998-02-10
Oberley, Alvin E.
395673, G06F 946
Patent
active
057179263
ABSTRACT:
A computer-implemented method, computer system, and memory for performing a fork operation of a parent process is provided. The parent process includes one or more threads, each having a kernel stack. The method includes the steps of locating the kernel stacks in a first memory location (e.g., segment 1) if the parent process is multi-threaded, in response to an initiation of a fork by a calling thread, switching the kernel stack of the calling thread to a second memory location if the parent process is multi-threaded, and copying the second memory location (e.g., segment 2) to create a child process.
REFERENCES:
patent: 4812981 (1989-03-01), Chan
patent: 4849877 (1989-07-01), Bishop
patent: 4901231 (1990-02-01), Bishop
patent: 5159687 (1992-10-01), Wengelski
patent: 5247673 (1993-09-01), Costa
patent: 5313647 (1994-05-01), Kaufman
patent: 5339415 (1994-08-01), Strout, II et al.
patent: 5404521 (1995-04-01), Murray
"Fork Clone Address Space Implementation on MVS", IBM Technical Disclosure Bulletin, vol. 35, No. 6, Nov. 1992, pp. 363-367.
Browning Luke Matthew
Cremel Olivier Alain Denis
Peek Jeffrey Scott
Dillon Andrew J.
International Business Machines - Corporation
Oberley Alvin E.
Park Alice Y.
Roberts Diana L.
LandOfFree
Efficient forking of a process does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient forking of a process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient forking of a process will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2086824