Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
1997-09-30
2001-02-13
Oberley, Alvin E. (Department: 2755)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
Reexamination Certificate
active
06189023
ABSTRACT:
BACKGROUND OF THE INVENTION
Many modern operating systems utilize threads as the basic unit of execution. Each thread in a process is associated with a sequence of CPU instructions, a set of CPU registers and a stack.
The operating system is responsible for scheduling threads. Different operating systems perform thread scheduling and thread synchronization in different manners. Thus, application programs are designed to utilize the thread scheduling protocols of the operating system. If the application is to be run on a different operating system care must be taken to account for different thread management protocols.
In some cases special software may be written to port applications to another operating system. The porting application presents a consistent set of application program interfaces (APIs) application programs and includes functions to generate instructions to cause the new operating system to transparently provide the support expected by the application programs written for the original operating system.
SUMMARY OF THE INVENTION
According to one aspect of the invention, a computer program product ports the NSK shared code threads to the Windows NT operating system.
According to another aspect of the invention, a shared code thread is implemented as an NT fiber. The fibers within a thread are not preempted and are used to implement the scheduling protocols of the shared code threads.
According to another aspect of the invention, when a shared code thread completes it may be put on a free thread list to be reused when a new shared thread is to be created.
REFERENCES:
patent: 4989134 (1991-01-01), Shaw
patent: 5404529 (1995-04-01), Chernikoff
patent: 5481706 (1996-01-01), Peck
patent: 5553305 (1996-09-01), Gregor et al.
patent: 5557747 (1996-09-01), Roger
patent: 5630128 (1997-05-01), Farrell
patent: 5784613 (1998-07-01), Iamirisa
patent: 5835763 (1998-11-01), Klein
patent: 0794 490 (1997-09-01), None
Xuejun et al, “Processor Self-Scheduling for Parallel Loops in Preemptive Environments,”Future Generations Computer Systems, 6 (1990) Jun. , No. 1, Amsterdam, NL, pp. 97-103, Elsevier Science Publishers B.V. North-Holland.
Yam M: “DCE pthreads versus NT Threads,”Dr. Dobb's Journal, Dec. 1996, Miller Freeman, U.S.A., vol. 21, No. 12, pp. 16-18, 20, 88.
Brahmaroutu Srini
Emlich Larry W.
Oberley Alvin E.
Opie George
Tandem Computers Incorporated
Townsend and Townsend / and Crew LLP
LandOfFree
Simulating shared code thread modules with shared code fibers does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Simulating shared code thread modules with shared code fibers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulating shared code thread modules with shared code fibers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2615400