Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-04-19
2005-04-19
Kizou, Hassan (Department: 2662)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S462000
Reexamination Certificate
active
06882649
ABSTRACT:
In a system with multiple requesters making multiple requests for resources, an arbiter prioritizes requests based on the number of requests made by a requester. The highest priority is given to a requester that has made the fewest number of requests. Priority may instead be based on the number of requests made for a particular resource. Priority may also be based on a combination of number of requests made by a requester and number of requests made for a resource. The arbiter may also implement a starvation avoidance mechanism such as a round robin scheme.
REFERENCES:
patent: 4648029 (1987-03-01), Cooper et al.
patent: 4760521 (1988-07-01), Rehwald et al.
patent: 4792944 (1988-12-01), Takahashi et al.
patent: 5267235 (1993-11-01), Thacker
patent: 5301279 (1994-04-01), Riley et al.
patent: 5560016 (1996-09-01), Fiebrich et al.
patent: 5564062 (1996-10-01), Meaney et al.
patent: 5577035 (1996-11-01), Hayter et al.
patent: 5617575 (1997-04-01), Sakakibara et al.
patent: 5742594 (1998-04-01), Natarajan
patent: 5835491 (1998-11-01), Davis et al.
patent: 5838681 (1998-11-01), Bonomi et al.
patent: 5884046 (1999-03-01), Antonov
patent: 6023732 (2000-02-01), Moh et al.
patent: 6029217 (2000-02-01), Arimilli et al.
patent: 6034954 (2000-03-01), Takase et al.
patent: 6069573 (2000-05-01), Clark, II et al.
patent: 6072772 (2000-06-01), Charny et al.
patent: 6111886 (2000-08-01), Stewart
patent: 6160812 (2000-12-01), Bauman et al.
patent: 6370148 (2002-04-01), Calvignac et al.
patent: 6449283 (2002-09-01), Chao et al.
patent: 6473103 (2002-10-01), Bailey et al.
patent: 6487213 (2002-11-01), Chao
patent: 6570873 (2003-05-01), Isoyama et al.
patent: 0 463 943 (1992-01-01), None
patent: 0 507 044 (1992-10-01), None
patent: 0 868 054 (1998-09-01), None
patent: 0 869 651 (1998-10-01), None
patent: 1 096 387 (2001-05-01), None
patent: WO 9819439 (1998-05-01), None
patent: WO 9926381 (1999-05-01), None
patent: WO 0029956 (2000-05-01), None
Cell-level path allocation in a three-stage ATM switch Collier, M.; Curran, T.; Communicaitons, 1994. ICC 94, Supercomm/ICC '94, Conference Record, Serving Humanity Through Communications. IEEE International Conference on , May 1-5, 1994 pp.: 1179-1183.*
Path allocation in a three-stage broadband switch with intermediate channel grouping Collier, M.; Curran, T.;INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Mar.-Apr. 28, 1993, p. 927-934.*
Maltz, D.A. et al., “MSOCRS: An Architecture for Transport Layer Mobility”, ISBN: 0-7803-4383-2, pp. 1037-1045.
Watson, R.W. et al., “The Parallel I/O Architecture of the High-Performance Storage System (HPSS)”, Fourteenth IEEE Symposium on Mass Storage Systems, Sep. 11, 1995, pp. 27-44.
Gruber, R. and Dubois-Pelerin Y., “Swiss-Tx: first experiences on the T0 system”, EPFL-SCR No. 10 (http://www.grid-computing.net/documents/article1.pdf), Nov. 1998, 6 pages.
Brauss, S., “Communication Libraries for the Swiss-Tx Machines”, EPFL-SCR No. 11 (http://www.grid-computing.net/documents/article3.pdf), Nov. 1999, 6 pages.
Working Draft, T11.1/Project 1245-D/Rev 1.9, “Information Technology—Scheduled Transfer Protocol (ST)”, May 28, 1998, pp. 1-85.
Tamir and Chi, “Symmetric Crossbar Arbiters for VLSI Communication Switches”, IEEE Transactions on Parallel and Distributed Systems, vol. 4, No. 1, 1993, pp. 13-27.
Boden, Cohen et al., “Myrinet: A Gigabit-per-Second Local Area Network”, IEEE 1995, pp. 29-36.
Tamir and Chi, “Symmetric Crossbar Arbiters for VLSI Communication Switches”, IEEE Transactions on Parallel and Distributed Systems, vol. 4, No. 1, 1993, pp. 13-27.
Kronenberg, Levy et al., “VAXclusters: A Closely-Coupled Distributed System”, ACM Transactions on Computer Systems, vol. 4, No. 2, May 1986, pp. 130-146.
Dally, William J., “Virtual-Channel Flow Control”, IEEE 1990, pp. 60-68.
Chun, Mainwaring et al., “Virtual Network Transport Protocols for Myrinet”, IEEE vol. 18, No. 1, 1998, pp. 52-63.
Pakin, Karamcheti et al., “Fast Messages: Efficient, Portable Communication for Workstation Clusters and MPPs”, IEEE 1997, pp. 60-73.
Karol, Hluchyj et al., “Input Versus Output Queueing on a Space-Division Packet Switch”, IEEE 1987, pp. 1347-1356.
Scott and Thorson, “The Cray T3E Network; Adaptive Routhing in a High Performance 3D Torus”, HOT Interconnects IV, Stanford University, Aug. 15-16, 1996, pp. 1-10.
Mainwaring and Culler, “Design Challenges of Virtual Networks: Fast, General-Purpose Communication”, ACM Sigplan Symposium on Principles and Practice of Parallel Programming (PPOPP), Atlanta, GA, May 4-6, 1999.
Chun, Mainwaring et al., “Virtual Network Transport Protocols for Myrinet”, Computer Science Division University of California at Berkeley, Aug. 20, 1997, pp. 1-14.
Scott, Steven L., “Synchronization and Communication in the T3E Multiprocessor”, Cray Research, Inc., 1996, pp. 26-36.
Mainwaring and Culler, “Active Message Applications Programming Interface and Communication Subsystem Organization”, Draft Technical Report, Computer Science Division University of California at Berkeley, Technical Report UCB CSD-96-918, Oct. 1996, pp. 1-45.
Sun Microsystems, Inc., “The Sun Enterprise Cluster Architecture Technical White Paper”, 1997, pp. 1-74.
IBM, “JES2 Introduction”, Document No. GC28-1794-02, Third Edition, 1997, pp. 1-51.
ANSI, “Information Technology—Scheduled Transfer Protocol (ST)”, T11.1/Project 1245-D/Rev. 3.6, Jan. 31, 2000, pp. 1-97.
Eberle Hans
Gura Nils
Kizou Hassan
Levitan Dmitry
Zagorin O'Brien Graham LLP
LandOfFree
Least choice first arbiter does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Least choice first arbiter, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Least choice first arbiter will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3387876