Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
2005-08-09
2005-08-09
Alam, Hosain (Department: 2155)
Electrical computers and digital processing systems: multicomput
Computer network managing
C709S240000, C711S114000, C711S151000
Reexamination Certificate
active
06928470
ABSTRACT:
A network switch is disclosed for resolving requests from a plurality of host initiators by scheduling access to a plurality of disk storage devices. The network switch comprises a switched fabric comprising a plurality of switching elements. Each switching element comprises a plurality of bi-directional switched fabric ports, and a control input connected to receive switch control data for selectively configuring the switching element in order to interconnect the bi-directional switched fabric ports. The network switch further comprises a memory for storing a routing and scheduling program, and a microprocessor, responsive to the requests, for executing the steps of the routing and scheduling program to generate the switch control data to transmit scheduled requests through the bi-directional switched fabric ports. At least one of the plurality of switching elements comprises a disk storage interface for connecting to a selected one of the disk storage devices. The microprocessor schedules access to the plurality of disk storage devices through the disk storage interface. The disk storage interface receives scheduling data from the selected one of the storage devices, and the memory stores the scheduling data received via the bi-directional switched fabric ports of a selected number of the switching elements. The scheduling data is processed according to a priority such that the selected switching elements transfer the scheduling data through the bi-directional switched fabric ports before transferring data associated with the scheduled requests.
REFERENCES:
patent: 5157654 (1992-10-01), Cisneros
patent: 5291482 (1994-03-01), McHarg et al.
patent: 5297262 (1994-03-01), Cox et al.
patent: 5521928 (1996-05-01), Worsley et al.
patent: 5566169 (1996-10-01), Rangan et al.
patent: 5787482 (1998-07-01), Chen et al.
patent: 5854941 (1998-12-01), Ballard et al.
patent: 5862403 (1999-01-01), Kanai et al.
patent: 5890202 (1999-03-01), Tanaka
patent: 5996014 (1999-11-01), Uchihori et al.
patent: 6055618 (2000-04-01), Thorson
patent: 6148414 (2000-11-01), Brown et al.
patent: 6381647 (2002-04-01), Darnell et al.
patent: 6421711 (2002-07-01), Blumenau et al.
patent: 6496899 (2002-12-01), DeMoney
patent: 6545978 (2003-04-01), Sakurai
patent: 6603625 (2003-08-01), Hospodor et al.
patent: 6654195 (2003-11-01), Frank et al.
patent: 6691198 (2004-02-01), Hamlin
patent: 6697914 (2004-02-01), Hospodor et al.
Aaron Brown, “The UC Berkeley ISTORE Project: Bringing Availability, Maintainability, and Evolutionary Growth to Storage-Based Clusters”, http://iram.CS.Berkeley.EDU/istore/talks/lucnet-jan00/sld001.htm, Jan. 19th, 2000.
Alam Hosain
Bates Kevin
Shara, Esq. Milad G.
Sheerin, Esq. Howard H.
Western Digital Ventures, Inc.
LandOfFree
Transferring scheduling data from a plurality of disk... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Transferring scheduling data from a plurality of disk..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transferring scheduling data from a plurality of disk... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3522920