Task swap out in a multithreaded environment

Details Task swap out in a multithreaded environment Task swap out in a multithreaded environment

2008-04-15

2008-04-15

An, Meng-Al T. (Department: 2195)

Electrical computers and digital processing systems: virtual mac

Task management or control

Process scheduling

C718S102000, C718S103000, C718S107000, C712S228000

Reexamination Certificate

active

10659407

ABSTRACT:
A method and system that prepares a task for being swapped out from processor utilization that is executing on a computer with multiple processors that each support multiple streams. The task has one or more teams of threads, where each team represents threads executing on a single processor. The task designates, for each stream that is executing a thread, one stream as a team master stream and one stream as a task master stream. For each team master stream, the task notifies the operating system that the team is ready to be swapped out when each other thread of the team has saved its state and has quit its stream. Finally, for the task master stream, the task notifies the operating system that the task is ready to be swapped when it has saved its state and each other team has notified that it is ready to be swapped out.

REFERENCES:
patent: 4819234 (1989-04-01), Huber
patent: 4872167 (1989-10-01), Maezawa et al.
patent: 5168554 (1992-12-01), Luke
patent: 5179702 (1993-01-01), Spix et al.
patent: 5197138 (1993-03-01), Hobbs et al.
patent: 5257358 (1993-10-01), Cohen
patent: 5301325 (1994-04-01), Benson
patent: 5333280 (1994-07-01), Ishikawa et al.
patent: 5450575 (1995-09-01), Sites
patent: 5485626 (1996-01-01), Lawlor et al.
patent: 5504932 (1996-04-01), Vassiliadis et al.
patent: 5524250 (1996-06-01), Chesson et al.
patent: 5526521 (1996-06-01), Fitch et al.
patent: 5533192 (1996-07-01), Hawley et al.
patent: 5557761 (1996-09-01), Chan
patent: 5564051 (1996-10-01), Halliwell
patent: 5581764 (1996-12-01), Fitzgerald
patent: 5594864 (1997-01-01), Trauben
patent: 5598560 (1997-01-01), Benson
patent: 5621886 (1997-04-01), Alpert et al.
patent: 5632032 (1997-05-01), Ault
patent: 5652889 (1997-07-01), Sites
patent: 5668993 (1997-09-01), Peters et al.
patent: 5712996 (1998-01-01), Schepers
patent: 5740413 (1998-04-01), Alpert et al.
patent: 5754855 (1998-05-01), Miller
patent: 5768591 (1998-06-01), Robinson
patent: 5768592 (1998-06-01), Chang
patent: 5774358 (1998-06-01), Shrote
patent: 5774721 (1998-06-01), Robinson
patent: 5778230 (1998-07-01), Wimble et al.
patent: 5787245 (1998-07-01), You et al.
patent: 5805892 (1998-09-01), Nakajima
patent: 5812811 (1998-09-01), Dubey et al.
patent: 5826265 (1998-10-01), Van Huben et al.
patent: 5867643 (1999-02-01), Sutton
patent: 5877766 (1999-03-01), Bates et al.
patent: 5887166 (1999-03-01), Mallick et al.
patent: 5901315 (1999-05-01), Edwards et al.
patent: 5903730 (1999-05-01), Asai et al.
patent: 5913925 (1999-06-01), Kahle et al.
patent: 5953530 (1999-09-01), Rishi et al.
patent: 5961639 (1999-10-01), Mallick et al.
patent: 5966539 (1999-10-01), Srivastava
patent: 5978902 (1999-11-01), Mann
patent: 6002872 (1999-12-01), Alexander, III et al.
patent: 6002879 (1999-12-01), Radigan et al.
patent: 6003066 (1999-12-01), Ryan et al.
patent: 6009269 (1999-12-01), Burrows et al.
patent: 6016542 (2000-01-01), Gottlieb et al.
patent: 6029005 (2000-02-01), Radigan
patent: 6049671 (2000-04-01), Slivka et al.
patent: 6058493 (2000-05-01), Talley
patent: 6059840 (2000-05-01), Click, Jr.
patent: 6072952 (2000-06-01), Janakiraman
patent: 6088788 (2000-07-01), Borkenhagen et al.
patent: 6094716 (2000-07-01), Witt
patent: 6101524 (2000-08-01), Choi et al.
patent: 6105051 (2000-08-01), Borkenhagen et al.
patent: 6112293 (2000-08-01), Witt
patent: 6151701 (2000-11-01), Humphreys et al.
patent: 6151704 (2000-11-01), Radigan
patent: 6195676 (2001-02-01), Spix et al.
patent: 6212544 (2001-04-01), Borkenhagen et al.
patent: 6219690 (2001-04-01), Slingwine et al.
patent: 6223202 (2001-04-01), Bayeh
patent: 6233599 (2001-05-01), Nation et al.
patent: 6272520 (2001-08-01), Sharangpani et al.
patent: 6282638 (2001-08-01), Dowling
patent: 6289446 (2001-09-01), Nilsson et al.
patent: 6298370 (2001-10-01), Tang et al.
patent: 6466898 (2002-10-01), Chan
patent: 6470376 (2002-10-01), Tanaka et al.
patent: 6487590 (2002-11-01), Foley et al.
patent: 6505229 (2003-01-01), Turner et al.
patent: 6529958 (2003-03-01), Oba et al.
patent: 6560626 (2003-05-01), Hogle et al.
patent: 6560628 (2003-05-01), Murata
patent: 6567839 (2003-05-01), Borkenhagen et al.
patent: 6584489 (2003-06-01), Jones et al.
patent: 6594698 (2003-07-01), Chow et al.
patent: 6622155 (2003-09-01), Haddon et al.
patent: 6631425 (2003-10-01), Helland et al.
patent: 6766515 (2004-07-01), Bitar et al.
patent: 6785887 (2004-08-01), Armstrong et al.
patent: 2002/0103847 (2002-08-01), Potash
patent: 19710252 (1998-02-01), None
patent: 0422945 (1991-04-01), None
patent: 0455966 (1991-11-01), None
patent: 0537098 (1993-04-01), None
patent: 0855648 (1998-07-01), None
patent: 0864979 (1998-09-01), None
patent: 2307760 (1997-06-01), None
Adelberg, Brad et al., “The Strip Rule System for Efficient Maintaining Derived Data,” Sigmod Record, Association for Computing Machinery, New York, vol. 26, No. 2, Jun. 1, 1997.
Agrawal, Gagan et al., “Interprocedural Data Flow Based Optimizations for Compilation of Irregular Problems,” Annual Workshop on Language and Compilers for Parallel Computing, 1995.
Alverson, Gail et al., “Processor Management in the Tera MTA System,” 1995.
Alverson, Gail et al., “Scheduling on the Tera MTA,” Job Scheduling Strategies for Parallel Processing, 1995.
Alverson, Robert et al., “The Tera Computer System,”Proceedings of 1990 ACM International Conference on Supercomputing, Jun. 1990.
Anderson, Jennifer, et al., “Continuous Profiling: Where Have All The Cycles Gone?,” Operating SystemsReview, ACM Headquarters, New York, vol. 31, No. 5, Dec. 1, 1997.
Bailey, D.H. et al., “The NAS Parallel Benchmarks—Summary and Preliminary Results,” Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, California, 1991.
Briggs, Preston et al., “Effective Partial Redundancy Elimination,” ACM SIGPLAN Notices, Association for Computing Machinery, New York, vol. 29, No. 6, Jun. 1, 1994.
Callahan, David et al., A Future-Based Parallel Language for a General-Purpose Highly-Parallel Computer, Languages and Compilers for Parallel Computing, MIT Press, 1990.
Callahan, David et al., “Improving Register Allocation for Subscription Variables,” Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, White Plans, New York, Jun. 20-22, 1990.
Callahan, David, “Recognizing and Parallelizing Bounded Recurrences,” Aug. 1991.
Click, Cliff, “Global Code Motion, Global Value Numbering,” ACM SIGPLAN Notices, Association for Computing Machinery, New York, vol. 30, No. 6, Jun. 1, 1995.
Galarowicz, Jim et al., “Analyzing Message Passing Programs on the Cray T3E with PAT and VAMPIR,” Research Report, “Online!”, May 1998.
Goldman, Kenneth, J., “Introduction to Data Structures,” 1996, Retrieved from Internet http://www.cs.wustl.edu/{kjg/CS101—SP97/Notes?DataStructures/structures.html.
Hayashi, H. et al., “ALPHA: A High Performance Lisp Machine Equipped with a New Stack Structure and Garbage Collection System,” 10thAnnual International Symposium on Computer Architecture, 1983.
Korry, Richard et al., “Memory Management in the Tera MTA System,” 1995.
Linton, Mark A., “The Evolution of Dbx,”USENIX Summer Conference, Jun. 11-15, 1990.
Major System Characteristics of the TERA MTA, 1995.
Ram, A. et al., “Parallel Garbage Collection Without Synchronization Overhead,” 12thAnnual Symposium on Computer Architecture, Jun. 17, 1985.
Smith, Burton, “Opportunities for Growth in High Performance Computing,” Nov. 1994.
Smith, Burton, “The End of Architecture,” Keynote Address Presented at the 17thAnnual Symposium on Computer Architecture, Seattle, Washington, May 29, 1990.
Smith, Burton, The Quest for General-Purpose Parallel Computing.
Sreedhar, Vugranam C. et al., “Incremental Computation of Dominator Trees,” ACM SIGPLAN Notices, Association for Computing Machinery, New York, vol. 30, No.

Affiliated with

Also associated with

Rating

Task swap out in a multithreaded environment does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Task swap out in a multithreaded environment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Task swap out in a multithreaded environment will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3915869