Low-overhead threads in a high-concurrency system

Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S201000, C718S102000

Reexamination Certificate

active

06874027

ABSTRACT:
A method and system for providing the functionality of dynamically-allocated threads in a multithreaded system, in which the operating system provides only statically-allocated threads. With this functionality, a relatively large number of threads can be maintained without a relatively large amount of overhead (either in memory or processor time), and it remains possible to produce program code without undue complexity. A plurality of dynamically-allocated threads are simulated using a single statically-allocated thread, but with state information regarding each dynamically-allocated thread maintained within the single statically-allocated thread. The single statically-allocated thread includes, for each procedure call that would otherwise introduce a new simulated thread, a memory block including (1) a relatively small procedure call stack for the new simulated thread, and (2) a relatively small collection of local variables and other state information for the new simulated thread.

REFERENCES:
patent: 4459664 (1984-07-01), Pottier et al.
patent: 4742447 (1988-05-01), Duvall et al.
patent: 4937763 (1990-06-01), Mott
patent: 5067099 (1991-11-01), McCown et al.
patent: 5596579 (1997-01-01), Yasrebi
patent: 5812844 (1998-09-01), Jones et al.
patent: 5835763 (1998-11-01), Klein
patent: 5903752 (1999-05-01), Dingwall et al.
patent: 5913051 (1999-06-01), Leeke
patent: 6205414 (2001-03-01), Forsman et al.
patent: 6272518 (2001-08-01), Blazo et al.
patent: 6317844 (2001-11-01), Kleiman
patent: 6324492 (2001-11-01), Rowe
patent: 6389446 (2002-05-01), Torii
patent: 6427161 (2002-07-01), LiVecchi
patent: 6496942 (2002-12-01), Schoenthal et al.
patent: 6505229 (2003-01-01), Turner et al.
patent: 6505250 (2003-01-01), Freund et al.
patent: 6535878 (2003-03-01), Guedalia et al.
patent: 6542920 (2003-04-01), Belkin et al.
patent: 6687729 (2004-02-01), Sievert et al.
patent: 0537098 (1993-04-01), None
David R. Cheriton, “Multi-Process Structuring and the Thoth Operating System”. Department of Computer Science, University of British Columbia, Vancouver, B.C. Canada. Mar. 1979. pp. 1-64.
David R. Cheriton, “The Thoth System: Multi-Process Structuring and Portability”. The Computer Science Library.
David R. Cheriton et al., “Thoth, A Portable Real-Time Operating System”. Communication of the ACM. Feb. 1979.vol. 22. No. 2. pp. 105-115.
David Hitz et al., “Using UNIX as One Component of a Lightweight Distributed Kernel for Multiprocessor File Servers”. Technical report 5. Jan. 1990. Auspex.
Jonesk. Anita, “StarOS, a Multiprocessor Operating System for the Support of Task Forces”. Department of Computer Science. Carnegie-Mellon University. Pittsburg, PA. 1979.
Michael A. Malcolm, “A Process Abstraction and its Application”. Department of Computer Science. University of Waterloo. Waterloo, Ontario.Proc. Eighth Manitoba Conference on Numerical Math. And Computing, 1978.
Network Appliance-Data ONTAP Event Management System, Aug. 10, 2000.
Silberschatz et al., “Operating System Concepts”. 1989.
VRTX. Versatile Real-Time Executive for Microprocessors. C User's Guide. Jan. 1987.
Lantz, Keith A. Et al., “Rochester's Intelligent Gateway”. IEEE. Oct. 1982.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Low-overhead threads in a high-concurrency system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low-overhead threads in a high-concurrency system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-overhead threads in a high-concurrency system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3443766

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.