Mechanisms for assuring quality of service for programs...

Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S214000, C718S104000

Reexamination Certificate

active

07376954

ABSTRACT:
A mechanism for assuring quality of service for a context in a digital processor has a first scheduling register dedicated to the context, the register having N out of M bits set, and a first scheduler that consults the register to assign issue slots to the context. The first scheduler grants issue slots for the context by referencing the N bits in the first register, and repeats a pattern of assignments of issue slots after referencing the M bits of the first register.

REFERENCES:
patent: 4817051 (1989-03-01), Chang
patent: 4860190 (1989-08-01), Kaneda et al.
patent: 5159686 (1992-10-01), Chastain et al.
patent: 5499349 (1996-03-01), Nikhil et al.
patent: 5511192 (1996-04-01), Shirakihara
patent: 5515538 (1996-05-01), Kleiman
patent: 5659786 (1997-08-01), George et al.
patent: 5758142 (1998-05-01), McFarling et al.
patent: 5812811 (1998-09-01), Dubey et al.
patent: 5867704 (1999-02-01), Tanaka et al.
patent: 5892934 (1999-04-01), Yard
patent: 5933627 (1999-08-01), Parady
patent: 5944816 (1999-08-01), Dutton et al.
patent: 5949994 (1999-09-01), Dupree et al.
patent: 5961584 (1999-10-01), Wolf
patent: 6061710 (2000-05-01), Eickemeyer et al.
patent: 6088787 (2000-07-01), Predko
patent: 6175916 (2001-01-01), Ginsberg et al.
patent: 6189093 (2001-02-01), Ekner et al.
patent: 6223228 (2001-04-01), Ryan et al.
patent: 6330656 (2001-12-01), Bealkowski et al.
patent: 6330661 (2001-12-01), Torii
patent: 6401155 (2002-06-01), Saville et al.
patent: 6675192 (2004-01-01), Emer et al.
patent: 6687812 (2004-02-01), Shimada
patent: 6697935 (2004-02-01), Borkenhagen et al.
patent: 6877083 (2005-04-01), Arimilli et al.
patent: 6889319 (2005-05-01), Rodgers et al.
patent: 6971103 (2005-11-01), Hokenek et al.
patent: 6986140 (2006-01-01), Brenner et al.
patent: 6993598 (2006-01-01), Pafumi et al.
patent: 7069421 (2006-06-01), Yates, Jr. et al.
patent: 7127561 (2006-10-01), Hill et al.
patent: 7134124 (2006-11-01), Ohsawa et al.
patent: 7185185 (2007-02-01), Joy et al.
patent: 2002/0103847 (2002-08-01), Potash
patent: 2002/0147760 (2002-10-01), Toril
patent: 2003/0014471 (2003-01-01), Ohsawa et al.
patent: 2003/0074545 (2003-04-01), Uhler
patent: 2003/0079094 (2003-04-01), Rajwar et al.
patent: 2003/0115245 (2003-06-01), Fujisawa
patent: 2003/0126416 (2003-07-01), Marr et al.
patent: 2004/0015684 (2004-01-01), Peterson
patent: 2005/0120194 (2005-06-01), Kissell
patent: 2005/0125629 (2005-06-01), Kissell
patent: 2005/0125795 (2005-06-01), Kissell
patent: 2005/0240936 (2005-10-01), Jones et al.
patent: 2005/0251613 (2005-11-01), Kissell
patent: 2005/0251839 (2005-11-01), Vishin et al.
patent: 0725334 (1996-08-01), None
patent: 0917057 (1999-05-01), None
patent: 1089173 (2001-04-01), None
patent: WO0153935 (2001-07-01), None
Heuring, Vincent P. and Jordan, Harry F. “Computer Systems and Architecture.” Reading, Mass.: Addison Wesley Longman, Inc., © 1997, pp. 35-37.
Patterson et al. “Computer Organization & Design: The Hardware/Software Interface.” 1998. Morgan Kaufmann Publishers, Inc. Second Edition. pp. 592-593.
Silberschatz et al. “Operating Systems Concepts.” 1994. Addison-Wesley Publishing Company. Fourth Edition. pp. 267-269, 271-272, 275.
Kissell, Kevin D. “Microprocessor Forum (MPF) Conference Program Presentation: Architectural Extensions to the MIPS Architecture for High-Performance Embedded Systems.” Oct. 15, 2003.
(webpage) Cray MTA-2 Historical Technical Papers, http://www.cray.com/products/programs/mta—2/resources.html. (Mar. 12, 2005), (formerly http://www.cray.com/products/systems/mta/psdocs.html (Jul. 2, 2004)).
Zaslavsky, Leonid et al. “A Scalable Approach for Solving Irregular Sparse Linear Systems on the Tera MTA Multithreaded Parallel Shared-Memory.” Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX. Mar. 1999.
Smith, Burton. “From Here to Petaflops.” Keynote Address, Petaflops-systems Operations Working Review, (POWR), Bodega Bay, California, Jun. 1998.
Briggs, Preston. “Tuning the BLAS for the Tera.” Workshop on Multithreaded Execution, Architecture and Compilation. (MTEAC 98), Jan. 1998.
Alverson, Gail et al., “Scheduling on the Tera MTA.” IPPS '95 Workshop on Job Scheduling Strategies for Parallel Processing, Santa Barbara, CA, Apr. 1995, and in D.G.Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science vol. 949, pp. 19-44, Springer-Verlag 1995.
Smith, Burton. “Folklore and Reality in High Performance Computing Slide Presentation.” 1995.
Smith, Burton. “The Quest for General-Purpose Parallel Computing.” 1994.
Alverson, Gail et al. “Exploiting Heterogeneous Parallelism on a Multithreaded Multiprocessor.” 6th ACM International Conference on Supercomputing, Washington DC, Jul. 1992.
Callahan, David. “Recognizing and Parallelizing Bounded Recurrences.” Fourth Workshop on Languages and Compilers for Parallel Computing. pp. 169-184. Aug. 1991.
Callahan, David et al. “Register Allocation via Hierarchical Graph Coloring.” ACM Sigplan '91 Conference on Programming Language Design and Implementation, Jun. 1991.
Alverson, Robert. “Integer Division Using Reciprocals.” 10th IEEE Symposium on Computer Arithmetic, Jun. 1991.
Callahan, David et al. “Improving Register Allocation for Subscripted Variables.” ACM Sigplan Conference on Programming Language Design and Implementation, Jun. 1990.
Alverson, Robert et al. “The Tera Computer System.” ACM International Conference on Supercomputing, pp. 1-6, Jun. 1990.
Smith, Burton. “The End of Architecture.” Keynote Address, 17th Annual Symposium on Computer Architecture, Seattle, Washington, May 1990.
Alverson, Gail et al. “A Future-Based Parallel Language for a General Purpose Highly Parallel Computer.” Languages and Compilers for Parallel Computing. pp. 95-113, MIT Press, Cambridge, Massachusetts, 1990.
“MIT Alewife Project: Home Page.” retrieved from URL: http://catfish.csail.mit.edu/alewife/ on Jul. 2, 2004.
Arvind and R.A. Innaucci. “Two Fundamental Issues in Multiprocessing.” In Proc. Of DFVLF-Conf. 1987 on Par.Proc.in Science and Eng., Bonn-Bad Godesberg, W. Germany, Jun. 1987.
Engelschall, R.S., “pth GNU Portable Threads,” Pth Manual, Online! Feb. 17, 2003, pp. 1-31, XP002315713.
Ishihara et al., “A Comparison of Concurrent Programming and Cooperative Multithreading,” Euro-Par 2000 Parallel Processing. 6th International Euro-Par Conference. Proceedings (Lecture Notes in Computer Science vol. 1900) Springer-Verlag Berlin, Germany, Sep. 1, 2000, pp. 729-738, XP002315714, ISBN: 3-540-67956-1.
Frees, W., “Teilzeitarbeit Im Prozessor,” Electronik, Franzis Verlag GmbH. Munche, DE, vol. 45, No. 9, Apr. 30, 1996, pp. 100-106, XP000595386, ISSN: 0013-5658 (English-language version of the search report or action which indicates the degree of relevance found by the foreign office is appended.).
Scheidhauer, Ralf, “Design, Implementierung und Evaluierung einer virtuellen Maschine fur Oz,” Online!, Dec. 1998, Dissertation, Saarbrucken, (English-language version of the search report or action which indicates the degree of relevance found by the foreign office is appended.).
Mehl et al., “An Abstract Machine for Oz,” Research Report RR-95-08, Online!, Jun. 1995, pp. 1-23, Kaiserslautern Saarbrucken, ISSN 0946-008.
Unger et al., “Utilising Parallel Resources By Speculation,” Parallel and Distributed Processing, 1999. PDP '99. Proceedings of the Seventh Euromicro Workshop on Funchal, Portugal Feb. 3-5, 1999, Los Alamitos, CA, USA, IEEE Computing Society, Feb. 3, 1999, pp. 339-343.
Tsai et al: “The Superthreaded Architecture: Thread Pipelining with Run-Time Data Dependence Checking and Control Speculation,” Parallel Architectures and Compiliation Techniques, 1996, Procee

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

Mechanisms for assuring quality of service for programs... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mechanisms for assuring quality of service for programs..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanisms for assuring quality of service for programs... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2746652

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