The present invention relates to computer systems and, more specifically, to discovery of virtual images located at endpoints of a storage area network.
A computer network may include multiple physical nodes (i.e., physical devices). In some instances, one or more of the physical nodes may include virtualization capabilities. Accordingly, each physical node may represent one or more virtual devices. For simplicity, virtual and real devices will both be referred to as “images.” For example, a network may include a host computing device coupled to one or more storage devices. The host computing device may be divided into one or more logical partitions (LPARs) and the storage device may be divided into multiple virtual devices.
In order to determine the topology of the network, a network protocol such as the fibre channel protocol may provide commands that allow for topology discovery. Such discovery, however, is currently limited to the discovery of physical nodes (i.e., physical devices). In such a protocol, the commands may be directed to the directory service to determine the number and types of physical nodes registered in the fabric and characteristics about them. The characteristics may include the node's unique name and the protocols supported by the node.
However, because virtualization is provided through mechanisms typically contained within firmware of each physical node, the virtual configuration (e.g. the virtual control units within a storage unit) may not be revealed by these commands. As a result, the logical endpoints of a network behind the physical endpoints are not easily discovered.
In some systems commands exist to determine the current logical connections that exist between LPARS and virtual control units. Specifically, in the FC-SB-4 protocol, the Test Initialization (TIN) FC-SB-4 command may discover the logical control units coupled to a particular LPAR. However, no mechanism exists to discover which of the logical control units has been defined and is addressable (e.g., is available at an “endpoint”). As virtualization of endpoints has become the more widespread, it is advantageous during the discovery process to be able to determine the logical configurations behind the physical nodes, just as it is to discover the physical nodes in the first place.
Currently, for a first logical image (e.g. an LPAR) at one endpoint to determine the existence of another logical image (e.g., a virtual control unit) at another endpoint, the first logical image needs to allocate all possible other logical images at the second endpoint and then determine if each one exists. Such a process, however, is not direct and requires that an inference be made to conclude if a particular logical image exists.
For example, consider a network in which an LPAR is attempting to determine the existence of logical control unit images within a storage device. The LPAR may have to define as many as 256 logical control unit images for the device and as many as 256 devices for each logical control unit. The LPAR then issues commands to each device in order to determine, based on the responses to those commands, whether any device on the logical control unit exists. If a device exists, it can be inferred that the logical control unit exists. With potentially each LPAR needing to determine this information by issuing the same volume of commands, the associated network traffic is multiplied and may lead to network performance degradation.
According to one embodiment of the present invention, a method for detecting virtual images in a network is provided. The network includes a host system and a plurality of physical devices in operable communication with one another. The method includes: forming a query packet at the host system; providing the query packet to at least one of the plurality of physical devices; forming at the at least one of the plurality of physical devices a first vector in response to the query packet, the first vector including a bit for each possible virtual image that may be formed in the at least one of the plurality of devices and indicating which of the virtual images are configured and addressable; and providing the first vector to the host system.
According to another embodiment of the present invention, a system that includes a host system configured to form a query packet and a physical device coupled to the host system is provided. In this embodiment, the physical device is configured to receive the query packet and to form a first vector in response to the query packet, the first vector including a bit for each possible virtual image that may be formed in the at least one of the plurality of devices and indicating which of the virtual images are configured and addressable.
According to yet another embodiment of the present invention, a system comprising a physical device configured to form a query packet and a host system coupled to the physical device is disclosed. in this embodiment, the host system is configured to receive the query packet and to form a first vector in response to the query packet, the first vector including a bit for each possible virtual image that may be formed in the host system and indicating which of the virtual images are configured and addressable.
Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention. For a better understanding of the invention with the advantages and the features, refer to the description and to the drawings.
The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The forgoing and other features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
In view of the performance and resource consumption problems described above, embodiments of the present invention may provide systems and methods for endpoint determination. In one embodiment this may include determining each virtual image that has been allocated within a physical node.
In one embodiment, the physical node may receive a query packet. The physical node may include programming (in either hardware, software, or a combination of both) that generates a particular response to the query packet. The response packet may indicate which of the possible virtual images within the physical node have been allocated. This response packet may, therefore, decrease the number of packets/commands that a logical image on a physical node needs to send to each other node in order to determine the logical images behind the other nodes.
In one embodiment, usage of this new packet can decrease the number of packets which must be sent as part of logical fabric discovery to fewer than 1% of the number currently required. Accordingly, embodiments disclosed herein may decrease the number of discovery packets which need to be sent and eliminates the need for resource consumption to discover non-existent images. Embodiments of the present invention may also reduce the time it takes to dynamically define/change the host resources to be associated with each image just to test the existence of each image.
The system 100 may also include one or more physical devices 109. The physical devices 109 may be, for example, storage devices. In embodiment, one or more of the physical devices 109 may include two or more virtual images 110. Each virtual image 110 may be coupled to one or more devices. In the case where the physical device is a storage unit, each virtual image 110 may be coupled to a particular memory range of the memory contained in storage unit.
Main memory 102 stores data and programs and may receive data from or provide data to the virtual images 110. For example, the main memory 102 may include one or more operating systems (OSs) 103 that are executed by one or more of the LPARs 104. For example, one LPAR 104 can execute a Linux® operating system 103 and a another LPAR 104 can execute a z/OS® operating system 103 as different virtual machine instances. The main memory 102 is directly addressable and provides for high-speed processing of data by the LPARs 104 and the channel subsystem 108.
The LPARs 104 are the controlling center of the system 100. They provide sequencing and processing facilities for instruction execution, interruption action, timing functions, initial program loading, and other machine-related functions. LPARs 104 are coupled to the storage control element 106 via a connection 114, such as a bidirectional or unidirectional bus.
Storage control element 106 is coupled to the main memory 102 via a connection 116, such as a bus and to channel subsystem 108 via a connection 118. Storage control element 106 controls, for example, queuing and execution of requests made by LPARs 104 and channel subsystem 108.
In an exemplary embodiment, channel subsystem 108 provides a communication interface between host system 101 and the physical devices 109. Channel subsystem 108 is coupled to storage control element 106, as described above, and to each of the physical devices via a connection 120, such as a serial link. Connection 120 may be implemented as an optical link, employing single-mode or multi-mode waveguides in a Fibre Channel fabric.
Channel subsystem 108 directs the flow of information between virtual images 110 (and the memory they are coupled to) and main memory 102. It relieves the LPARs 104 of the task of communicating directly with the physical devices and permits data processing to proceed concurrently with I/O processing.
Each channel 124 within the channel subsystem 108 may be coupled to one or more switches 122. The switches 122 may provide the capability of physically interconnecting any two links that are attached to the switch 122. Each switch 122 may be connected to one or more physical devices 109.
As discussed above, the channel subsystem 108 is coupled to one or more physical devices 109. Each physical device 109 includes one or more virtual images 110. The virtual images 110, in one embodiment, may provide logic to operate and control one or more devices or memory ranges.
One or more of the above components of the system 100 are further described in “IBM® z/Architecture Principles of Operation,” Publication No. SA22-7832-05, 6th Edition, April 2007; U.S. Pat. No. 5,461,721 entitled “System For Transferring Data Between I/O Devices And Main Or Expanded Storage Under Dynamic Control Of Independent Indirect Address Words (IDAWS),” Cormier et al., issued Oct. 24, 1995; and U.S. Pat. No. 5,526,484 entitled “Method And System For Pipelining The Processing Of Channel Command Words,” Casper et al., issued Jun. 11, 1996, each of which is hereby incorporated herein by reference in its entirety. IBM is a registered trademark of International Business Machines Corporation, Armonk, N.Y., USA. Other names used herein may be registered trademarks, trademarks or product names of International Business Machines Corporation or other companies.
From
In the prior art, to discover all of the virtual images 110 in each physical device 109, an LPAR (for example, LPAR 104a) would have had to define each virtual image 110. Then, the LPAR 104a would have sent a command to each image and awaited a response. If a positive response was received, the virtual image 110 existed. As the number of LPARs increases and the number of virtual images 110 increase, discovery in this manner may, as described above, have adverse effects on the network 100 due to traffic increases.
In one embodiment, the logical images 110 are logical control units. In that embodiment, the logical control units 110 control the operation of one or more input/output devices. Accordingly, in that embodiment, the controlled elements 201 may be input/output devices. In another embodiment, the logical images 110 control access to memory ranges in a storage device. In such an embodiment, the controlled elements 201 are memory ranges. In one embodiment, one or more of the logical images 110 may be coupled to one or more controlled elements 201. The controlled elements 201 may be located within or outside of the physical device 109.
In one embodiment, from the point of view of a device external to the physical device 109, the logical images 110 are “behind” the physical device 109. The number of logical images 110 may vary between 1 and 256 and each logical image 110 may be coupled to up to 256 controlled elements 201. Furthermore, each controlled elements 201 are “behind” the logical images 110.
The physical device 109 may include an allocation unit 204. The allocation unit 204 may form or otherwise define the logical images 110 based on configuration files or user input. In one embodiment, the allocation unit 204 creates a vector 206. The vector 206 may include a bit position for each possible logical image 110. For example, if the control unit 110 may support 256 logical control units, the vector may be 256 bits wide and contain an indication in each bit if the corresponding logical control unit is defined and addressable. The vector 206 may be created when logical images 110 are created or at later time.
It should be understood that the allocation unit 204 may form a different 256 bit vector for each possible requester (e.g., LPAR) in the host system. The allocation unit 204 may include instructions that indicate that it is only allowed to provide information about certain logical control units 110 to particular requesters. In such a case, any “disallowed” logical control units 110 for a particular LPAR are indicated as non-addressable in the vector.
The physical device 109 may also include a request handler 208. The request handler 208 may receive a query request 210 and produce a query response 212.
The query request 210 also includes a query command 302. The query command 302 indicates that the requesting device (e.g., host system 101 of
The query request 210 may also include a request base 304. The request base indicates the number of the base requesting image of the requesting device. For example, the request based 304 may identify one of the several LPARs 104 of the host system 101. The query request 210 may also include a count field 306. The count field 306 indicates the number of requesting images, starting from the request base 304, that are participating in the request. In one embodiment, the request base may vary from a value of the 0 to 256. It shall be understood from the following description, that the count field 306 determines the size of the query response 212 (
The query response 212 may include up to n−1 additional vectors (402b-402n) where n is equal to the count 306 (
At a block 508, the vector 206 is provided to the request handler. At a block 510, a vector for each subsequent requesting image is produced in the same manner as described above. At a block 512 each of vectors received in steps 506 and 508 are assembled into a TINCR and returned to the host system 101.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, element components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated
The flow diagrams depicted herein are just one example. There may be many variations to this diagram or the steps (or operations) described therein without departing from the spirit of the invention. For instance, the steps may be performed in a differing order or steps may be added, deleted or modified. All of these variations are considered a part of the claimed invention.
While the preferred embodiment to the invention had been described, it will be understood that those skilled in the art, both now and in the future, may make various improvements and enhancements which fall within the scope of the claims which follow. These claims should be construed to maintain the proper protection for the invention first described.
Number | Name | Date | Kind |
---|---|---|---|
4104539 | Hase | Aug 1978 | A |
4611319 | Naito | Sep 1986 | A |
4644443 | Swensen et al. | Feb 1987 | A |
5027254 | Corfits et al. | Jun 1991 | A |
5438575 | Bertrand | Aug 1995 | A |
5568365 | Hahn et al. | Oct 1996 | A |
5663919 | Shirley et al. | Sep 1997 | A |
5949646 | Lee et al. | Sep 1999 | A |
5963425 | Chrysler et al. | Oct 1999 | A |
6112311 | Beardsley et al. | Aug 2000 | A |
6301133 | Cuadra et al. | Oct 2001 | B1 |
6341064 | Bradley | Jan 2002 | B1 |
6362942 | Drapkin et al. | Mar 2002 | B2 |
6523140 | Arndt et al. | Feb 2003 | B1 |
6538881 | Jeakins et al. | Mar 2003 | B1 |
6594148 | Nguyen et al. | Jul 2003 | B1 |
6595018 | Goth et al. | Jul 2003 | B2 |
6625648 | Schwaller et al. | Sep 2003 | B1 |
6658599 | Linam et al. | Dec 2003 | B1 |
6845428 | Kedem | Jan 2005 | B1 |
7004233 | Hasegawa et al. | Feb 2006 | B2 |
7007099 | Donati et al. | Feb 2006 | B1 |
7032052 | Sauber et al. | Apr 2006 | B2 |
7053502 | Aihara et al. | May 2006 | B2 |
7075788 | Larson et al. | Jul 2006 | B2 |
7093155 | Aoki | Aug 2006 | B2 |
7096308 | Main et al. | Aug 2006 | B2 |
7107331 | Gava et al. | Sep 2006 | B2 |
7134040 | Ayres | Nov 2006 | B2 |
7152136 | Charagulla | Dec 2006 | B1 |
7163546 | Mirizzi et al. | Jan 2007 | B2 |
7206946 | Sakakibara et al. | Apr 2007 | B2 |
7219181 | Carty | May 2007 | B2 |
7260620 | Halasz | Aug 2007 | B1 |
7313643 | Sakurai et al. | Dec 2007 | B2 |
7464174 | Ngai | Dec 2008 | B1 |
7478167 | Ould-Brahim et al. | Jan 2009 | B2 |
7535828 | Raszuk et al. | May 2009 | B2 |
7558348 | Liu et al. | Jul 2009 | B1 |
7594144 | Brandyberry et al. | Sep 2009 | B2 |
7836254 | Gregg et al. | Nov 2010 | B2 |
7873851 | Linnell et al. | Jan 2011 | B1 |
7975076 | Moriki et al. | Jul 2011 | B2 |
8032684 | Pettey et al. | Oct 2011 | B2 |
8041811 | Calippe et al. | Oct 2011 | B2 |
8046627 | Takubo | Oct 2011 | B2 |
8082466 | Tanaka et al. | Dec 2011 | B2 |
8140917 | Suetsugu et al. | Mar 2012 | B2 |
20020049815 | Dattatri | Apr 2002 | A1 |
20020112067 | Chang et al. | Aug 2002 | A1 |
20030097503 | Huckins | May 2003 | A1 |
20030177221 | Ould-Brahim et al. | Sep 2003 | A1 |
20030200477 | Ayres | Oct 2003 | A1 |
20040024905 | Liao et al. | Feb 2004 | A1 |
20040130868 | Schwartz et al. | Jul 2004 | A1 |
20040136130 | Wimmer et al. | Jul 2004 | A1 |
20050024187 | Kranz et al. | Feb 2005 | A1 |
20050116546 | Zeighami et al. | Jun 2005 | A1 |
20050160214 | Sauber et al. | Jul 2005 | A1 |
20050162830 | Wortman et al. | Jul 2005 | A1 |
20050213513 | Ngo et al. | Sep 2005 | A1 |
20050276017 | Aziz et al. | Dec 2005 | A1 |
20050289278 | Tan et al. | Dec 2005 | A1 |
20060053339 | Miller et al. | Mar 2006 | A1 |
20060085150 | Gorin | Apr 2006 | A1 |
20060095607 | Lim et al. | May 2006 | A1 |
20060206639 | Tee et al. | Sep 2006 | A1 |
20060236054 | Kitamura | Oct 2006 | A1 |
20060291447 | Siliquini et al. | Dec 2006 | A1 |
20070008663 | Nakashima et al. | Jan 2007 | A1 |
20070078996 | Chen et al. | Apr 2007 | A1 |
20070211430 | Bechtolsheim | Sep 2007 | A1 |
20070226523 | Chang | Sep 2007 | A1 |
20070262891 | Woodral et al. | Nov 2007 | A1 |
20070273018 | Onozuka et al. | Nov 2007 | A1 |
20070288715 | Boswell et al. | Dec 2007 | A1 |
20080065796 | Lee et al. | Mar 2008 | A1 |
20080069141 | Bonaguro et al. | Mar 2008 | A1 |
20080077817 | Brundridge | Mar 2008 | A1 |
20080147943 | Freimuth et al. | Jun 2008 | A1 |
20080192431 | Bechtolsheim | Aug 2008 | A1 |
20080263246 | Larson et al. | Oct 2008 | A1 |
20080288661 | Galles | Nov 2008 | A1 |
20060237636 | Gurevich et al. | Dec 2008 | A1 |
20080301487 | Hatta et al. | Dec 2008 | A1 |
20090037682 | Armstrong et al. | Feb 2009 | A1 |
20090210527 | Kawato | Aug 2009 | A1 |
20090276551 | Brown et al. | Nov 2009 | A1 |
20090276773 | Brown et al. | Nov 2009 | A1 |
20100002755 | Heidari et al. | Jan 2010 | A1 |
20100005531 | Largman et al. | Jan 2010 | A1 |
20100042999 | Dorai et al. | Feb 2010 | A1 |
20100077117 | Asnaashari | Mar 2010 | A1 |
20100115329 | Tanaka et al. | May 2010 | A1 |
20100131359 | Ting et al. | May 2010 | A1 |
20100146089 | Freimuth et al. | Jun 2010 | A1 |
20100157463 | Arizono et al. | Jun 2010 | A1 |
20100169674 | Kazama | Jul 2010 | A1 |
20100205608 | Nemirovsky et al. | Aug 2010 | A1 |
20100211714 | LePage | Aug 2010 | A1 |
20100287209 | Hauser | Nov 2010 | A1 |
20100312894 | Awad et al. | Dec 2010 | A1 |
20110029696 | Uehara | Feb 2011 | A1 |
20110029734 | Pope et al. | Feb 2011 | A1 |
20110131359 | Pettey et al. | Jun 2011 | A1 |
20110219161 | Deshpande et al. | Sep 2011 | A1 |
20110258352 | Williams et al. | Oct 2011 | A1 |
20110265134 | Jaggi et al. | Oct 2011 | A1 |
20110320653 | Lais et al. | Dec 2011 | A1 |
20110320675 | Gregg et al. | Dec 2011 | A1 |
Entry |
---|
International Search Report for PCT/EP2011/059810, Sep. 14, 2011. |
Final Office Action Received Mar. 2, 2012 for U.S. Appl. No. 12/821,221. |
PCI Express Base Specification Rev 1.0a, Apr. 15, 2003 p. 1-2, 31, 35-36, 43-44, 49-51, 55, 59-62, 74, 101. |
Number | Date | Country | |
---|---|---|---|
20110320602 A1 | Dec 2011 | US |