Abstract:
An improved architecture for switches and a method for transmitting data with the switching are disclosed. An increased amount of memory is utilized, operating at speeds lower than are required by Input Queued switches, and a simple scheduling algorithm. The architecture divides the input ports into groups, where each input port group has an associated set of memory elements. Incoming packets are routed to the appropriate element in the set of memory elements. The number of groups and the number of ports that are included in each group can be varied, allowing the architecture to be modified based on the system architecture, the semiconductor technology, and other design considerations.

Description:
BACKGROUND OF THE INVENTION 
     In computer networks, information is constantly being moved from a source to a destination, typically in the form of packets. In the simplest situations, the source and destination are directly connected and the packet of information passes from the source to the destination, without any intermediate stages. However, in most networks, there are at least one, if not multiple, intermediate stages between the source and the destination. In order for the information to move from the source to the destination, it must be routed through a set of devices that accept the packet and pass it along a predetermined path toward the destination. These devices, referred to generically as switches, are typically configured to accept packets from some number of input ports and transmit that information to an output port, which was selected from a plurality of ports. Often, ports are capable of both receiving and transmitting, such that the input and output ports are the same physical entities. 
     In an ideal network, traffic arrives at an input port of a switch. The switch determines the appropriate destination for the packet and immediately transmits it to the correct output port. In such a network, there is no need for storing the packet of information inside the switch, since the switch is able to transmit the packet as soon as it receives it. 
     However, because of a number of factors, this ideal behavior is not realizable. For instance, if the switch receives packets on several of its input ports destined for the same output port, the switch must store the information internally, since it cannot transmit all of these different packets of information simultaneously to the same output port. In this case, the output port is said to be “congested”. This term also describes the situation in which the device to which this output port is connected is unable to receive or process packets at the rate at which they arrive for some reason. In such a case, the switch must store the packet destined for that output port internally until either the offending device is able to receive more information or the packet is discarded. 
     While it is possible that external factors may cause a switch to store packets rather than transmitting them immediately, it is a design goal of nearly all switches that they are able to process packets at the rate at which they are received. The speed at which packets are received, also known as line rate, is a critical parameter in the design of the switch. 
     Switches typically have a set of inputs, or input ports, where data enters the device. Similarly, switches also have a set of outputs, or output ports, whereby data exits the device. In many implementations, an input port and an output port will share a common physical connection, at the point where the device interfaces with other components. This point is typically the device&#39;s interface with the other components, and can be a lead or pin exiting the device, or an internal interconnect within a larger device, of which this specific switch is only a subset. Thus, in many implementations, the number of output ports and the number of input ports will be identical. 
     The design goal for a switch is that data can exit the output ports at the same rate as it entered the input ports, although it may be somewhat delayed. Several mechanisms have been developed to meet this requirement. 
     One such mechanism, known as input queuing is shown in  FIG. 1 . Input ports, I 0  through I n−1 , are each associated with a memory element, M 0  through M n−1 . Each memory element receives input data only from its associated input port. In addition to the input ports, each switch has a set of output ports. Typically, the number of input ports and output ports are identical, although this is not a requirement. The data received by any input port can be destined for any of the N output ports in the switch, thus connections between each memory element and each output port are shown. 
     In the worst case scenario, shown in  FIG. 2 , each input port receives data, in the form of a packet, destined for port O 0  during the first time slot. Each packet is labeled with its destination output port, followed by the time slot during which it is to be transmitted. In the next time slot, each port, except I 0  receives a packet for port O 1 . This pattern continues, so that in time slot N, only port I n−1 , receives a packet destined for port O n−1 . 
     In a non-blocking, ideal switch, the switch should be able to deliver the packets to the output ports in the minimum time period. As shown in  FIG. 2 , in time slot  0 , output port O 0  transmits its first packet. Since no packets have arrived yet for any other output ports, the other output ports remain idle. During the next time slot, the packets that arrived at input port I 1  that are destined for output ports O 0  and O 1  are both sent. This process continues and in the general case, during time slot k, all packets that arrived at input port I k  up to that point are all transmitted simultaneously on output ports O 0  through O k . Therefore, memory element M k  must be able to supply data at full line rate to k output ports during a single time slot. In order to achieve this result, it follows that memory element M k  must run at a speed of k multiplied by the line rate. Thus, for a switch with N input ports, the memory elements must be able to supply data at N times the line rate of the switch. Since each memory element must also be able to receive a new incoming packet while transmitting to all output ports simultaneously, each memory element must run at a speed of at least (N+1) multiplied by the line rate. 
     A second consideration in the design of a switch is the amount of memory that is consumed. The amount of memory at each input port must be at least equal to the amount of buffering that is communicated to the neighboring switch. In the above example, if each input port had communicated that an amount of memory, M, was available, then the total memory in the switch can be expressed as N multiplied by M, where N is the number of input ports and M is the amount of memory at each input port. 
     A third consideration in the design of a switch is the complexity of scheduling the transmission of packets. The receipt of packets is achieved by having sufficient memory available at the input port. The transmission of packets to their respective output ports is most typically done through the use of a high speed scheduler, which typically uses a time multiplexing scheme to allocate a slice of each time slot to each output port in sequence. Although running at high speed, the scheduling algorithm is very simple and straightforward. This minimizes the time to design and verify its operation, which is often a key consideration in the design of new devices. 
     The first line of Table 1 illustrates the memory size and speed characteristics associated with a 12 port switch using an input queued structure. 
     
       
         
               
               
               
             
           
               
                 TABLE 1 
               
               
                   
               
               
                 Type of Switch 
                 Memory Size 
                 Memory Speed 
               
               
                   
               
             
             
               
                 Input Queued 
                 12*M 
                 13 * line rate 
               
               
                 Central Memory 
                 12*M 
                 24 * line rate 
               
               
                 CIOQ 
                 18*M 
                  3 * line rate 
               
               
                   
               
             
          
         
       
     
     A second mechanism, using a centralized memory structure, can also be used to implement a switch. This mechanism, known as an output port queued switch with a centralized memory is shown in  FIG. 3 . In this implementation, rather than having separate memories as with input port queues, a single large memory is used. All of the input and output ports communicate with this centralized memory. 
     Referring to  FIG. 4 , it can be seen that there are scenarios in which each of the N input ports and each of the N output ports must be able to communicate simultaneously with the memory in order for it to operate in its most efficient manner. In the first time slot, each input port receives a packet destined for a different output port, scheduled for delivery in that time slot. To achieve this result, the memory must be able to complete all of these operations in a single time slot. In other words, the memory must operate at the line rate, multiplied by the total number of ports. Thus, the memory must operate at a speed of at least 2*N multiplied by the line rate of the incoming data, assuming that the number of output ports is the same as the number of input ports. 
     Since all N of the input ports must communicate with the single centralized memory, that memory must be large enough to accommodate the sum of amount of buffering that each input port has communicated to the neighboring switch. In this example, if each input port had communicated that an amount of memory M, was available, then the total memory in the switch can be expressed as N multiplied by M, where N is the number of input ports and M is the amount of memory at each input port. 
     The design of the scheduler is roughly equivalent to that of the input queued switch described above, where the scheduling uses a time multiplexing scheme to allocate a portion of each time slot to each output port. 
     The second line of Table 1 illustrates the memory size and speed characteristics associated with a 12 port switch using a output queued structure with a centralized memory. 
     Using current technologies, it is typically more feasible to include additional memory within a semiconductor device than it is to increase the speed of that memory. Consequently, much effort has been expended in both the intellectual and commercial pursuit of switches that can operate at lower memory speeds, even at the expense of adding memory elements. 
     One such implementation is known as combined Input-Output Queued (CIOQ) switch, as shown in  FIG. 5 . In this structure, a memory element is associated with each input port, as is done in the input queued switch. However, an additional memory element is associated with each output port as well. This additional memory element at each output port allows data to be moved from the input queues to the output queues, not only when it is being transmitted, but also during idle times. This alleviates the very high bandwidth requirements associated with the input queued switch. 
     Referring back to  FIG. 2 , the worst case traffic pattern for an input queued switch is also the worst case pattern for a CIOQ switch. Numerous research papers, such as Matching Output Queueing with a Combined Input Output Queued Switch, which was published by Stanford University and presented at Infocom &#39;99, and is hereby incorporated by reference, have shown that a CIOQ switch can properly emulate a input queued switch for a broad class of scheduling algorithms if the transfers between the input queues and the output queues are performed at twice the line rate. Thus, the memory elements with a CIOQ switch need only operate at three times the line rate, to account for the two times line rate internal transmissions plus the external line rate transmission. This structure produces a much lower memory speed requirement than either of the other prior art approaches, especially as the number of ports increases. 
     To implement this structure requires memory elements associated with each input port and memory elements associated with each output port. As described earlier, the amount of memory at each input port is related to the available buffering that the port has communicated to the neighboring switch. The memory elements associated with the output ports are used to hold packets before being transmitted via the output port. These elements typically do not need to be as large as those associated with the input ports, and preferably are roughly half as large. Therefore, the amount of memory needed for the memory elements associated with the input ports, as before, is N multiplied by M, while the amount of memory associated with the output ports is N multiplied by M/2. This results in a total memory size of 1.5*N*M. 
     The third line of Table 1 illustrates the memory size and speed characteristics associated with a 12 port switch using a combined input output queued structure. 
     The CIOQ significantly reduces the required speed of the memory in exchange for a modest increase in the amount of memory. Based on current semiconductor technologies, this would appear to be the proper tradeoff. However, the CIOQ is not without significant drawbacks. 
     In order to achieve the benefits highlighted above, a complex scheduling algorithm is required. In fact, the previously cited Stanford paper states that the significant reduction in memory bandwidth comes at the expense of the scheduling algorithm. It further states that the algorithms proposed in the paper are not suitable for high port count switches. Other algorithms are possible; however, it requires significant development and testing time to verify that the scheduling algorithm works correctly under all types of traffic patterns and conditions. Mistakes in the algorithm will cause the switch to not forward packets efficiently, leading to potential network performance degradation. Furthermore, the development and testing of such a complex scheduling algorithm is a time consuming process, which could adversely affect the ability to bring the switch to market in a timely manner. Complex algorithms are also very difficult to implement in silicon. The scheduling algorithm must be designed to operate at a sufficiently high speed so as to keep up with the switching rate of the memories. As the algorithm becomes more complex and more steps are added, it becomes increasingly difficult to meet the required time constraints for the scheduling circuitry. It can then require significant development time to find the proper trade-offs between scheduling complexity, performance, and speed. These issues counteract the benefits in memory bandwidth described earlier, making the CIOQ switch less desirable. 
     Several trends in integrated semiconductor circuit design and overall system design give rise to the need for a new type of switch architecture. First, the line rate between switches continues to increase at a faster rate than the speed of the memory elements within the integrated circuits, Thus, it is becoming more and more difficult to develop input queued switches with the required memory bandwidth. Second, the number of ports on each switch continues to increase, putting further pressure on the memory bandwidth. Third, as semiconductor geometries continue to shrink, many integrated circuit (IC) designs are now pad-limited. This means that the size of the die is determined by the number of bonding pads that are required and not by the size of the logic within the IC. Therefore, the amount of logic within the chip can grow without affecting its cost, since the die size remains unchanged. Fourth, although logic and memory elements can be added without a monetary cost, there are hidden costs. For example, as memories increase in size, they decrease in speed. However, this relationship is not proportional; a increase of 100% in memory size will result in a memory speed decrease of about 10-20%. Also, the addition of more logic, specifically complex scheduling logic, can significantly impact the time it takes to develop and fully test a new switching IC. Furthermore, it is also difficult to run large complicated logic at very high speed due to the irregularities of layout and routing. 
     Based on these trends, several conclusions can be drawn. The first is that increasing the amount of memory to an IC generally is less expensive in terms of cost and time than increasing the speed of those memories. The second conclusion is that complicated, time-critical logic increases the risk of failure and the development time, and should be avoided as much as is possible. 
     SUMMARY OF THE INVENTION 
     The problems with the prior art have been overcome with this invention, which provides an improved architecture for switches. The current trends in semiconductor design suggest that increasing the amount of memory within an integrated circuit is less costly than increasing the speed of that memory. It is also well known that complex, high speed logic can present difficulties in terms of design and testing, which can adversely affect the timely delivery and quality of new switches. The present invention utilizes an increased amount of memory, operating at speeds lower than are required by Input Queued switches, and a simple scheduling algorithm. The architecture of the present invention divides the input ports into groups, where each input port group has an associated set of memory elements. Incoming packets are routed to the appropriate element in the set of memory elements. The number of groups and the number of ports that are included in each group can be varied, allowing the architecture to be modified based on the system architecture, the semiconductor technology, and other design considerations. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  illustrates a typical topology for a non-blocking input queued switch; 
         FIG. 2  illustrates the worst case traffic pattern for the switch of  FIG. 1 ; 
         FIG. 3  illustrates a typical topology for a non-blocking output queued switch with a central memory; 
         FIG. 4  illustrates the worst case traffic pattern for the switch of  FIG. 3 ; 
         FIG. 5  illustrates a typical topology for a combined input-output queued (CIOG) switch; 
         FIG. 6  illustrates the topology of the switching architecture in accordance with the present invention; and 
         FIG. 7  illustrate a specific embodiment of a twelve port switch in accordance with the present invention. 
     
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     Switches are used to logically connect a set of input ports to a set of output ports. Most typically, the number of input ports is identical to the number of output ports, although this is not a requirement.  FIG. 6  shows the topology of a switch in accordance with the present invention. In this figure, the number of input ports and the number of output ports are identical, and are both represented by the expression: 
     X multiplied by Y, where the terms X and Y will be described in more detail below. 
     Referring again to  FIG. 6 , the port logic for group  0  is generally shown at  10 . Group  0  is a subset of the total number of ports contained in the device. In this embodiment, there are a number of groups, where each group represents a subset of the total number of ports. These subsets are non-overlapping, such that the each port is contained in only one group. The port logic  10  comprises logic associated with the input ports  20  and logic associated with the output ports  30 . In this embodiment, there are Y input ports and Y output ports associated with port logic  10 . Although this description assumes that the number of input ports is the same as the number of output ports, and that the number of total ports in the device is not a prime number, the invention is not so limited. The architecture can also be employed when there are different numbers of input and output ports, and can be used for any number of ports. 
     In the preferred embodiment, there are X identical instances of the port logic incorporated in the switch, corresponding to X different groups of input and output ports. Thus, the total number of ports is expressed as Y ports/group multiplied by X groups, or X multiplied by Y. Although this is the preferred embodiment, each group need not be identically configured. 
     The operation of the switch will be described with respect to port logic  10 . Packets from the first input port group arrive at the time multiplexed packet router  21 . The router  21  preferably identifies the output port for which the packet is destined. Based on this information, it routes the packet to a specific memory element  22 . Each memory element  22  is associated with a group, which is a set of output ports. In  FIG. 6 , output ports  0  through Y− 1  are associated with group  0 , output ports Y through 2*Y− 1  are associated with group  1 , etc., where Y is the number of output ports per group. Therefore, if the incoming packet was destined for output port  0 , the router  21  would place the packet in the memory element associated with group  0  ( 22   a ). Similarly, if the packet were destined for output port X*Y− 1 , the router  21  would place the packet in memory element  22   c.    
     To insure timely delivery and the absence of blocking, each memory element must utilize a mechanism to separately track packets destined for each output port in the output group. In the preferred embodiment, descriptors, such as linked lists, are used to track the contents of the memory element based on the specific output port. A linked list maintains the valid list of packets destined for each port. Optionally, additional lists can be used to track packets based on other network parameters, such as classes of service, or ordered only traffic vs. bypassable traffic (for deadlock avoidance). In the preferred embodiment, the packet router identifies the class of service, output port, and other relevant network parameters associated with the packet and communicates this information to the group memory so the packet can be stored in the correct linked list. 
     Alternatively, each memory element can be further divided into Y smaller memory elements, where each of these smaller memory elements contains packets destined for only one specific output port. 
     The storage capacity of each memory element  22  must be at least equal to the amount of buffering that is communicated to the neighboring switch, multiplied by the number of input ports in that group. In the above example, if each input port had communicated that an amount of memory, M, was available, then the total memory in each memory element can be expressed as Y multiplied by M, where Y is the number of input ports in the group and M is the amount of memory that each input port has communicated that it has available. This value is based on a worst case scenario, where all incoming packets on all input ports of the group are destined for the same output group. In that scenario, the memory element associated with that particular output group must be able to store all of those packets. Since there are X memory elements per group, the total memory per port logic  10  is given as: 
     Memory per port logic=X*Y*M. 
     Therefore, with a total of X groups within the switch, the total memory requirement is given by: 
     Total memory=X*X*Y*M, or X*N*M, where N is the number of input ports. 
     In the worst case scenario described above, a single memory element must be able to receive packets from all Y of the input ports simultaneously. Thus, the memory must receive data at Y multiplied by the line rate to effectively operate in this architecture. 
     Each group port logic  10  also comprises output logic  30 . The output logic  30  is in communication with Y output ports, and is also in communication with the memory elements  22  located in the input logic  20  of the various groups. As described earlier, in the preferred embodiment, there are X memory elements  22  in communication with the output logic  30 . The output logic must operate at a speed sufficient to allow all output ports to be transmitting simultaneously. Since there are Y output ports per group, the output logic must operate at Y multiplied by the line rate. Therefore, each memory element in communication with the output logic must be able to transmit data at that rate. Combining the receive and transmit requirements for the memory elements yields a total required speed of 2*Y, multiplied by the line rate, since the memory elements must be able to simultaneously receive and transmit data at the maximum rate. 
     In operation, the output logic  30  uses a time multiplexing algorithm to allocate one time slot per output port. As described earlier, each memory element utilizes a mechanism, preferably linked lists, so that the scheduler can identify and locate packets intended for each specific output port within the memory element. The scheduler, using any of a number of known algorithms, selects a packet from one of the memory elements associated with this output group and transmits that packet via the specific output port. The scheduler repeats this process for each output port in the group. 
     Thus, by using this architecture, the amount of memory required and the speed of that memory can be varied in accordance with various design considerations. Table 2 illustrates the potential implementations involving a switch with 12 input ports and 12 output ports in accordance with the present invention. 
     
       
         
               
               
               
               
             
               
               
               
               
             
           
               
                 TABLE 2 
               
               
                   
               
               
                 # of groups 
                 # of ports 
                 Memory Size 
                 Memory speed 
               
               
                 (X) 
                 per group (Y) 
                 (* M) 
                 (* line rate) 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                 1 
                 12 
                 12 
                 24 
               
               
                 2 
                 6 
                 24 
                 12 
               
               
                 3 
                 4 
                 36 
                 8 
               
               
                 4 
                 3 
                 48 
                 6 
               
               
                 6 
                 2 
                 72 
                 4 
               
               
                 12 
                 1 
                 144 
                 2 
               
               
                   
               
             
          
         
       
     
     As can be seen in this table, it is possible to vary the memory requirements significantly. For example, an implementation where X equals 1, has the same memory size requirements as an input queued switch, however requires significantly higher speed memory elements. Conversely, an implementation where Y equals 1, requires significant memory space, but has a memory speed requirement which is lower than the Combined Input/Output Queued switch, without the complex scheduling logic. Furthermore, a balance between memory size and memory speed can be achieved by the appropriate selection of X and Y. For example, an implementation where X equals 4 results in a memory configuration which can operate at less than half the speed required for an input queued switch, while being only four times the size of the input queued switch. Referring back to the technology trends noted above, such a tradeoff may be advantageous in the design of the switch. 
     Referring to  FIG. 7 , a specific embodiment of  FIG. 4  in which X is equal to 3 and Y is equal to 4 is shown. The group  0  port logic  100  is in communication with input ports  0  through  3 , and output ports  0  through  3 . Similarly, the group  1  port logic  200  is in communication with ports  4  through  7  and the group  2  port logic  300  is in communication with ports  8  through  11 . The group  0  port logic  100  has three memory elements  120 ; each of which is associated with one of the three groups. The time-multiplexed packet router  110  receives packets arriving from input ports  0  through  3 . It then determines which group of output ports it is destined for. For example, a packet destined for output port  8  will be placed in memory element  120   c , while a packet destined for output port  2  will be placed in memory element  120   a . The memory element then employs a mechanism enabling it to track the packets destined for each output port. For example, the memory element may employ four linked lists, one per output port, where it identifies the memory locations used for each output port. Alternatively, the memory element  120  can be subdivided into four smaller memory elements, where each of these smaller memories contains all of the packets for a particular output port. 
     Since the memory elements can potentially be receiving packets from all four input ports simultaneously, they must be able to receive data at a rate at least equal to four times the line rate. Similarly, the packet router  110  must operate at four times the line rate as well to deliver up to four packets simultaneously. 
     Since memory element  120   a  stores packets destined for output ports  0  through  3 , its size must be equal to four times the size that it communicated to any port. 
     In a second embodiment, multicast packets, which are packets that are to be sent to multiple destinations, can be placed into a plurality of the memory elements  120 . The router  110  would identify the packet as a multicast packet, identify the multicast group and place the incoming packet into the memory elements associated with each output port that is part of that multicast group. If the multicast packet is destined for several output ports within the same output group, the multicast packets can be inserted into several linked lists simultaneously without having to write the packet into the memory element multiple times. 
     Associated with group  0  port logic  100  is time-multiplexed output logic  130 . The group  0  output logic  130  is in communication with output ports  0  through  3 , while the group  1  output logic  230  is in communication with output ports  4  through  7  and group  2  output logic  330  is in communication with output ports  8  through  11 . The group  0  output logic  130  is also in communication with the memory elements in each port logic that are associated with group  0 . Therefore, output logic  130  is in communication with  120   a ,  220   a , and  320   a . Similarly, the group  1  output logic  230  is in communication with memory elements  120   b ,  220   b  and  320   b , and the group  2  output logic  330  is in communication with memory elements  120   c ,  220   c , and  320   c.    
     The output logic  130  schedules the transmission of packets for each output port in its group. For example, using the mechanism described above, it locates the next packet destined for output port  0  in each of the associated memory elements  120   a ,  220   a  and  320   a . Based on a scheduling algorithm, it selects one of these packets and transmits it via output port  0 . The output logic  130  then repeats this for output ports  1  through  3 , before returning to output port  0  and repeating the entire cycle again. Since the output logic must supply packets to all four output ports simultaneously, it must operate at a speed at least four times greater than the line rate. Similarly, since a single memory element may be supplying packets for all of the output ports simultaneously, the memory elements must also be able to supply data at least four times greater than the line rate. Thus, when combined with the input requirements, the memory elements must operate at eight times the line rate. 
     Since each memory element must be four times the amount communicated to the neighboring switches, and there are nine memory elements in this configuration, the total memory space is 36 times the amount communicated to the neighboring switches. 
     Summarizing, this configuration requires the memory to operate at only eight times the line rate, while a traditional input queued switch requires the memories to operate at 13 times the line rate for a similar 12 port switch. At the same time, the scheduling logic is straightforward, similar in complexity to that of the input queued switch and much simpler than the CIOQ switch. To achieve these design parameters, the memory elements are about three times larger than would be in a traditional input queued switch. 
     While this particular example shows the configuration of a 12-port switch, where there are an equal number of input and output ports, the invention is not so limited. The teachings of this invention can be applied to switches of various sizes and configurations. 
     In the above description, it is assumed that each switch communicates to each of its neighbors an amount of memory space, M, that is available for that neighbor to use. This amount can be the total available memory space, or optionally can be further divided into classes of service. As described above, in this scenario, the total memory space required per port logic is X*Y*M. However, since there are Y input ports and each can send packets that consume a memory space of M, the actual amount of utilized memory space is only Y*M. In other words, this architecture requires that the memory elements for a given port logic block must be able to store X times as much data than can actually be transmitted to it, since the switch cannot predetermine which memory group the incoming packets are destined for and therefore must maximally size each of the memory elements. 
     Alternatively, the switch can communicate the amount of memory space that is available to each of its neighbors based on the output port which the incoming packet will use. In other words, the switch can communicate to its neighbor that it has an available amount of memory space, M′, for packets that are destined for its output port  0 . Similarly, communications can be performed to inform the neighboring switches of the available memory space for each of the other output ports. In this way, the total memory space per port logic is given by: 
     (the total number of output ports)*M′*(the number of ports in the port group) or Y*Y*X*M′. 
     In one embodiment, M′ is defined as M/(X*Y), so that the total number of memory that is made available to the neighboring switch remains constant. In this embodiment, the total memory space is defined as: 
     Y*Y*X*M′, or Y*M. 
     This approach reduces the overall size of the memory to that used by the Input Queued switch. 
     Other possible credit systems can be employed to achieve a similar improvement in memory utilization and the above description should not be construed to limiting the invention to only this embodiment.